Petr Hlinen{\'{y}}

Recent Publications

Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)
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.
Parameterised Partially-Predrawn Crossing Number
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.
A New Perspective on FO Model Checking of Dense Graph Classes
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.