Contact Graphs of Curves. - Petr Hlinený (GD, 1995)

Touching Graphs of Unit Balls. - Petr Hlinený (GD, 1997)

Computational Complexity of the Krausz Dimension of Graphs. - Petr Hlinený; Jan Kratochvíl (WG, 1997)

The Maximal Clique and Colourability of Curve Contact Graphs. - Petr Hlinený (Discret. Appl. Math., 1998)

Classes and Recognition of Curve Contact Graphs, . - Petr Hlinený (J. Comb. Theory B, 1998)

A note on possible extensions of Negami's conjecture. - Petr Hlinený (J. Graph Theory, 1999)

Crossing-Critical Graphs and Path-Width. - Petr Hlinený (GD, 2001)

An Addition to Art Galleries with Interior Walls. - Petr Hlinený (Discret. Comput. Geom., 2001)

Contact graphs of line segments are NP-complete. - Petr Hlinený (Discret. Math., 2001)

Representing graphs by disks and balls (a survey of recognition-complexity results). - Petr Hlinený; Jan Kratochvíl (Discret. Math., 2001)

Another two graphs with no planar covers. - Petr Hlinený (J. Graph Theory, 2001)

On the Excluded Minors for Matroids of Branch-Width Three. - Petr Hlinený (Electron. J. Comb., 2002)

On Matroid Properties Definable in the MSO Logic. - Petr Hlinený (MFCS, 2003)

Crossing-number critical graphs have bounded path-width. - Petr Hlinený (J. Comb. Theory B, 2003)

On Decidability of MSO Theories of Representable Matroids. - Petr Hlinený; Detlef Seese (IWPEC, 2004)

On possible counterexamples to Negami's planar cover conjecture. - Petr Hlinený; Robin Thomas 001 (J. Graph Theory, 2004)

Bridging Separations in Matroids. - James F. Geelen; Petr Hlinený; Geoffrey P. Whittle (SIAM J. Discret. Math., 2004)

A Parametrized Algorithm for Matroid Branch-Width. - Petr Hlinený (SIAM J. Comput., 2005)

On the Crossing Number of Almost Planar Graphs. - Petr Hlinený; Gelasio Salazar (GD, 2006)

On Matroid Representability and Minor Problems. - Petr Hlinený (MFCS, 2006)

Balanced Signings and the Chromatic Number of Oriented Matroids. - Luis A. Goddyn; Petr Hlinený; Winfried Hochstättler (Comb. Probab. Comput., 2006)

The Tutte Polynomial for Matroids of Bounded Branch-Width. - Petr Hlinený (Comb. Probab. Comput., 2006)

Equivalence-free exhaustive generation of matroid representations. - Petr Hlinený (Discret. Appl. Math., 2006)

Matroid tree-width. - Petr Hlinený; Geoff Whittle (Eur. J. Comb., 2006)

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

Crossing number is hard for cubic graphs. - Petr Hlinený (J. Comb. Theory B, 2006)

Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. - Omer Giménez; Petr Hlinený; Marc Noy (SIAM J. Discret. Math., 2006)

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

Approximating the Crossing Number of Toroidal Graphs. - Petr Hlinený; Gelasio Salazar (ISAAC, 2007)

The crossing number of a projective graph is quadratic in the face-width. - Isidoro Gitler; Petr Hlinený; Jesús Leaños; Gelasio Salazar (Electron. Notes Discret. Math., 2007)

Preface. - Petr Hlinený; Jan Kratochvíl; Roman Nedela; Martin Skoviera (Electron. Notes Discret. Math., 2007)

Some Hard Problems on Matroid Spikes. - Petr Hlinený (Theory Comput. Syst., 2007)

Approximating the Crossing Number of Apex Graphs. - Markus Chimani; Petr Hlinený; Petra Mutzel (GD, 2008)

Automata approach to graphs of bounded rank-width. - Petr Hlinený; Robert Ganian (IWOCA, 2008)

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

New Infinite Families of Almost-Planar Crossing-Critical Graphs. - Petr Hlinený (Electron. J. Comb., 2008)

Finding Branch-Decompositions and Rank-Decompositions. - Petr Hlinený; Sang-il Oum (SIAM J. Comput., 2008)

Better Polynomial Algorithms on Graphs of Bounded Rank-Width. - Robert Ganian; Petr Hlinený (IWOCA, 2009)

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

Addendum to matroid tree-width. - Petr Hlinený; Geoff Whittle (Eur. J. Comb., 2009)

Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. - Petr Hlinený; Markus Chimani (SODA, 2010)

New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. - Robert Ganian; Petr Hlinený (SOFSEM, 2010)

On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. - Robert Ganian; Petr Hlinený (Discret. Appl. Math., 2010)

20 Years of Negami's Planar Cover Conjecture. - Petr Hlinený (Graphs Comb., 2010)

Stars and bonds in crossing-critical graphs. - Petr Hlinený; Gelasio Salazar (J. Graph Theory, 2010)

Scope-Based Route Planning. - Petr Hlinený; Ondrej Moris (ESA, 2011)

Generalized Maneuvers in Route Planning. - Petr Hlinený; Ondrej Moris (MEMICS, 2011)

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

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

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

Parameterized Problems Related to Seidel's Switching. - Eva Jelínková; Ondrej Suchý 001; Petr Hlinený; Jan Kratochvíl (Discret. Math. Theor. Comput. Sci., 2011)

Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. - Jakub Gajarský; Petr Hlinený (FSTTCS, 2012)

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

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

Generalized Maneuvers in Route Planning for Computing and Informatics. - Petr Hlinený; Ondrej Moris (Comput. Informatics, 2012)

Dynamic Scope-Based Dijkstra's Algorithm - Petr Hlinený; Ondrej Moris (CoRR, 2012)

Detours in Scope-Based Route Planning - Petr Hlinený; Ondrej Moris (CoRR, 2012)

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

Preface. - Petr Hlinený; Antonín Kucera 001 (Theor. Comput. Sci., 2012)

How not to characterize planar-emulable graphs. - Markus Chimani; Martin Derka; Petr Hlinený; Matej Klusácek (Adv. Appl. Math., 2013)

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

Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. - Robert Ganian; Petr Hlinený; Jan Obdrzálek (Fundam. Informaticae, 2013)

Digraph width measures in parameterized algorithmics. - Robert Ganian; Petr Hlinený; Joachim Kneis; Alexander Langer; Jan Obdrzálek; Peter Rossmanith (Discret. Appl. Math., 2014)

Lower bounds on the complexity of MSO1 model-checking. - Robert Ganian; Petr Hlinený; Alexander Langer; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (J. Comput. Syst. Sci., 2014)

Computing the Stretch of an Embedded Graph. - Sergio Cabello; Markus Chimani; Petr Hlinený (SIAM J. Discret. Math., 2014)

FO Model Checking on Posets of Bounded Width. - Jakub Gajarský; Petr Hlinený; Daniel Lokshtanov; Jan Obdrzálek; Sebastian Ordyniak; M. S. Ramanujan 001; Saket Saurabh 001 (FOCS, 2015)

On Hardness of the Joint Crossing Number. - Petr Hlinený; Gelasio Salazar (ISAAC, 2015)

Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs. - Petr Hlinený; Ondrej Slámecka (MEMICS, 2015)

Strategy Synthesis in Adversarial Patrolling Games. - Tomás Brázdil; Petr Hlinený; Antonín Kucera 001; Vojtech Rehák; Matús Abaffy (CoRR, 2015)

Faster Existential FO Model Checking on Posets. - Jakub Gajarský; Petr Hlinený; Jan Obdrzálek; Sebastian Ordyniak (Log. Methods Comput. Sci., 2015)

Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences. - Jakub Gajarský; Petr Hlinený (Log. Methods Comput. Sci., 2015)

FO Model Checking of Interval Graphs - Robert Ganian; Petr Hlinený; Daniel Král; Jan Obdrzálek; Jarett Schwartz; Jakub Teska (Log. Methods Comput. Sci., 2015)

Planar emulators conjecture is nearly true for cubic graphs. - Martin Derka; Petr Hlinený (Eur. J. Comb., 2015)

Crossing Number is Hard for Kernelization. - Petr Hlinený; Marek Dernár (SoCG, 2016)

Tree-depth and vertex-minors. - Petr Hlinený; O-joung Kwon; Jan Obdrzálek; Sebastian Ordyniak (Eur. J. Comb., 2016)

Are there any good digraph width measures? - Robert Ganian; Petr Hlinený; Joachim Kneis; Daniel Meister 001; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (J. Comb. Theory B, 2016)

A tighter insertion-based approximation of the crossing number. - Markus Chimani; Petr Hlinený (J. Comb. Optim., 2017)

Kernelization using structural parameters on sparse graph classes. - Jakub Gajarský; Petr Hlinený; Jan Obdrzálek; Sebastian Ordyniak; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar (J. Comput. Syst. Sci., 2017)

First order limits of sparse graphs: Plane trees and path-width. - Jakub Gajarský; Petr Hlinený; Tomás Kaiser; Daniel Král'; Martin Kupec; Jan Obdrzálek; Sebastian Ordyniak; Vojtech Tuma (Random Struct. Algorithms, 2017)

Structure and Generation of Crossing-Critical Graphs. - Zdenek Dvorák 001; Petr Hlinený; Bojan Mohar (SoCG, 2018)

Parameterized extension complexity of independent set and related problems. - Jakub Gajarský; Petr Hlinený; Hans Raj Tiwary (Discret. Appl. Math., 2018)

A Simpler Self-reduction Algorithm for Matroid Path-Width. - Petr Hlinený (SIAM J. Discret. Math., 2018)

Deciding Parity of Graph Crossing Number. - Petr Hlinený; Carsten Thomassen (SIAM J. Discret. Math., 2018)

On Conflict-Free Chromatic Guarding of Simple Polygons. - Onur Çagirici; Subir Kumar Ghosh; Petr Hlinený; Bodhayan Roy (COCOA, 2019)

Exact Crossing Number Parameterized by Vertex Cover. - Petr Hlinený; Abhisekh Sankaran (GD, 2019)

On Degree Properties of Crossing-Critical Families of Graphs. - Drago Bokal; Mojca Bracic; Marek Dernár; Petr Hlinený (Electron. J. Comb., 2019)

FO model checking on geometric graphs. - Petr Hlinený; Filip Pokrývka; Bodhayan Roy (Comput. Geom., 2019)

Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12. - Drago Bokal; Zdenek Dvorák 001; Petr Hlinený; Jesús Leaños; Bojan Mohar; Tilo Wiedera (CoRR, 2019)

Parameterized shifted combinatorial optimization. - Jakub Gajarský; Petr Hlinený; Martin Koutecký; Shmuel Onn (J. Comput. Syst. Sci., 2019)

Shrub-depth: Capturing Height of Dense Graphs. - Robert Ganian; Petr Hlinený; Jaroslav Nesetril; Jan Obdrzálek; Patrice Ossona de Mendez (Log. Methods Comput. Sci., 2019)

Isomorphism Problem for S_d-Graphs. - Deniz Agaoglu; Petr Hlinený (MFCS, 2020)

Toroidal grid minors and stretch in embedded graphs. - Markus Chimani; Petr Hlinený; Gelasio Salazar (J. Comb. Theory, Ser. B, 2020)

A New Perspective on FO Model Checking of Dense Graph Classes. - Jakub Gajarský; Petr Hlinený; Jan Obdrzálek; Daniel Lokshtanov; M. S. Ramanujan 001 (ACM Trans. Comput. Log., 2020)

Twin-Width Is Linear in the Poset Width. - Jakub Balabán; Petr Hlinený (IPEC, 2021)

Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. - Jan Bok; Jirí Fiala 001; Petr Hlinený; Nikola Jedlicková; Jan Kratochvíl (MFCS, 2021)

Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges. - Jan Bok; Jirí Fiala 001; Petr Hlinený; Nikola Jedlicková; Jan Kratochvíl (CoRR, 2021)

Parameterised Partially-Predrawn Crossing Number. - Thekla Hamm; Petr Hlinený (SoCG, 2022)

Isomorphism Testing for T-graphs in FPT. - Deniz Agaoglu Çagirici; Petr Hlinený (WALCOM, 2022)

Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12. - Drago Bokal; Zdenek Dvorák 001; Petr Hlinený; Jesús Leaños; Bojan Mohar; Tilo Wiedera (Comb., 2022)

Automorphism Group of Marked Interval Graphs in FPT. - Deniz Agaoglu; Petr Hlinený (CoRR, 2022)

Twin-width and Limits of Tractability of FO Model Checking on Geometric Graphs. - Petr Hlinený; Filip Pokrývka (CoRR, 2022)

Twin-width of Planar Graphs is at most 8. - Petr Hlinený; Jan Jedelský (CoRR, 2022)

Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs. - Deniz Agaoglu Çagirici; Onur Çagirici; Jan Derbisz; Tim A. Hartmann; Petr Hlinený; Jan Kratochvíl; Tomasz Krawczyk; Peter Zeman 001 (CoRR, 2022)

Minimizing an Uncrossed Collection of Drawings. - Petr Hlinený; Tomás Masarík (GD (1), 2023)

Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar. - Petr Hlinený; Jan Jedelský (ICALP, 2023)

Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. - Benjamin Bergougnoux; Jakub Gajarský; Grzegorz Guspiel; Petr Hlinený; Filip Pokrývka; Marek Sokolowski 001 (ISAAC, 2023)

Recognizing H-Graphs - Beyond Circular-Arc Graphs. - Deniz Agaoglu Çagirici; Onur Çagirici; Jan Derbisz; Tim A. Hartmann; Petr Hlinený; Jan Kratochvíl; Tomasz Krawczyk; Peter Zeman 001 (MFCS, 2023)

Clique-width of point configurations. - Onur Çagirici; Petr Hlinený; Filip Pokrývka; Abhisekh Sankaran (J. Comb. Theory B, 2023)

Inserting Multiple Edges into a Planar Graph. - Markus Chimani; Petr Hlinený (J. Graph Algorithms Appl., 2023)

Efficient Isomorphism for Sd-Graphs and T-Graphs. - Deniz Agaoglu Çagirici; Petr Hlinený (Algorithmica, 2023)

On the Uncrossed Number of Graphs. - Martin Balko; Petr Hlinený; Tomás Masarík; Joachim Orthaber; Birgit Vogtenhuber; Mirko H. Wagner (GD, 2024)

Note on Min- k-Planar Drawings of Graphs. - Petr Hlinený; Csenge Lili Ködmön (GD, 2024)

Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width). - Petr Hlinený; Liana Khazaliya (ISAAC, 2024)

ℋ-Clique-Width and a Hereditary Analogue of Product Structure. - Petr Hlinený; Jan Jedelský (MFCS, 2024)

Graph Product Structure for $h$-Framed Graphs. - Michael A. Bekos; Giordano Da Lozzo; Petr Hlinený; Michael Kaufmann 001 (Electron. J. Comb., 2024)

Note on Min-k-Planar Drawings of Graphs. - Petr Hlinený (CoRR, 2024)

FPT Algorithms for Crossing Number Problems: A Unified Approach. - Éric Colin de Verdière; Petr Hlinený (CoRR, 2024)

Twin-width and transductions of proper k-mixed-thin graphs. - Jakub Balabán; Petr Hlinený; Jan Jedelský (Discret. Math., 2024)

On colourability of polygon visibility graphs. - Onur Çagirici; Petr Hlinený; Bodhayan Roy (Eur. J. Comb., 2024)

Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs. - Petr Hlinený (MFCS, 2025)

On 13-crossing-critical graphs with arbitrarily large degrees. - Petr Hlinený; Michal Korbela (Discret. Math., 2025)

Twin-width of planar graphs; a short proof. - Petr Hlinený (Eur. J. Comb., 2025)

Stack and queue numbers of graphs revisited. - Petr Hlinený; Adam Straka (Eur. J. Comb., 2025)

Transductions of Graph Classes Admitting Product Structure. - Petr Hlinený; Jan Jedelský (CoRR, 2025)

k-Planar and Fan-Crossing Drawings and Transductions of Planar Graphs. - Petr Hlinený; Jan Jedelský (CoRR, 2025)