Petr Hlinen{\'{y}}

Recent Publications

Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)
Petr Hlinen{\'{y}}, Liana Khazaliya
35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Juli'an Mestre and Anthony Wirth), volume 322 of LIPIcs, pages 40:1-40:15, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF bib Project DOI
Parameterised Partially-Predrawn Crossing Number
Thekla Hamm, Petr Hlinen{\'{y}}
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc and Michael Kerber), volume 224 of LIPIcs, pages 46:1-46:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF bib Project Project DOI
Kernelization using structural parameters on sparse graph classes
Jakub Gajarsk{\'{y}}, Petr Hlinen{\'{y}}, Jan Obdrz{\'{a}}lek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando S{\'{a}}nchez Villaamil, Somnath Sikdar
Journal of Computer and System Sciences, volume 84, pages 219-242, 2017.
bib
A New Perspective on FO Model Checking of Dense Graph Classes
Jakub Gajarsk{\'{y}}, Petr Hlinen{\'{y}}, Jan Obdrz{\'{a}}lek, Daniel Lokshtanov, M. S. Ramanujan
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS ‘16, New York, NY, USA, July 5-8, 2016, pages 176-184, 2016.
PDF bib
Tree-depth and vertex-minors
Petr Hlinen{\'{y}}, O{-}Joung Kwon, Jan Obdrz{\'{a}}lek, Sebastian Ordyniak
Eur. J. Comb., volume 56, pages 46-56, 2016.
bib