Search the dblp DataBase
Petr Hlinený :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Petr Hlinený Crossing-Critical Graphs and Path-Width. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2001, pp:102-114 [Conf ] Petr Hlinený Contact Graphs of Curves. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1995, pp:312-323 [Conf ] Petr Hlinený Touching Graphs of Unit Balls. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1997, pp:350-358 [Conf ] Petr Hlinený , Gelasio Salazar On the Crossing Number of Almost Planar Graphs. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2006, pp:162-173 [Conf ] Petr Hlinený , Detlef Seese On Decidability of MSO Theories of Representable Matroids. [Citation Graph (0, 0)][DBLP ] IWPEC, 2004, pp:96-107 [Conf ] Petr Hlinený On Matroid Properties Definable in the MSO Logic. [Citation Graph (0, 0)][DBLP ] MFCS, 2003, pp:470-479 [Conf ] Petr Hlinený Crossing Number Is Hard for Cubic Graphs. [Citation Graph (0, 0)][DBLP ] MFCS, 2004, pp:772-782 [Conf ] Petr Hlinený On Matroid Representability and Minor Problems. [Citation Graph (0, 0)][DBLP ] MFCS, 2006, pp:505-516 [Conf ] Petr Hlinený Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. [Citation Graph (0, 0)][DBLP ] STACS, 2003, pp:319-330 [Conf ] Omer Giménez , Petr Hlinený , Marc Noy Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP ] WG, 2005, pp:59-68 [Conf ] Petr Hlinený , Jan Kratochvíl Computational Complexity of the Krausz Dimension of Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1997, pp:214-228 [Conf ] Petr Hlinený On the Excluded Minors for Matroids of Branch-Width Three. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal ] Petr Hlinený The Maximal Clique and Colourability of Curve Contact Graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:59-68 [Journal ] Petr Hlinený Equivalence-free exhaustive generation of matroid representations. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:8, pp:1210-1222 [Journal ] Petr Hlinený An Addition to Art Galleries with Interior Walls. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 2001, v:25, n:2, pp:311-334 [Journal ] Petr Hlinený Contact graphs of line segments are NP-complete. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:235, n:1-3, pp:95-106 [Journal ] Petr Hlinený , Jan Kratochvíl Representing graphs by disks and balls (a survey of recognition-complexity results). [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:229, n:1-3, pp:101-124 [Journal ] Petr Hlinený , Geoff Whittle Matroid tree-width. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2006, v:27, n:7, pp:1117-1128 [Journal ] Petr Hlinený Crossing-number critical graphs have bounded path-width. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:347-367 [Journal ] Petr Hlinený Classes and Recognition of Curve Contact Graphs, . [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1998, v:74, n:1, pp:87-103 [Journal ] Petr Hlinený Crossing number is hard for cubic graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:455-471 [Journal ] Petr Hlinený Branch-width, parse trees, and monadic second-order logic for matroids. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:325-351 [Journal ] Petr Hlinený A Parametrized Algorithm for Matroid Branch-Width. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2005, v:35, n:2, pp:259-277 [Journal ] James F. Geelen , Petr Hlinený , Geoffrey P. Whittle Bridging Separations in Matroids. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2004, v:18, n:3, pp:638-646 [Journal ] Petr Hlinený , Detlef Seese Trees, grids, and MSO decidability: From graphs to matroids. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:351, n:3, pp:372-393 [Journal ] Petr Hlinený , Robin Thomas On possible counterexamples to Negami's planar cover conjecture. [Citation Graph (0, 0)][DBLP ] Journal of Graph Theory, 2004, v:46, n:3, pp:183-206 [Journal ] Petr Hlinený , Sang-il Oum Finding Branch-Decompositions and Rank-Decompositions. [Citation Graph (0, 0)][DBLP ] ESA, 2007, pp:163-174 [Conf ] Approximating the Crossing Number of Apex Graphs. [Citation Graph (, )][DBLP ] Approximating the Crossing Number of Toroidal Graphs. [Citation Graph (, )][DBLP ] On Digraph Width Measures in Parameterized Algorithmics. [Citation Graph (, )][DBLP ] Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. [Citation Graph (, )][DBLP ] New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. [Citation Graph (, )][DBLP ] Better Polynomial Algorithms on Graphs of Bounded Rank-Width. [Citation Graph (, )][DBLP ] Preface -- Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). [Citation Graph (, )][DBLP ] Width Parameters Beyond Tree-width and their Applications. [Citation Graph (, )][DBLP ] Are there any good digraph width measures? [Citation Graph (, )][DBLP ] Better algorithms for satisfiability problems for formulas of bounded rank-width [Citation Graph (, )][DBLP ] Balanced Signings and the Chromatic Number of Oriented Matroids. [Citation Graph (, )][DBLP ] The Tutte Polynomial for Matroids of Bounded Branch-Width. [Citation Graph (, )][DBLP ] On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. [Citation Graph (, )][DBLP ] Addendum to matroid tree-width. [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.006secs