Petr Hlinený

Robert Ganian, Petr Hlinený, Jan Obdrzálek: A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. Eur. J. Comb. 34(3): 680-701 (2013)

Robert Ganian, Petr Hlinený, Jan Obdrzálek: Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. Fundam. Inform. 123(1): 59-76 (2013)

Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska: FO Model Checking of Interval Graphs. CoRR abs/1302.6043 (2013)

Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sanchez Villaamil, Somnath Sikdar: Kernelization Using Structural Parameters on Sparse Graph Classes. CoRR abs/1302.6863 (2013)

Petr Hlinený, Ondrej Moris: Generalized Maneuvers in Route Planning for Computing and Informatics. Computing and Informatics 31(3): 531- (2012)

Markus Chimani, Petr Hlinený, Petra Mutzel: Vertex insertion approximates the crossing number of apex graphs. Eur. J. Comb. 33(3): 326-335 (2012)

Petr Hlinený, Antonín Kucera: Preface. Theor. Comput. Sci. 417: 1 (2012)

Jakub Gajarský, Petr Hlinený: Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. FSTTCS 2012: 112-123

Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai: When Trees Grow Low: Shrubs and Fast MSO1. MFCS 2012: 419-430

Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Lower Bounds on the Complexity of MSO_1 Model-Checking. STACS 2012: 326-337

Petr Hlinený, Ondrej Moris: Dynamic Scope-Based Dijkstra's Algorithm. CoRR abs/1201.2000 (2012)

Jakub Gajarský, Petr Hlinený: Deciding Graph MSO Properties: Has it all been told already? CoRR abs/1204.5194 (2012)

Petr Hlinený, Ondrej Moris: Detours in Scope-Based Route Planning. CoRR abs/1205.4363 (2012)

Eva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl: Parameterized Problems Related to Seidel's Switching. Discrete Mathematics & Theoretical Computer Science 13(2): 19-44 (2011)

Petr Hlinený, Ondrej Moris: Scope-Based Route Planning. ESA 2011: 445-456

Markus Chimani, Petr Hlinený: A Tighter Insertion-Based Approximation of the Crossing Number. ICALP (1) 2011: 122-134

Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek: How Not to Characterize Planar-Emulable Graphs. IWOCA 2011: 106-120

Petr Hlinený, Ondrej Moris: Generalized Maneuvers in Route Planning. MEMICS 2011: 155-166

Robert Ganian, Petr Hlinený, Jan Obdrzálek: Clique-width: When Hard Does Not Mean Impossible. STACS 2011: 404-415

Petr Hlinený, Ondrej Moris: Multi-Stage Improved Route Planning Approach: theoretical foundations. CoRR abs/1101.3182 (2011)

Markus Chimani, Petr Hlinený: A Tighter Insertion-based Approximation of the Crossing Number. CoRR abs/1104.5039 (2011)

Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek: How Not to Characterize Planar-emulable Graphs. CoRR abs/1107.0176 (2011)

Petr Hlinený, Ondrej Moris: Generalized Maneuvers in Route Planning. CoRR abs/1107.0798 (2011)

Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Lower Bounds on the Complexity of MSO1 Model-Checking. CoRR abs/1109.5804 (2011)

Robert Ganian, Petr Hlinený: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Discrete Applied Mathematics 158(7): 851-867 (2010)

Petr Hlinený: 20 Years of Negami's Planar Cover Conjecture. Graphs and Combinatorics 26(4): 525-536 (2010)

Petr Hlinený, Gelasio Salazar: Stars and bonds in crossing-critical graphs. Journal of Graph Theory 65(3): 198-215 (2010)

Robert Ganian, Petr Hlinený, Jan Obdrzálek: Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. FSTTCS 2010: 73-83

Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Are There Any Good Digraph Width Measures? IPEC 2010: 135-146

Petr Hlinený, Markus Chimani: Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. SODA 2010: 918-927

Robert Ganian, Petr Hlinený: New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. SOFSEM 2010: 428-439

Petr Hlinený, Antonín Kucera (Eds.): Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings. Lecture Notes in Computer Science 6281, Springer 2010, isbn 978-3-642-15154-5

Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Are there any good digraph width measures? CoRR abs/1004.1485 (2010)

Robert Ganian, Petr Hlinený, Jan Obdrzálek: Better algorithms for satisfiability problems for formulas of bounded rank-width. CoRR abs/1006.5621 (2010)

Petr Hlinený, Geoff Whittle: Addendum to matroid tree-width. Eur. J. Comb. 30(4): 1036-1044 (2009)

Robert Ganian, Petr Hlinený: Better Polynomial Algorithms on Graphs of Bounded Rank-Width. IWOCA 2009: 266-277

Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith: On Digraph Width Measures in Parameterized Algorithmics. IWPEC 2009: 185-197

Petr Hlinený, Václav Matyás, Tomás Vojnar: Preface -- Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). MEMICS 2009

Petr Hlinený, Václav Matyás, Tomás Vojnar (Eds.): Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2009, November 13-15, 2009, Prestige Hotel, Znojmo, Czech Republic. OASICS 13, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2009

Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob: Width Parameters Beyond Tree-width and their Applications. Comput. J. 51(3): 326-362 (2008)

Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar: The Crossing Number of a Projective Graph is Quadratic in the Face-Width. Electr. J. Comb. 15(1) (2008)

Petr Hlinený: New Infinite Families of Almost-Planar Crossing-Critical Graphs. Electr. J. Comb. 15(1) (2008)

Petr Hlinený, Gelasio Salazar: Stars and Bonds in Crossing-Critical Graphs. Electronic Notes in Discrete Mathematics 31: 271-275 (2008)

Petr Hlinený, Sang-il Oum: Finding Branch-Decompositions and Rank-Decompositions. SIAM J. Comput. 38(3): 1012-1032 (2008)

Markus Chimani, Petr Hlinený, Petra Mutzel: Approximating the Crossing Number of Apex Graphs. Graph Drawing 2008: 432-434

Petr Hlinený, Robert Ganian: Automata approach to graphs of bounded rank-width. IWOCA 2008: 4-15

Petr Hlinený, Jan Kratochvíl, Roman Nedela, Martin Skoviera: Preface. Electronic Notes in Discrete Mathematics 28: 1 (2007)

Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar: The crossing number of a projective graph is quadratic in the face-width. Electronic Notes in Discrete Mathematics 29: 219-223 (2007)

Petr Hlinený: Some Hard Problems on Matroid Spikes. Theory Comput. Syst. 41(3): 551-562 (2007)

Petr Hlinený, Sang-il Oum: Finding Branch-Decompositions and Rank-Decompositions. ESA 2007: 163-174

Petr Hlinený, Gelasio Salazar: Approximating the Crossing Number of Toroidal Graphs. ISAAC 2007: 148-159

Petr Hlinený: The Tutte Polynomial for Matroids of Bounded Branch-Width. Combinatorics, Probability & Computing 15(3): 397-409 (2006)

Luis A. Goddyn, Petr Hlinený, Winfried Hochstättler: Balanced Signings and the Chromatic Number of Oriented Matroids. Combinatorics, Probability & Computing 15(4): 523-539 (2006)

Petr Hlinený: Equivalence-free exhaustive generation of matroid representations. Discrete Applied Mathematics 154(8): 1210-1222 (2006)

Petr Hlinený, Geoff Whittle: Matroid tree-width. Eur. J. Comb. 27(7): 1117-1128 (2006)

Petr Hlinený: Branch-width, parse trees, and monadic second-order logic for matroids. J. Comb. Theory, Ser. B 96(3): 325-351 (2006)

Petr Hlinený: Crossing number is hard for cubic graphs. J. Comb. Theory, Ser. B 96(4): 455-471 (2006)

Omer Giménez, Petr Hlinený, Marc Noy: Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. SIAM J. Discrete Math. 20(4): 932-946 (2006)

Petr Hlinený, Detlef Seese: Trees, grids, and MSO decidability: From graphs to matroids. Theor. Comput. Sci. 351(3): 372-393 (2006)

Petr Hlinený, Gelasio Salazar: On the Crossing Number of Almost Planar Graphs. Graph Drawing 2006: 162-173

Petr Hlinený: On Matroid Representability and Minor Problems. MFCS 2006: 505-516

Petr Hlinený: A Parametrized Algorithm for Matroid Branch-Width. SIAM J. Comput. 35(2): 259-277 (2005)

Omer Giménez, Petr Hlinený, Marc Noy: Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. WG 2005: 59-68

Petr Hlinený, Robin Thomas: On possible counterexamples to Negami's planar cover conjecture. Journal of Graph Theory 46(3): 183-206 (2004)

James F. Geelen, Petr Hlinený, Geoffrey P. Whittle: Bridging Separations in Matroids. SIAM J. Discrete Math. 18(3): 638-646 (2004)

Petr Hlinený, Detlef Seese: On Decidability of MSO Theories of Representable Matroids. IWPEC 2004: 96-107

Petr Hlinený: Crossing Number Is Hard for Cubic Graphs. MFCS 2004: 772-782

Petr Hlinený: Crossing-number critical graphs have bounded path-width. J. Comb. Theory, Ser. B 88(2): 347-367 (2003)

Petr Hlinený: On Matroid Properties Definable in the MSO Logic. MFCS 2003: 470-479

Petr Hlinený: Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. STACS 2003: 319-330

Petr Hlinený: On the Excluded Minors for Matroids of Branch-Width Three. Electr. J. Comb. 9(1) (2002)

Petr Hlinený: An Addition to Art Galleries with Interior Walls. Discrete & Computational Geometry 25(2): 311-334 (2001)

Petr Hlinený, Jan Kratochvíl: Representing graphs by disks and balls (a survey of recognition-complexity results). Discrete Mathematics 229(1-3): 101-124 (2001)

Petr Hlinený: Contact graphs of line segments are NP-complete. Discrete Mathematics 235(1-3): 95-106 (2001)

Petr Hlinený: Another two graphs with no planar covers. Journal of Graph Theory 37(4): 227-242 (2001)

Petr Hlinený: Crossing-Critical Graphs and Path-Width. Graph Drawing 2001: 102-114

Petr Hlinený: A note on possible extensions of Negami's conjecture. Journal of Graph Theory 32(3): 234-240 (1999)

Petr Hlinený: The Maximal Clique and Colourability of Curve Contact Graphs. Discrete Applied Mathematics 81(1-3): 59-68 (1998)

Petr Hlinený: Classes and Recognition of Curve Contact Graphs^, . J. Comb. Theory, Ser. B 74(1): 87-103 (1998)

Petr Hlinený: Touching Graphs of Unit Balls. Graph Drawing 1997: 350-358

Petr Hlinený, Jan Kratochvíl: Computational Complexity of the Krausz Dimension of Graphs. WG 1997: 214-228

Petr Hlinený: Contact Graphs of Curves. Graph Drawing 1995: 312-323