Petr Hlinený - RankMe

191 papers A* 10A 16B 26C 4Misc 1Journal 121Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Computational complexity of covering multigraphs with semi-edges: Small cases. J. Comput. Syst. Sci. Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl
2026	B	`conf`	k-Planar and Fan-Crossing Drawings and Transductions of Planar Graphs. SOFSEM Petr Hlinený, Jan Jedelský
2025	A	`conf`	A Unified FPT Framework for Crossing Number Problems. ESA Éric Colin de Verdière, Petr Hlinený
2025	B	`conf`	Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs. MFCS Petr Hlinený
2025	J	`jnl`	On 13-crossing-critical graphs with arbitrarily large degrees. Discret. Math. Petr Hlinený, Michal Korbela
2025	J	`jnl`	Stack and queue numbers of graphs revisited. Eur. J. Comb. Petr Hlinený, Adam Straka
2025	A*	`conf`	Transductions of Graph Classes Admitting Product Structure. LICS Petr Hlinený, Jan Jedelský
2025	J	`jnl`	Transductions of Graph Classes Admitting Product Structure. CoRR Petr Hlinený, Jan Jedelský
2025	J	`jnl`	Twin-Width of Planar Graphs Is at Most 8, and Some Related Bounds. SIAM J. Discret. Math. Petr Hlinený, Jan Jedelský
2025	J	`jnl`	Twin-width of planar graphs; a short proof. Eur. J. Comb. Petr Hlinený
2025	J	`jnl`	k-Planar and Fan-Crossing Drawings and Transductions of Planar Graphs. CoRR Petr Hlinený, Jan Jedelský
2024	B	`conf`	Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width). ISAAC Petr Hlinený, Liana Khazaliya
2024	J	`jnl`	Crossing Number is NP-hard for Constant Path-width (and Tree-width). CoRR Petr Hlinený, Liana Khazaliya
2024	J	`jnl`	FPT Algorithms for Crossing Number Problems: A Unified Approach. CoRR Éric Colin de Verdière, Petr Hlinený
2024	J	`jnl`	Graph Product Structure for $h$-Framed Graphs. Electron. J. Comb. Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann
2024	J	`jnl`	H-Clique-Width and a Hereditary Analogue of Product Structure. CoRR Petr Hlinený, Jan Jedelský
2024	A	`conf`	Note on Min- k-Planar Drawings of Graphs. GD Petr Hlinený, Csenge Lili Ködmön
2024	J	`jnl`	Note on Min-k-Planar Drawings of Graphs. CoRR Petr Hlinený
2024	J	`jnl`	On colourability of polygon visibility graphs. Eur. J. Comb. Onur Çagirici, Petr Hlinený, Bodhayan Roy
2024	A	`conf`	On the Uncrossed Number of Graphs. GD Martin Balko, Petr Hlinený, Tomás Masarík, Joachim Orthaber, Birgit Vogtenhuber, Mirko H. Wagner
2024	J	`jnl`	On the Uncrossed Number of Graphs. CoRR Martin Balko, Petr Hlinený, Tomás Masarík, Joachim Orthaber, Birgit Vogtenhuber, Mirko H. Wagner
2024	J	`jnl`	Twin-width and transductions of proper k-mixed-thin graphs. Discret. Math. Jakub Balabán, Petr Hlinený, Jan Jedelský
2024	B	`conf`	ℋ-Clique-Width and a Hereditary Analogue of Product Structure. MFCS Petr Hlinený, Jan Jedelský
2023	J	`jnl`	Clique-width of point configurations. J. Comb. Theory B Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran
2023	J	`jnl`	Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs. CoRR Petr Hlinený
2023	J	`jnl`	Efficient Isomorphism for S Algorithmica Deniz Agaoglu Çagirici, Petr Hlinený
2023	J	`jnl`	Inserting Multiple Edges into a Planar Graph. J. Graph Algorithms Appl. Markus Chimani, Petr Hlinený
2023	—	`conf`	Minimizing an Uncrossed Collection of Drawings. GD (1) Petr Hlinený, Tomás Masarík
2023	J	`jnl`	Minimizing an Uncrossed Collection of Drawings. CoRR Petr Hlinený, Tomás Masarík
2023	B	`conf`	Recognizing H-Graphs - Beyond Circular-Arc Graphs. MFCS Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman
2023	B	`conf`	Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. ISAAC Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski
2023	J	`jnl`	Sparse Graphs of Twin-width 2 Have Bounded Tree-width. CoRR Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski
2023	J	`jnl`	Stack and Queue Numbers of Graphs Revisited. CoRR Petr Hlinený, Adam Straka
2023	A*	`conf`	Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar. ICALP Petr Hlinený, Jan Jedelský
2022	J	`jnl`	Automorphism Group of Marked Interval Graphs in FPT. CoRR Deniz Agaoglu, Petr Hlinený
2022	J	`jnl`	Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs. CoRR Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman
2022	J	`jnl`	Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12. Comb. Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
2022	B	`conf`	Graph Product Structure for h-Framed Graphs. ISAAC Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann
2022	J	`jnl`	Graph Product Structure for h-Framed Graphs. CoRR Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann
2022	B	`conf`	Isomorphism Testing for T-graphs in FPT. WALCOM Deniz Agaoglu Çagirici, Petr Hlinený
2022	A*	`conf`	Parameterised Partially-Predrawn Crossing Number. SoCG Thekla Hamm, Petr Hlinený
2022	J	`jnl`	Parameterised Partially-Predrawn Crossing Number. CoRR Thekla Hamm, Petr Hlinený
2022	B	`conf`	Twin-Width and Transductions of Proper k-Mixed-Thin Graphs. WG Jakub Balabán, Petr Hlinený, Jan Jedelský
2022	J	`jnl`	Twin-width and Limits of Tractability of FO Model Checking on Geometric Graphs. CoRR Petr Hlinený, Filip Pokrývka
2022	J	`jnl`	Twin-width and Transductions of Proper k-Mixed-Thin Graphs. CoRR Jakub Balabán, Petr Hlinený, Jan Jedelský
2022	J	`jnl`	Twin-width of Planar Graphs is at most 8. CoRR Petr Hlinený, Jan Jedelský
2021	B	`conf`	Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. MFCS Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl
2021	J	`jnl`	Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges. CoRR Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl
2021	J	`jnl`	Isomorphism Testing for T-graphs in FPT. CoRR Deniz Agaoglu, Petr Hlinený
2021	B	`conf`	Twin-Width Is Linear in the Poset Width. IPEC Jakub Balabán, Petr Hlinený
2021	J	`jnl`	Twin-Width is Linear in the Poset Width. CoRR Jakub Balabán, Petr Hlinený
2020	J	`jnl`	A New Perspective on FO Model Checking of Dense Graph Classes. ACM Trans. Comput. Log. Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
2020	B	`conf`	Clique-Width of Point Configurations. WG Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran
2020	J	`jnl`	Clique-Width of Point Configurations. CoRR Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran
2020	B	`conf`	Isomorphism Problem for S_d-Graphs. MFCS Deniz Agaoglu, Petr Hlinený
2020	J	`jnl`	Toroidal grid minors and stretch in embedded graphs. J. Comb. Theory, Ser. B Markus Chimani, Petr Hlinený, Gelasio Salazar
2019	A*	`conf`	Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. SoCG Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
2019	J	`jnl`	Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12. CoRR Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
2019	A	`conf`	Exact Crossing Number Parameterized by Vertex Cover. GD Petr Hlinený, Abhisekh Sankaran
2019	J	`jnl`	Exact Crossing Number Parameterized by Vertex Cover. CoRR Petr Hlinený, Abhisekh Sankaran
2019	J	`jnl`	FO model checking on geometric graphs. Comput. Geom. Petr Hlinený, Filip Pokrývka, Bodhayan Roy
2019	J	`jnl`	On Colourability of Polygon Visibility Graphs. CoRR Onur Çagirici, Petr Hlinený, Bodhayan Roy
2019	C	`conf`	On Conflict-Free Chromatic Guarding of Simple Polygons. COCOA Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy
2019	J	`jnl`	On Degree Properties of Crossing-Critical Families of Graphs. Electron. J. Comb. Drago Bokal, Mojca Bracic, Marek Dernár, Petr Hlinený
2019	J	`jnl`	On conflict-free chromatic guarding of simple polygons. CoRR Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy
2019	J	`jnl`	Parameterized shifted combinatorial optimization. J. Comput. Syst. Sci. Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
2019	J	`jnl`	Shrub-depth: Capturing Height of Dense Graphs. Log. Methods Comput. Sci. Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez
2018	J	`jnl`	A New Perspective on FO Model Checking of Dense Graph Classes. CoRR Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, M. S. Ramanujan
2018	J	`jnl`	A Simpler Self-reduction Algorithm for Matroid Path-Width. SIAM J. Discret. Math. Petr Hlinený
2018	J	`jnl`	Deciding Parity of Graph Crossing Number. SIAM J. Discret. Math. Petr Hlinený, Carsten Thomassen
2018	J	`jnl`	Parameterized extension complexity of independent set and related problems. Discret. Appl. Math. Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary
2018	A*	`conf`	Structure and Generation of Crossing-Critical Graphs. SoCG Zdenek Dvorák, Petr Hlinený, Bojan Mohar
2018	J	`jnl`	Structure and generation of crossing-critical graphs. CoRR Zdenek Dvorák, Petr Hlinený, Bojan Mohar
2017	J	`jnl`	A tighter insertion-based approximation of the crossing number. J. Comb. Optim. Markus Chimani, Petr Hlinený
2017	B	`conf`	FO Model Checking of Geometric Graphs. IPEC Petr Hlinený, Filip Pokrývka, Bodhayan Roy
2017	J	`jnl`	FO model checking of geometric graphs. CoRR Petr Hlinený, Filip Pokrývka, Bodhayan Roy
2017	J	`jnl`	First order limits of sparse graphs: Plane trees and path-width. Random Struct. Algorithms Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma
2017	J	`jnl`	Kernelization using structural parameters on sparse graph classes. J. Comput. Syst. Sci. Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2017	—	`conf`	On Colourability of Polygon Visibility Graphs. FSTTCS Onur Cagirici, Petr Hlinený, Bodhayan Roy
2017	Misc	`conf`	Parameterized Shifted Combinatorial Optimization. COCOON Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
2017	J	`jnl`	Parameterized Shifted Combinatorial Optimization. CoRR Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
2017	J	`jnl`	Shrub-depth: Capturing Height of Dense Graphs. CoRR Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez
2016	A*	`conf`	A New Perspective on FO Model Checking of Dense Graph Classes. LICS Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
2016	J	`jnl`	Are there any good digraph width measures? J. Comb. Theory B Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2016	A*	`conf`	Crossing Number is Hard for Kernelization. SoCG Petr Hlinený, Marek Dernár
2016	A*	`conf`	Inserting Multiple Edges into a Planar Graph. SoCG Markus Chimani, Petr Hlinený
2016	J	`jnl`	Simpler Self-reduction Algorithm for Matroid Path-width. CoRR Petr Hlinený
2016	J	`jnl`	Tree-depth and vertex-minors. Eur. J. Comb. Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
2015	J	`jnl`	Crossing Number is Hard for Kernelization. CoRR Petr Hlinený, Marek Dernár
2015	J	`jnl`	FO Model Checking of Interval Graphs Log. Methods Comput. Sci. Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska
2015	A*	`conf`	FO Model Checking on Posets of Bounded Width. FOCS Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	FO Model Checking on Posets of Bounded Width. CoRR Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	Faster Existential FO Model Checking on Posets. Log. Methods Comput. Sci. Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak
2015	J	`jnl`	Inserting Multiple Edges into a Planar Graph. CoRR Markus Chimani, Petr Hlinený
2015	J	`jnl`	Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences. Log. Methods Comput. Sci. Jakub Gajarský, Petr Hlinený
2015	A	`conf`	On Degree Properties of Crossing-Critical Families of Graphs. GD Drago Bokal, Mojca Bracic, Marek Dernár, Petr Hlinený
2015	B	`conf`	On Hardness of the Joint Crossing Number. ISAAC Petr Hlinený, Gelasio Salazar
2015	J	`jnl`	On Hardness of the Joint Crossing Number. CoRR Petr Hlinený, Gelasio Salazar
2015	J	`jnl`	Parameterized Extension Complexity of Independent Set and Related Problems. CoRR Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary
2015	J	`jnl`	Planar emulators conjecture is nearly true for cubic graphs. Eur. J. Comb. Martin Derka, Petr Hlinený
2015	—	`conf`	Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs. MEMICS Petr Hlinený, Ondrej Slámecka
2015	J	`jnl`	Strategy Synthesis in Adversarial Patrolling Games. CoRR Tomás Brázdil, Petr Hlinený, Antonín Kucera, Vojtech Rehák, Matús Abaffy
2014	J	`jnl`	Computing the Stretch of an Embedded Graph. SIAM J. Discret. Math. Sergio Cabello, Markus Chimani, Petr Hlinený
2014	J	`jnl`	Digraph width measures in parameterized algorithmics. Discret. Appl. Math. Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
2014	B	`conf`	Faster Existential FO Model Checking on Posets. ISAAC Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak
2014	J	`jnl`	Lower bounds on the complexity of MSO J. Comput. Syst. Sci. Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2014	—	`ed.`	Mathematical and Engineering Methods in Computer Science - 9th International Doctoral Workshop, MEMICS 2014, Telč, Czech Republic, October 17-19, 2014, Revised Selected Papers MEMICS Petr Hlinený, Zdenek Dvorák, Jirí Jaros, Jan Kofron, Jan Korenek, Petr Matula, Karel Pala
2014	J	`jnl`	Tree-depth and Vertex-minors. CoRR Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
2013	J	`jnl`	A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. Eur. J. Comb. Robert Ganian, Petr Hlinený, Jan Obdrzálek
2013	J	`jnl`	Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. Fundam. Informaticae Robert Ganian, Petr Hlinený, Jan Obdrzálek
2013	—	`conf`	FO Model Checking of Interval Graphs. ICALP (2) Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska
2013	J	`jnl`	How not to characterize planar-emulable graphs. Adv. Appl. Math. Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek
2013	J	`jnl`	Kernelization Using Structural Parameters on Sparse Graph Classes CoRR Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2013	A	`conf`	Kernelization Using Structural Parameters on Sparse Graph Classes. ESA Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2012	J	`jnl`	Detours in Scope-Based Route Planning CoRR Petr Hlinený, Ondrej Moris
2012	J	`jnl`	Dynamic Scope-Based Dijkstra's Algorithm CoRR Petr Hlinený, Ondrej Moris
2012	—	`conf`	Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. FSTTCS Jakub Gajarský, Petr Hlinený
2012	J	`jnl`	Generalized Maneuvers in Route Planning for Computing and Informatics. Comput. Informatics Petr Hlinený, Ondrej Moris
2012	A	`conf`	Lower Bounds on the Complexity of MSO_1 Model-Checking. STACS Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2012	J	`jnl`	Preface. Theor. Comput. Sci. Petr Hlinený, Antonín Kucera
2012	J	`jnl`	Vertex insertion approximates the crossing number of apex graphs. Eur. J. Comb. Markus Chimani, Petr Hlinený, Petra Mutzel
2012	B	`conf`	When Trees Grow Low: Shrubs and Fast MSO1. MFCS Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai
2011	—	`conf`	A Tighter Insertion-Based Approximation of the Crossing Number. ICALP (1) Markus Chimani, Petr Hlinený
2011	J	`jnl`	A Tighter Insertion-based Approximation of the Crossing Number CoRR Markus Chimani, Petr Hlinený
2011	A	`conf`	Clique-width: When Hard Does Not Mean Impossible. STACS Robert Ganian, Petr Hlinený, Jan Obdrzálek
2011	J	`jnl`	Generalized Maneuvers in Route Planning CoRR Petr Hlinený, Ondrej Moris
2011	—	`conf`	Generalized Maneuvers in Route Planning. MEMICS Petr Hlinený, Ondrej Moris
2011	C	`conf`	How Not to Characterize Planar-Emulable Graphs. IWOCA Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek
2011	J	`jnl`	How Not to Characterize Planar-emulable Graphs CoRR Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek
2011	J	`jnl`	Lower Bounds on the Complexity of MSO1 Model-Checking CoRR Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2011	J	`jnl`	Multi-Stage Improved Route Planning Approach: theoretical foundations CoRR Petr Hlinený, Ondrej Moris
2011	J	`jnl`	Parameterized Problems Related to Seidel's Switching. Discret. Math. Theor. Comput. Sci. Eva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl
2011	A	`conf`	Scope-Based Route Planning. ESA Petr Hlinený, Ondrej Moris
2010	J	`jnl`	20 Years of Negami's Planar Cover Conjecture. Graphs Comb. Petr Hlinený
2010	A*	`conf`	Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. SODA Petr Hlinený, Markus Chimani
2010	B	`conf`	Are There Any Good Digraph Width Measures? IPEC Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2010	J	`jnl`	Are there any good digraph width measures? CoRR Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2010	—	`conf`	Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. FSTTCS Robert Ganian, Petr Hlinený, Jan Obdrzálek
2010	J	`jnl`	Better algorithms for satisfiability problems for formulas of bounded rank-width CoRR Robert Ganian, Petr Hlinený, Jan Obdrzálek
2010	B	`ed.`	Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings MFCS Petr Hlinený, Antonín Kucera
2010	B	`conf`	New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. SOFSEM Robert Ganian, Petr Hlinený
2010	J	`jnl`	On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Discret. Appl. Math. Robert Ganian, Petr Hlinený
2010	J	`jnl`	Stars and bonds in crossing-critical graphs. J. Graph Theory Petr Hlinený, Gelasio Salazar
2009	J	`jnl`	Addendum to matroid tree-width. Eur. J. Comb. Petr Hlinený, Geoff Whittle
2009	—	`ed.`	Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2009, Prestige Hotel, Znojmo, Czech Republic, November 13-15, 2009 MEMICS Petr Hlinený, Václav Matyás, Tomás Vojnar
2009	C	`conf`	Better Polynomial Algorithms on Graphs of Bounded Rank-Width. IWOCA Robert Ganian, Petr Hlinený
2009	—	`conf`	On Digraph Width Measures in Parameterized Algorithmics. IWPEC Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
2009	—	`conf`	Preface -- Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). MEMICS Petr Hlinený, Václav Matyás, Tomás Vojnar
2008	A	`conf`	Approximating the Crossing Number of Apex Graphs. GD Markus Chimani, Petr Hlinený, Petra Mutzel
2008	C	`conf`	Automata approach to graphs of bounded rank-width. IWOCA Petr Hlinený, Robert Ganian
2008	J	`jnl`	Finding Branch-Decompositions and Rank-Decompositions. SIAM J. Comput. Petr Hlinený, Sang-il Oum
2008	J	`jnl`	New Infinite Families of Almost-Planar Crossing-Critical Graphs. Electron. J. Comb. Petr Hlinený
2008	J	`jnl`	Stars and Bonds in Crossing-Critical Graphs. Electron. Notes Discret. Math. Petr Hlinený, Gelasio Salazar
2008	J	`jnl`	The Crossing Number of a Projective Graph is Quadratic in the Face-Width. Electron. J. Comb. Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar
2008	J	`jnl`	Width Parameters Beyond Tree-width and their Applications. Comput. J. Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob
2007	B	`conf`	Approximating the Crossing Number of Toroidal Graphs. ISAAC Petr Hlinený, Gelasio Salazar
2007	A	`conf`	Finding Branch-Decompositions and Rank-Decompositions. ESA Petr Hlinený, Sang-il Oum
2007	J	`jnl`	Preface. Electron. Notes Discret. Math. Petr Hlinený, Jan Kratochvíl, Roman Nedela, Martin Skoviera
2007	J	`jnl`	Some Hard Problems on Matroid Spikes. Theory Comput. Syst. Petr Hlinený
2007	J	`jnl`	The crossing number of a projective graph is quadratic in the face-width. Electron. Notes Discret. Math. Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar
2006	J	`jnl`	Balanced Signings and the Chromatic Number of Oriented Matroids. Comb. Probab. Comput. Luis A. Goddyn, Petr Hlinený, Winfried Hochstättler
2006	J	`jnl`	Branch-width, parse trees, and monadic second-order logic for matroids. J. Comb. Theory B Petr Hlinený
2006	J	`jnl`	Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. SIAM J. Discret. Math. Omer Giménez, Petr Hlinený, Marc Noy
2006	J	`jnl`	Crossing number is hard for cubic graphs. J. Comb. Theory B Petr Hlinený
2006	J	`jnl`	Equivalence-free exhaustive generation of matroid representations. Discret. Appl. Math. Petr Hlinený
2006	J	`jnl`	Matroid tree-width. Eur. J. Comb. Petr Hlinený, Geoff Whittle
2006	B	`conf`	On Matroid Representability and Minor Problems. MFCS Petr Hlinený
2006	A	`conf`	On the Crossing Number of Almost Planar Graphs. GD Petr Hlinený, Gelasio Salazar
2006	J	`jnl`	The Tutte Polynomial for Matroids of Bounded Branch-Width. Comb. Probab. Comput. Petr Hlinený
2006	J	`jnl`	Trees, grids, and MSO decidability: From graphs to matroids. Theor. Comput. Sci. Petr Hlinený, Detlef Seese
2005	J	`jnl`	A Parametrized Algorithm for Matroid Branch-Width. SIAM J. Comput. Petr Hlinený
2005	B	`conf`	Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. WG Omer Giménez, Petr Hlinený, Marc Noy
2004	J	`jnl`	Bridging Separations in Matroids. SIAM J. Discret. Math. James F. Geelen, Petr Hlinený, Geoffrey P. Whittle
2004	B	`conf`	Crossing Number Is Hard for Cubic Graphs. MFCS Petr Hlinený
2004	—	`conf`	On Decidability of MSO Theories of Representable Matroids. IWPEC Petr Hlinený, Detlef Seese
2004	J	`jnl`	On possible counterexamples to Negami's planar cover conjecture. J. Graph Theory Petr Hlinený, Robin Thomas
2003	A	`conf`	Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. STACS Petr Hlinený
2003	J	`jnl`	Crossing-number critical graphs have bounded path-width. J. Comb. Theory B Petr Hlinený
2003	B	`conf`	On Matroid Properties Definable in the MSO Logic. MFCS Petr Hlinený
2002	J	`jnl`	On the Excluded Minors for Matroids of Branch-Width Three. Electron. J. Comb. Petr Hlinený
2001	J	`jnl`	An Addition to Art Galleries with Interior Walls. Discret. Comput. Geom. Petr Hlinený
2001	J	`jnl`	Another two graphs with no planar covers. J. Graph Theory Petr Hlinený
2001	J	`jnl`	Contact graphs of line segments are NP-complete. Discret. Math. Petr Hlinený
2001	A	`conf`	Crossing-Critical Graphs and Path-Width. GD Petr Hlinený
2001	J	`jnl`	Representing graphs by disks and balls (a survey of recognition-complexity results). Discret. Math. Petr Hlinený, Jan Kratochvíl
1999	J	`jnl`	A note on possible extensions of Negami's conjecture. J. Graph Theory Petr Hlinený
1998	J	`jnl`	Classes and Recognition of Curve Contact Graphs J. Comb. Theory B Petr Hlinený
1998	J	`jnl`	The Maximal Clique and Colourability of Curve Contact Graphs. Discret. Appl. Math. Petr Hlinený
1997	B	`conf`	Computational Complexity of the Krausz Dimension of Graphs. WG Petr Hlinený, Jan Kratochvíl
1997	A	`conf`	Touching Graphs of Unit Balls. GD Petr Hlinený
1995	A	`conf`	Contact Graphs of Curves. GD Petr Hlinený