Clik here to view.
Structure and Generation of Crossing-Critical Graphs.
Zdenek Dvorák, Petr Hlinený, Bojan Mohar: Structure and Generation of Crossing-Critical Graphs. SoCG 2018: 33:1-33:14
View ArticleClik here to view.
Deciding Parity of Graph Crossing Number.
Petr Hlinený, Carsten Thomassen: Deciding Parity of Graph Crossing Number. SIAM J. Discret. Math. 32(3): 1962-1965 (2018)
View ArticleClik here to view.
A Simpler Self-reduction Algorithm for Matroid Path-Width.
Petr Hlinený: A Simpler Self-reduction Algorithm for Matroid Path-Width. SIAM J. Discret. Math. 32(2): 1425-1440 (2018)
View ArticleClik here to view.
Parameterized extension complexity of independent set and related problems.
Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary: Parameterized extension complexity of independent set and related problems. Discret. Appl. Math. 248: 56-67 (2018)
View ArticleClik here to view.
Exact Crossing Number Parameterized by Vertex Cover.
Petr Hlinený, Abhisekh Sankaran: Exact Crossing Number Parameterized by Vertex Cover. CoRR abs/1906.06048 (2019)
View ArticleClik here to view.
On Colourability of Polygon Visibility Graphs.
Onur Çagirici, Petr Hlinený, Bodhayan Roy: On Colourability of Polygon Visibility Graphs. CoRR abs/1906.01904 (2019)
View ArticleClik here to view.
On conflict-free chromatic guarding of simple polygons.
Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy: On conflict-free chromatic guarding of simple polygons. CoRR abs/1904.08624 (2019)
View ArticleClik here to view.
Bounded maximum degree conjecture holds precisely for c-crossing-critical...
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 abs/1903.05363 (2019)
View ArticleClik here to view.
Exact Crossing Number Parameterized by Vertex Cover.
Petr Hlinený, Abhisekh Sankaran: Exact Crossing Number Parameterized by Vertex Cover. GD 2019: 307-319
View ArticleClik here to view.
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c
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: 14:1-14:15
View ArticleClik here to view.
On Conflict-Free Chromatic Guarding of Simple Polygons.
Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy: On Conflict-Free Chromatic Guarding of Simple Polygons. COCOA 2019: 601-612
View ArticleClik here to view.
Shrub-depth: Capturing Height of Dense Graphs.
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)
View ArticleClik here to view.
Parameterized shifted combinatorial optimization.
Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn: Parameterized shifted combinatorial optimization. J. Comput. Syst. Sci. 99: 53-71 (2019)
View ArticleClik here to view.
FO model checking on geometric graphs.
Petr Hlinený, Filip Pokrývka, Bodhayan Roy: FO model checking on geometric graphs. Comput. Geom. 78: 1-19 (2019)
View ArticleClik here to view.
On Degree Properties of Crossing-Critical Families of Graphs.
Drago Bokal, Mojca Bracic, Marek Dernár, Petr Hlinený: On Degree Properties of Crossing-Critical Families of Graphs. Electron. J. Comb. 26(1): 1 (2019)
View ArticleClik here to view.
Clique-Width of Point Configurations.
Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran: Clique-Width of Point Configurations. CoRR abs/2004.02282 (2020)
View ArticleClik here to view.
Clique-Width of Point Configurations.
Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran: Clique-Width of Point Configurations. WG 2020: 54-66
View ArticleClik here to view.
Isomorphism Problem for S_d-Graphs.
Deniz Agaoglu, Petr Hlinený: Isomorphism Problem for S_d-Graphs. MFCS 2020: 4:1-4:14
View ArticleClik here to view.
A New Perspective on FO Model Checking of Dense Graph Classes.
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): 28:1-28:23 (2020)
View ArticleClik here to view.
Toroidal grid minors and stretch in embedded graphs.
Markus Chimani, Petr Hlinený, Gelasio Salazar: Toroidal grid minors and stretch in embedded graphs. J. Comb. Theory, Ser. B 140: 323-371 (2020)
View ArticleClik here to view.
Isomorphism Testing for T-graphs in FPT.
Deniz Agaoglu, Petr Hlinený: Isomorphism Testing for T-graphs in FPT. CoRR abs/2111.10910 (2021)
View ArticleClik here to view.
Twin-Width is Linear in the Poset Width.
Jakub Balabán, Petr Hlinený: Twin-Width is Linear in the Poset Width. CoRR abs/2106.15337 (2021)
View ArticleClik here to view.
Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges.
Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl: Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges. CoRR abs/2103.15214 (2021)
View ArticleClik here to view.
Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases.
Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl: Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. MFCS 2021: 21:1-21:15
View ArticleClik here to view.
Twin-Width Is Linear in the Poset Width.
Jakub Balabán, Petr Hlinený: Twin-Width Is Linear in the Poset Width. IPEC 2021: 6:1-6:13
View ArticleClik here to view.
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: Beyond circular-arc graphs - recognizing lollipop graphs and medusa...
View ArticleClik here to view.
Twin-width of Planar Graphs is at most 8.
Petr Hlinený, Jan Jedelský: Twin-width of Planar Graphs is at most 8. CoRR abs/2210.08620 (2022)
View ArticleClik here to view.
Twin-width and Limits of Tractability of FO Model Checking on Geometric Graphs.
Petr Hlinený, Filip Pokrývka: Twin-width and Limits of Tractability of FO Model Checking on Geometric Graphs. CoRR abs/2204.13742 (2022)
View ArticleClik here to view.
Graph Product Structure for h-Framed Graphs.
Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann: Graph Product Structure for h-Framed Graphs. CoRR abs/2204.11495 (2022)
View ArticleClik here to view.
Parameterised Partially-Predrawn Crossing Number.
Thekla Hamm, Petr Hlinený: Parameterised Partially-Predrawn Crossing Number. CoRR abs/2202.13635 (2022)
View ArticleClik here to view.
Automorphism Group of Marked Interval Graphs in FPT.
Deniz Agaoglu, Petr Hlinený: Automorphism Group of Marked Interval Graphs in FPT. CoRR abs/2202.12664 (2022)
View ArticleClik here to view.
Twin-width and Transductions of Proper k-Mixed-Thin Graphs.
Jakub Balabán, Petr Hlinený, Jan Jedelský: Twin-width and Transductions of Proper k-Mixed-Thin Graphs. CoRR abs/2202.12536 (2022)
View ArticleClik here to view.
Twin-Width and Transductions of Proper k-Mixed-Thin Graphs.
Jakub Balabán, Petr Hlinený, Jan Jedelský: Twin-Width and Transductions of Proper k-Mixed-Thin Graphs. WG 2022: 43-55
View ArticleClik here to view.
Isomorphism Testing for T-graphs in FPT.
Deniz Agaoglu Çagirici, Petr Hlinený: Isomorphism Testing for T-graphs in FPT. WALCOM 2022: 239-250
View ArticleClik here to view.
Graph Product Structure for h-Framed Graphs.
Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann: Graph Product Structure for h-Framed Graphs. ISAAC 2022: 23:1-23:15
View ArticleClik here to view.
Parameterised Partially-Predrawn Crossing Number.
Thekla Hamm, Petr Hlinený: Parameterised Partially-Predrawn Crossing Number. SoCG 2022: 46:1-46:15
View ArticleClik here to view.
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with...
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): 701-728 (2022)
View ArticleClik here to view.
Sparse Graphs of Twin-width 2 Have Bounded Tree-width.
Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski: Sparse Graphs of Twin-width 2 Have Bounded Tree-width. CoRR abs/2307.01732 (2023)
View ArticleClik here to view.
Minimizing an Uncrossed Collection of Drawings.
Petr Hlinený, Tomás Masarík: Minimizing an Uncrossed Collection of Drawings. CoRR abs/2306.09550 (2023)
View ArticleClik here to view.
Complexity of Anchored Crossing Number and Crossing Number of Almost Planar...
Petr Hlinený: Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs. CoRR abs/2306.03490 (2023)
View ArticleClik here to view.
Stack and Queue Numbers of Graphs Revisited.
Petr Hlinený, Adam Straka: Stack and Queue Numbers of Graphs Revisited. CoRR abs/2303.10116 (2023)
View ArticleClik here to view.
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: Recognizing H-Graphs - Beyond Circular-Arc Graphs. MFCS 2023: 8:1-8:14
View ArticleClik here to view.
Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width.
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: 11:1-11:13
View ArticleClik here to view.
Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar.
Petr Hlinený, Jan Jedelský: Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar. ICALP 2023: 75:1-75:18
View ArticleClik here to view.
Minimizing an Uncrossed Collection of Drawings.
Petr Hlinený, Tomás Masarík: Minimizing an Uncrossed Collection of Drawings. GD (1) 2023: 110-123
View ArticleClik here to view.
Inserting Multiple Edges into a Planar Graph.
Markus Chimani, Petr Hlinený: Inserting Multiple Edges into a Planar Graph. J. Graph Algorithms Appl. 27(6): 489-522 (2023)
View ArticleClik here to view.
Clique-width of point configurations.
Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran: Clique-width of point configurations. J. Comb. Theory, Ser. B 158(Part): 43-73 (2023)
View ArticleClik here to view.
Efficient Isomorphism for Sd-Graphs and T-Graphs.
Deniz Agaoglu Çagirici, Petr Hlinený: Efficient Isomorphism for Sd-Graphs and T-Graphs. Algorithmica 85(2): 352-383 (2023)
View ArticleClik here to view.
Note on Min-k-Planar Drawings of Graphs.
Petr Hlinený: Note on Min-k-Planar Drawings of Graphs. CoRR abs/2401.11610 (2024)
View ArticleClik here to view.
On colourability of polygon visibility graphs.
Onur Çagirici, Petr Hlinený, Bodhayan Roy: On colourability of polygon visibility graphs. Eur. J. Comb. 117: 103820 (2024)
View Article