Petr Hlinený

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 72

Top Venues

Publications

Petr Hlinený, Jan Jedelský
ℋ-Clique-Width and a Hereditary Analogue of Product Structure. MFCS (2024)
Petr Hlinený
Note on Min-k-Planar Drawings of Graphs. CoRR (2024)
Jakub Balabán, Petr Hlinený, Jan Jedelský
Twin-width and transductions of proper k-mixed-thin graphs. Discret. Math. 347 (8) (2024)
Petr Hlinený, Jan Jedelský
H-Clique-Width and a Hereditary Analogue of Product Structure. CoRR (2024)
Petr Hlinený, Liana Khazaliya
Crossing Number is NP-hard for Constant Path-width (and Tree-width). CoRR (2024)
Martin Balko, Petr Hlinený, Tomás Masarík, Joachim Orthaber, Birgit Vogtenhuber, Mirko H. Wagner
On the Uncrossed Number of Graphs. CoRR (2024)
Onur Çagirici, Petr Hlinený, Bodhayan Roy
On colourability of polygon visibility graphs. Eur. J. Comb. 117 (2024)
Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran
Clique-width of point configurations. J. Comb. Theory, Ser. B 158 (Part) (2023)
Markus Chimani, Petr Hlinený
Inserting Multiple Edges into a Planar Graph. J. Graph Algorithms Appl. 27 (6) (2023)
Petr Hlinený
Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs. CoRR (2023)
Petr Hlinený, Tomás Masarík
Minimizing an Uncrossed Collection of Drawings. CoRR (2023)
Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski
Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. ISAAC (2023)
Petr Hlinený, Jan Jedelský
Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar. ICALP (2023)
Petr Hlinený, Adam Straka
Stack and Queue Numbers of Graphs Revisited. CoRR (2023)
Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski
Sparse Graphs of Twin-width 2 Have Bounded Tree-width. CoRR (2023)
Petr Hlinený, Tomás Masarík
Minimizing an Uncrossed Collection of Drawings. GD (1) (2023)
Deniz Agaoglu Çagirici, Petr Hlinený
-Graphs and T-Graphs. Algorithmica 85 (2) (2023)
Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman
Recognizing H-Graphs - Beyond Circular-Arc Graphs. MFCS (2023)
Petr Hlinený, Jan Jedelský
Twin-width of Planar Graphs is at most 8. CoRR (2022)
Jakub Balabán, Petr Hlinený, Jan Jedelský
Twin-Width and Transductions of Proper k-Mixed-Thin Graphs. WG (2022)
Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann
Graph Product Structure for h-Framed Graphs. CoRR (2022)
Thekla Hamm, Petr Hlinený
Parameterised Partially-Predrawn Crossing Number. SoCG (2022)
Jakub Balabán, Petr Hlinený, Jan Jedelský
Twin-width and Transductions of Proper k-Mixed-Thin Graphs. CoRR (2022)
Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman
Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs. CoRR (2022)
Deniz Agaoglu, Petr Hlinený
Automorphism Group of Marked Interval Graphs in FPT. CoRR (2022)
Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann
Graph Product Structure for h-Framed Graphs. ISAAC (2022)
Petr Hlinený, Filip Pokrývka
Twin-width and Limits of Tractability of FO Model Checking on Geometric Graphs. CoRR (2022)
Thekla Hamm, Petr Hlinený
Parameterised Partially-Predrawn Crossing Number. CoRR (2022)
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12. Comb. 42 (5) (2022)
Deniz Agaoglu Çagirici, Petr Hlinený
Isomorphism Testing for T-graphs in FPT. WALCOM (2022)
Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl
Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. MFCS (2021)
Deniz Agaoglu, Petr Hlinený
Isomorphism Testing for T-graphs in FPT. CoRR (2021)
Jakub Balabán, Petr Hlinený
Twin-Width is Linear in the Poset Width. CoRR (2021)
Jakub Balabán, Petr Hlinený
Twin-Width Is Linear in the Poset Width. IPEC (2021)
Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl
Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges. CoRR (2021)
Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran
Clique-Width of Point Configurations. WG (2020)
Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran
Clique-Width of Point Configurations. CoRR (2020)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
A New Perspective on FO Model Checking of Dense Graph Classes. ACM Trans. Comput. Log. 21 (4) (2020)
Deniz Agaoglu, Petr Hlinený
Isomorphism Problem for S_d-Graphs. MFCS (2020)
Markus Chimani, Petr Hlinený, Gelasio Salazar
Toroidal grid minors and stretch in embedded graphs. J. Comb. Theory, Ser. B 140 (2020)
Petr Hlinený, Abhisekh Sankaran
Exact Crossing Number Parameterized by Vertex Cover. CoRR (2019)
Petr Hlinený, Abhisekh Sankaran
Exact Crossing Number Parameterized by Vertex Cover. Graph Drawing (2019)
Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
Parameterized shifted combinatorial optimization. J. Comput. Syst. Sci. 99 (2019)
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. SoCG (2019)
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez
Shrub-depth: Capturing Height of Dense Graphs. Log. Methods Comput. Sci. 15 (1) (2019)
Onur Çagirici, Petr Hlinený, Bodhayan Roy
On Colourability of Polygon Visibility Graphs. CoRR (2019)
Drago Bokal, Mojca Bracic, Marek Dernár, Petr Hlinený
On Degree Properties of Crossing-Critical Families of Graphs. Electron. J. Comb. 26 (1) (2019)
Petr Hlinený, Filip Pokrývka, Bodhayan Roy
FO model checking on geometric graphs. Comput. Geom. 78 (2019)
Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy
On Conflict-Free Chromatic Guarding of Simple Polygons. COCOA (2019)
Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy
On conflict-free chromatic guarding of simple polygons. CoRR (2019)
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12. CoRR (2019)
Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary
Parameterized extension complexity of independent set and related problems. Discret. Appl. Math. 248 (2018)
Zdenek Dvorák, Petr Hlinený, Bojan Mohar
Structure and Generation of Crossing-Critical Graphs. SoCG (2018)
Petr Hlinený
A Simpler Self-reduction Algorithm for Matroid Path-Width. SIAM J. Discret. Math. 32 (2) (2018)
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, M. S. Ramanujan
A New Perspective on FO Model Checking of Dense Graph Classes. CoRR (2018)
Petr Hlinený, Carsten Thomassen
Deciding Parity of Graph Crossing Number. SIAM J. Discret. Math. 32 (3) (2018)
Zdenek Dvorák, Petr Hlinený, Bojan Mohar
Structure and generation of crossing-critical graphs. CoRR (2018)
Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
Parameterized Shifted Combinatorial Optimization. CoRR (2017)
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez
Shrub-depth: Capturing Height of Dense Graphs. CoRR (2017)
Onur Cagirici, Petr Hlinený, Bodhayan Roy
On Colourability of Polygon Visibility Graphs. FSTTCS (2017)
Markus Chimani, Petr Hlinený
A tighter insertion-based approximation of the crossing number. J. Comb. Optim. 33 (4) (2017)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
Kernelization using structural parameters on sparse graph classes. J. Comput. Syst. Sci. 84 (2017)
Petr Hlinený, Filip Pokrývka, Bodhayan Roy
FO Model Checking of Geometric Graphs. IPEC (2017)
Petr Hlinený, Filip Pokrývka, Bodhayan Roy
FO model checking of geometric graphs. CoRR (2017)
Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
Parameterized Shifted Combinatorial Optimization. COCOON (2017)
Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma
First order limits of sparse graphs: Plane trees and path-width. Random Struct. Algorithms 50 (4) (2017)
Petr Hlinený
Simpler Self-reduction Algorithm for Matroid Path-width. CoRR (2016)
Petr Hlinený, Marek Dernár
Crossing Number is Hard for Kernelization. SoCG (2016)
Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
Tree-depth and vertex-minors. Eur. J. Comb. 56 (2016)
Markus Chimani, Petr Hlinený
Inserting Multiple Edges into a Planar Graph. SoCG (2016)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
A New Perspective on FO Model Checking of Dense Graph Classes. LICS (2016)
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Are there any good digraph width measures? J. Comb. Theory, Ser. B 116 (2016)
Petr Hlinený, Gelasio Salazar
On Hardness of the Joint Crossing Number. ISAAC (2015)
Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary
Parameterized Extension Complexity of Independent Set and Related Problems. CoRR (2015)
Martin Derka, Petr Hlinený
Planar emulators conjecture is nearly true for cubic graphs. Eur. J. Comb. 48 (2015)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak
Faster Existential FO Model Checking on Posets. Log. Methods Comput. Sci. 11 (4) (2015)
Markus Chimani, Petr Hlinený
Inserting Multiple Edges into a Planar Graph. CoRR (2015)
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
FO Model Checking on Posets of Bounded Width. CoRR (2015)
Tomás Brázdil, Petr Hlinený, Antonín Kucera, Vojtech Rehák, Matús Abaffy
Strategy Synthesis in Adversarial Patrolling Games. CoRR (2015)
Jakub Gajarský, Petr Hlinený
Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences. Log. Methods Comput. Sci. 11 (1) (2015)
Drago Bokal, Mojca Bracic, Marek Dernár, Petr Hlinený
On Degree Properties of Crossing-Critical Families of Graphs. Graph Drawing (2015)
Petr Hlinený, Ondrej Slámecka
Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs. MEMICS (2015)
Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska
FO Model Checking of Interval Graphs Log. Methods Comput. Sci. 11 (4) (2015)
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
FO Model Checking on Posets of Bounded Width. FOCS (2015)
Petr Hlinený, Marek Dernár
Crossing Number is Hard for Kernelization. CoRR (2015)
Petr Hlinený, Gelasio Salazar
On Hardness of the Joint Crossing Number. CoRR (2015)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak
Faster Existential FO Model Checking on Posets. ISAAC (2014)
Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
Tree-depth and Vertex-minors. CoRR (2014)
Sergio Cabello, Markus Chimani, Petr Hlinený
Computing the Stretch of an Embedded Graph. SIAM J. Discret. Math. 28 (3) (2014)
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
model-checking. J. Comput. Syst. Sci. 80 (1) (2014)
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
Digraph width measures in parameterized algorithmics. Discret. Appl. Math. 168 (2014)
Robert Ganian, Petr Hlinený, Jan Obdrzálek
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. Fundam. Informaticae 123 (1) (2013)
Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska
FO Model Checking of Interval Graphs. ICALP (2) (2013)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
Kernelization Using Structural Parameters on Sparse Graph Classes CoRR (2013)
Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek
How not to characterize planar-emulable graphs. Adv. Appl. Math. 50 (1) (2013)
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) (2013)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
Kernelization Using Structural Parameters on Sparse Graph Classes. ESA (2013)
Petr Hlinený, Ondrej Moris
Generalized Maneuvers in Route Planning for Computing and Informatics. Comput. Informatics 31 (3) (2012)
Petr Hlinený, Antonín Kucera
Preface. Theor. Comput. Sci. 417 (2012)
Jakub Gajarský, Petr Hlinený
Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. FSTTCS (2012)

Petr Hlinený.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Petr Hlinený