Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetr Hlinený
Person information
- affiliation: Masaryk University, Brno, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j63]Deniz Agaoglu Çagirici, Petr Hlinený
:
Efficient Isomorphism for Sd-Graphs and T-Graphs. Algorithmica 85(2): 352-383 (2023)- [j62]Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran:
Clique-width of point configurations. J. Comb. Theory, Ser. B 158(Part): 43-73 (2023) - [i39]Petr Hlinený, Adam Straka:
Stack and Queue Numbers of Graphs Revisited. CoRR abs/2303.10116 (2023) - 2022
- [j61]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) - [c55]Thekla Hamm, Petr Hlinený:
Parameterised Partially-Predrawn Crossing Number. SoCG 2022: 46:1-46:15 - [c54]Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann:
Graph Product Structure for h-Framed Graphs. ISAAC 2022: 23:1-23:15 - [c53]Deniz Agaoglu Çagirici, Petr Hlinený:
Isomorphism Testing for T-graphs in FPT. WALCOM 2022: 239-250 - [c52]Jakub Balabán, Petr Hlinený, Jan Jedelský:
Twin-Width and Transductions of Proper k-Mixed-Thin Graphs. WG 2022: 43-55 - [i38]Jakub Balabán, Petr Hlinený, Jan Jedelský:
Twin-width and Transductions of Proper k-Mixed-Thin Graphs. CoRR abs/2202.12536 (2022) - [i37]Deniz Agaoglu, Petr Hlinený:
Automorphism Group of Marked Interval Graphs in FPT. CoRR abs/2202.12664 (2022) - [i36]Thekla Hamm, Petr Hlinený:
Parameterised Partially-Predrawn Crossing Number. CoRR abs/2202.13635 (2022) - [i35]Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann:
Graph Product Structure for h-Framed Graphs. CoRR abs/2204.11495 (2022) - [i34]Petr Hlinený, Filip Pokrývka:
Twin-width and Limits of Tractability of FO Model Checking on Geometric Graphs. CoRR abs/2204.13742 (2022) - [i33]Petr Hlinený, Jan Jedelský:
Twin-width of Planar Graphs is at most 8. CoRR abs/2210.08620 (2022) - [i32]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 abs/2212.05433 (2022) - 2021
- [c51]Jakub Balabán, Petr Hlinený:
Twin-Width Is Linear in the Poset Width. IPEC 2021: 6:1-6:13 - [c50]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 - [i31]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) - [i30]Jakub Balabán, Petr Hlinený:
Twin-Width is Linear in the Poset Width. CoRR abs/2106.15337 (2021) - [i29]Deniz Agaoglu, Petr Hlinený:
Isomorphism Testing for T-graphs in FPT. CoRR abs/2111.10910 (2021) - 2020
- [j60]Markus Chimani, Petr Hlinený, Gelasio Salazar:
Toroidal grid minors and stretch in embedded graphs. J. Comb. Theory, Ser. B 140: 323-371 (2020) - [j59]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) - [c49]Deniz Agaoglu, Petr Hlinený:
Isomorphism Problem for S_d-Graphs. MFCS 2020: 4:1-4:14 - [c48]Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran:
Clique-Width of Point Configurations. WG 2020: 54-66 - [i28]Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran:
Clique-Width of Point Configurations. CoRR abs/2004.02282 (2020)
2010 – 2019
- 2019
- [j58]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) - [j57]Petr Hlinený, Filip Pokrývka, Bodhayan Roy:
FO model checking on geometric graphs. Comput. Geom. 78: 1-19 (2019) - [j56]Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn:
Parameterized shifted combinatorial optimization. J. Comput. Syst. Sci. 99: 53-71 (2019) - [j55]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) - [c47]Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy:
On Conflict-Free Chromatic Guarding of Simple Polygons. COCOA 2019: 601-612 - [c46]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 - [c45]Petr Hlinený, Abhisekh Sankaran:
Exact Crossing Number Parameterized by Vertex Cover. GD 2019: 307-319 - [i27]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) - [i26]Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy:
On conflict-free chromatic guarding of simple polygons. CoRR abs/1904.08624 (2019) - [i25]Onur Çagirici, Petr Hlinený, Bodhayan Roy:
On Colourability of Polygon Visibility Graphs. CoRR abs/1906.01904 (2019) - [i24]Petr Hlinený, Abhisekh Sankaran:
Exact Crossing Number Parameterized by Vertex Cover. CoRR abs/1906.06048 (2019) - 2018
- [j54]Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary:
Parameterized extension complexity of independent set and related problems. Discret. Appl. Math. 248: 56-67 (2018) - [j53]Petr Hlinený:
A Simpler Self-reduction Algorithm for Matroid Path-Width. SIAM J. Discret. Math. 32(2): 1425-1440 (2018) - [j52]Petr Hlinený, Carsten Thomassen:
Deciding Parity of Graph Crossing Number. SIAM J. Discret. Math. 32(3): 1962-1965 (2018) - [c44]Zdenek Dvorák, Petr Hlinený, Bojan Mohar:
Structure and Generation of Crossing-Critical Graphs. SoCG 2018: 33:1-33:14 - [i23]Zdenek Dvorák, Petr Hlinený, Bojan Mohar:
Structure and generation of crossing-critical graphs. CoRR abs/1803.01931 (2018) - [i22]Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, M. S. Ramanujan:
A New Perspective on FO Model Checking of Dense Graph Classes. CoRR abs/1805.01823 (2018) - 2017
- [j51]Markus Chimani, Petr Hlinený:
A tighter insertion-based approximation of the crossing number. J. Comb. Optim. 33(4): 1183-1225 (2017) - [j50]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: 219-242 (2017) - [j49]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): 612-635 (2017) - [c43]Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn:
Parameterized Shifted Combinatorial Optimization. COCOON 2017: 224-236 - [c42]Onur Cagirici, Petr Hlinený, Bodhayan Roy:
On Colourability of Polygon Visibility Graphs. FSTTCS 2017: 21:1-21:14 - [c41]Petr Hlinený, Filip Pokrývka, Bodhayan Roy:
FO Model Checking of Geometric Graphs. IPEC 2017: 19:1-19:12 - [i21]Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn:
Parameterized Shifted Combinatorial Optimization. CoRR abs/1702.06844 (2017) - [i20]Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez:
Shrub-depth: Capturing Height of Dense Graphs. CoRR abs/1707.00359 (2017) - [i19]Petr Hlinený, Filip Pokrývka, Bodhayan Roy:
FO model checking of geometric graphs. CoRR abs/1709.03701 (2017) - 2016
- [j48]Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak:
Tree-depth and vertex-minors. Eur. J. Comb. 56: 46-56 (2016) - [j47]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: 250-286 (2016) - [c40]Markus Chimani, Petr Hlinený:
Inserting Multiple Edges into a Planar Graph. SoCG 2016: 30:1-30:15 - [c39]Petr Hlinený, Marek Dernár:
Crossing Number is Hard for Kernelization. SoCG 2016: 42:1-42:10 - [c38]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: 176-184 - [i18]Petr Hlinený:
Simpler Self-reduction Algorithm for Matroid Path-width. CoRR abs/1605.09520 (2016) - 2015
- [j46]Jakub Gajarský, Petr Hlinený:
Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences. Log. Methods Comput. Sci. 11(1) (2015) - [j45]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak:
Faster Existential FO Model Checking on Posets. Log. Methods Comput. Sci. 11(4) (2015) - [j44]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) - [j43]Martin Derka, Petr Hlinený:
Planar emulators conjecture is nearly true for cubic graphs. Eur. J. Comb. 48: 63-70 (2015) - [c37]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: 963-974 - [c36]Drago Bokal, Mojca Bracic, Marek Dernár, Petr Hlinený:
On Degree Properties of Crossing-Critical Families of Graphs. GD 2015: 75-86 - [c35]Petr Hlinený, Gelasio Salazar:
On Hardness of the Joint Crossing Number. ISAAC 2015: 603-613 - [c34]Petr Hlinený, Ondrej Slámecka:
Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs. MEMICS 2015: 54-66 - [i17]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 abs/1504.04115 (2015) - [i16]Tomás Brázdil, Petr Hlinený, Antonín Kucera, Vojtech Rehák, Matús Abaffy:
Strategy Synthesis in Adversarial Patrolling Games. CoRR abs/1507.03407 (2015) - [i15]Petr Hlinený, Gelasio Salazar:
On Hardness of the Joint Crossing Number. CoRR abs/1509.01787 (2015) - [i14]Markus Chimani, Petr Hlinený:
Inserting Multiple Edges into a Planar Graph. CoRR abs/1509.07952 (2015) - [i13]Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary:
Parameterized Extension Complexity of Independent Set and Related Problems. CoRR abs/1511.08841 (2015) - [i12]Petr Hlinený, Marek Dernár:
Crossing Number is Hard for Kernelization. CoRR abs/1512.02379 (2015) - 2014
- [j42]Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith:
Digraph width measures in parameterized algorithmics. Discret. Appl. Math. 168: 88-107 (2014) - [j41]Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Lower bounds on the complexity of MSO1 model-checking. J. Comput. Syst. Sci. 80(1): 180-194 (2014) - [j40]Sergio Cabello, Markus Chimani, Petr Hlinený:
Computing the Stretch of an Embedded Graph. SIAM J. Discret. Math. 28(3): 1391-1401 (2014) - [c33]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak:
Faster Existential FO Model Checking on Posets. ISAAC 2014: 441-451 - [e3]Petr Hlinený, Zdenek Dvorák, Jirí Jaros, Jan Kofron, Jan Korenek, Petr Matula, Karel Pala:
Mathematical and Engineering Methods in Computer Science - 9th International Doctoral Workshop, MEMICS 2014, Telč, Czech Republic, October 17-19, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8934, Springer 2014, ISBN 978-3-319-14895-3 [contents] - [i11]Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak:
Tree-depth and Vertex-minors. CoRR abs/1403.7024 (2014) - 2013
- [j39]Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek:
How not to characterize planar-emulable graphs. Adv. Appl. Math. 50(1): 46-68 (2013) - [j38]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): 680-701 (2013) - [j37]Robert Ganian, Petr Hlinený, Jan Obdrzálek:
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. Fundam. Informaticae 123(1): 59-76 (2013) - [c32]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: 529-540 - [c31]Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska:
FO Model Checking of Interval Graphs. ICALP (2) 2013: 250-262 - [i10]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 abs/1302.6863 (2013) - 2012
- [j36]Petr Hlinený, Ondrej Moris:
Generalized Maneuvers in Route Planning for Computing and Informatics. Comput. Informatics 31(3): 531- (2012) - [j35]Markus Chimani, Petr Hlinený, Petra Mutzel:
Vertex insertion approximates the crossing number of apex graphs. Eur. J. Comb. 33(3): 326-335 (2012) - [j34]Petr Hlinený, Antonín Kucera:
Preface. Theor. Comput. Sci. 417: 1 (2012) - [c30]Jakub Gajarský, Petr Hlinený:
Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. FSTTCS 2012: 112-123 - [c29]Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai:
When Trees Grow Low: Shrubs and Fast MSO1. MFCS 2012: 419-430 - [c28]Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Lower Bounds on the Complexity of MSO_1 Model-Checking. STACS 2012: 326-337 - [i9]Petr Hlinený, Ondrej Moris:
Dynamic Scope-Based Dijkstra's Algorithm. CoRR abs/1201.2000 (2012) - [i8]Petr Hlinený, Ondrej Moris:
Detours in Scope-Based Route Planning. CoRR abs/1205.4363 (2012) - 2011
- [j33]Eva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl:
Parameterized Problems Related to Seidel's Switching. Discret. Math. Theor. Comput. Sci. 13(2): 19-44 (2011) - [c27]Petr Hlinený, Ondrej Moris:
Scope-Based Route Planning. ESA 2011: 445-456 - [c26]Markus Chimani, Petr Hlinený:
A Tighter Insertion-Based Approximation of the Crossing Number. ICALP (1) 2011: 122-134 - [c25]Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek:
How Not to Characterize Planar-Emulable Graphs. IWOCA 2011: 106-120 - [c24]Petr Hlinený, Ondrej Moris:
Generalized Maneuvers in Route Planning. MEMICS 2011: 155-166 - [c23]Robert Ganian, Petr Hlinený, Jan Obdrzálek:
Clique-width: When Hard Does Not Mean Impossible. STACS 2011: 404-415 - [i7]Petr Hlinený, Ondrej Moris:
Multi-Stage Improved Route Planning Approach: theoretical foundations. CoRR abs/1101.3182 (2011) - [i6]Markus Chimani, Petr Hlinený:
A Tighter Insertion-based Approximation of the Crossing Number. CoRR abs/1104.5039 (2011) - [i5]Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek:
How Not to Characterize Planar-emulable Graphs. CoRR abs/1107.0176 (2011) - [i4]Petr Hlinený, Ondrej Moris:
Generalized Maneuvers in Route Planning. CoRR abs/1107.0798 (2011) - [i3]Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Lower Bounds on the Complexity of MSO1 Model-Checking. CoRR abs/1109.5804 (2011) - 2010
- [j32]Robert Ganian, Petr Hlinený:
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Discret. Appl. Math. 158(7): 851-867 (2010) - [j31]Petr Hlinený:
20 Years of Negami's Planar Cover Conjecture. Graphs Comb. 26(4): 525-536 (2010) - [j30]Petr Hlinený, Gelasio Salazar:
Stars and bonds in crossing-critical graphs. J. Graph Theory 65(3): 198-215 (2010) - [c22]Robert Ganian, Petr Hlinený, Jan Obdrzálek:
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. FSTTCS 2010: 73-83 - [c21]Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Are There Any Good Digraph Width Measures? IPEC 2010: 135-146 - [c20]Petr Hlinený, Markus Chimani:
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. SODA 2010: 918-927 - [c19]Robert Ganian, Petr Hlinený:
New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. SOFSEM 2010: 428-439 - [e2]Petr Hlinený, Antonín Kucera:
Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings. Lecture Notes in Computer Science 6281, Springer 2010, ISBN 978-3-642-15154-5 [contents] - [i2]Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Are there any good digraph width measures? CoRR abs/1004.1485 (2010) - [i1]Robert Ganian, Petr Hlinený, Jan Obdrzálek:
Better algorithms for satisfiability problems for formulas of bounded rank-width. CoRR abs/1006.5621 (2010)
2000 – 2009
- 2009
- [j29]Petr Hlinený, Geoff Whittle:
Addendum to matroid tree-width. Eur. J. Comb. 30(4): 1036-1044 (2009) - [c18]Robert Ganian, Petr Hlinený:
Better Polynomial Algorithms on Graphs of Bounded Rank-Width. IWOCA 2009: 266-277 - [c17]Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith:
On Digraph Width Measures in Parameterized Algorithmics. IWPEC 2009: 185-197 - [c16]Petr Hlinený, Václav Matyás, Tomás Vojnar:
Preface -- Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). MEMICS 2009 - [e1]Petr Hlinený, Václav Matyás, Tomás Vojnar:
Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2009, November 13-15, 2009, Prestige Hotel, Znojmo, Czech Republic. OASIcs 13, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2009 [contents] - 2008
- [j28]Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob:
Width Parameters Beyond Tree-width and their Applications. Comput. J. 51(3): 326-362 (2008) - [j27]Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar:
The Crossing Number of a Projective Graph is Quadratic in the Face-Width. Electron. J. Comb. 15(1) (2008) - [j26]Petr Hlinený:
New Infinite Families of Almost-Planar Crossing-Critical Graphs. Electron. J. Comb. 15(1) (2008) - [j25]