| 2026 | ESA | Conflict-Free Coloring Planar Graphs with 4 Colors. | Petr Hlinen, Luks Mlik |
| 2026 | SOFSEM | k-Planar and Fan-Crossing Drawings and Transductions of Planar Graphs. | Petr Hlinen, Jan Jedelsk |
| 2025 | ESA | A Unified FPT Framework for Crossing Number Problems. | ric Colin de Verdire, Petr Hlinen |
| 2025 | LICS | Transductions of Graph Classes Admitting Product Structure. | Petr Hlinen, Jan Jedelsk |
| 2025 | MFCS | Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs. | Petr Hlinen |
| 2024 | GD | On the Uncrossed Number of Graphs. | Martin Balko, Petr Hlinen, Toms Masark, Joachim Orthaber, Birgit Vogtenhuber, Mirko H. Wagner |
| 2024 | GD | Note on Min- k-Planar Drawings of Graphs. | Petr Hlinen, Csenge Lili Kdmn |
| 2024 | ISAAC | Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width). | Petr Hlinen, Liana Khazaliya |
| 2024 | MFCS | ℋ-Clique-Width and a Hereditary Analogue of Product Structure. | Petr Hlinen, Jan Jedelsk |
| 2023 | GD | Minimizing an Uncrossed Collection of Drawings. | Petr Hlinen, Toms Masark |
| 2023 | ICALP | Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar. | Petr Hlinen, Jan Jedelsk |
| 2023 | ISAAC | Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. | Benjamin Bergougnoux, Jakub Gajarsk, Grzegorz Guspiel, Petr Hlinen, Filip Pokrvka, Marek Sokolowski |
| 2023 | MFCS | Recognizing H-Graphs - Beyond Circular-Arc Graphs. | Deniz Agaoglu agirici, Onur agirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinen, Jan Kratochvl, Tomasz Krawczyk, Peter Zeman |
| 2022 | ISAAC | Graph Product Structure for h-Framed Graphs. | Michael A. Bekos, Giordano Da Lozzo, Petr Hlinen, Michael Kaufmann |
| 2022 | WALCOM | Isomorphism Testing for T-graphs in FPT. | Deniz Agaoglu agirici, Petr Hlinen |
| 2022 | WG | Twin-Width and Transductions of Proper k-Mixed-Thin Graphs. | Jakub Balabn, Petr Hlinen, Jan Jedelsk |
| 2021 | MFCS | Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. | Jan Bok, Jir Fiala, Petr Hlinen, Nikola Jedlickov, Jan Kratochvl |
| 2020 | MFCS | Isomorphism Problem for S_d-Graphs. | Deniz Agaoglu, Petr Hlinen |
| 2020 | WG | Clique-Width of Point Configurations. | Onur agirici, Petr Hlinen, Filip Pokrvka, Abhisekh Sankaran |
| 2019 | COCOA | On Conflict-Free Chromatic Guarding of Simple Polygons. | Onur agirici, Subir Kumar Ghosh, Petr Hlinen, Bodhayan Roy |
| 2019 | GD | Exact Crossing Number Parameterized by Vertex Cover. | Petr Hlinen, Abhisekh Sankaran |
| 2017 | COCOON | Parameterized Shifted Combinatorial Optimization. | Jakub Gajarsk, Petr Hlinen, Martin Kouteck, Shmuel Onn |
| 2016 | LICS | A New Perspective on FO Model Checking of Dense Graph Classes. | Jakub Gajarsk, Petr Hlinen, Jan Obdrzlek, Daniel Lokshtanov, M. S. Ramanujan |
| 2015 | FOCS | FO Model Checking on Posets of Bounded Width. | Jakub Gajarsk, Petr Hlinen, Daniel Lokshtanov, Jan Obdrzlek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh |
| 2015 | GD | On Degree Properties of Crossing-Critical Families of Graphs. | Drago Bokal, Mojca Bracic, Marek Dernr, Petr Hlinen |
| 2015 | ISAAC | On Hardness of the Joint Crossing Number. | Petr Hlinen, Gelasio Salazar |
| 2014 | ISAAC | Faster Existential FO Model Checking on Posets. | Jakub Gajarsk, Petr Hlinen, Jan Obdrzlek, Sebastian Ordyniak |
| 2013 | ESA | Kernelization Using Structural Parameters on Sparse Graph Classes. | Jakub Gajarsk, Petr Hlinen, Jan Obdrzlek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Snchez Villaamil, Somnath Sikdar |
| 2013 | ICALP | FO Model Checking of Interval Graphs. | Robert Ganian, Petr Hlinen, Daniel Krl', Jan Obdrzlek, Jarett Schwartz, Jakub Teska |
| 2012 | MFCS | When Trees Grow Low: Shrubs and Fast MSO1. | Robert Ganian, Petr Hlinen, Jaroslav Nesetril, Jan Obdrzlek, Patrice Ossona de Mendez, Reshma Ramadurai |
| 2012 | STACS | Lower Bounds on the Complexity of MSO_1 Model-Checking. | Robert Ganian, Petr Hlinen, Alexander Langer, Jan Obdrzlek, Peter Rossmanith, Somnath Sikdar |
| 2011 | ESA | Scope-Based Route Planning. | Petr Hlinen, Ondrej Moris |
| 2011 | ICALP | A Tighter Insertion-Based Approximation of the Crossing Number. | Markus Chimani, Petr Hlinen |
| 2011 | IWOCA | How Not to Characterize Planar-Emulable Graphs. | Markus Chimani, Martin Derka, Petr Hlinen, Matej Kluscek |
| 2011 | STACS | Clique-width: When Hard Does Not Mean Impossible. | Robert Ganian, Petr Hlinen, Jan Obdrzlek |
| 2010 | SODA | Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. | Petr Hlinen, Markus Chimani |
| 2010 | SOFSEM | New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. | Robert Ganian, Petr Hlinen |
| 2009 | IWOCA | Better Polynomial Algorithms on Graphs of Bounded Rank-Width. | Robert Ganian, Petr Hlinen |
| 2008 | GD | Approximating the Crossing Number of Apex Graphs. | Markus Chimani, Petr Hlinen, Petra Mutzel |
| 2008 | IWOCA | Automata approach to graphs of bounded rank-width. | Petr Hlinen, Robert Ganian |
| 2007 | ESA | Finding Branch-Decompositions and Rank-Decompositions. | Petr Hlinen, Sang-il Oum |
| 2007 | ISAAC | Approximating the Crossing Number of Toroidal Graphs. | Petr Hlinen, Gelasio Salazar |
| 2006 | GD | On the Crossing Number of Almost Planar Graphs. | Petr Hlinen, Gelasio Salazar |
| 2006 | MFCS | On Matroid Representability and Minor Problems. | Petr Hlinen |
| 2005 | WG | Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. | Omer Gimnez, Petr Hlinen, Marc Noy |
| 2004 | MFCS | Crossing Number Is Hard for Cubic Graphs. | Petr Hlinen |
| 2003 | MFCS | On Matroid Properties Definable in the MSO Logic. | Petr Hlinen |
| 2003 | STACS | Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. | Petr Hlinen |
| 2001 | GD | Crossing-Critical Graphs and Path-Width. | Petr Hlinen |
| 1997 | GD | Touching Graphs of Unit Balls. | Petr Hlinen |
| 1997 | WG | Computational Complexity of the Krausz Dimension of Graphs. | Petr Hlinen, Jan Kratochvl |
| 1995 | GD | Contact Graphs of Curves. | Petr Hlinen |