default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Petr Hlinený
@article{DBLP:journals/dm/BalabanHJ24,
author = {Jakub Balab{\'{a}}n and
Petr Hlinen{\'{y}} and
Jan Jedelsk{\'{y}}},
title = {Twin-width and transductions of proper k-mixed-thin graphs},
journal = {Discret. Math.},
volume = {347},
number = {8},
pages = {113876},
year = {2024}
}
@article{DBLP:journals/ejc/CagiriciHR24,
author = {Onur {\c{C}}agirici and
Petr Hlinen{\'{y}} and
Bodhayan Roy},
title = {On colourability of polygon visibility graphs},
journal = {Eur. J. Comb.},
volume = {117},
pages = {103820},
year = {2024}
}
@inproceedings{DBLP:conf/mfcs/HlinenyJ24,
author = {Petr Hlinen{\'{y}} and
Jan Jedelsk{\'{y}}},
title = {{\(\mathscr{H}\)}-Clique-Width and a Hereditary Analogue of Product
Structure},
booktitle = {{MFCS}},
series = {LIPIcs},
volume = {306},
pages = {61:1--61:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024}
}
@article{DBLP:journals/corr/abs-2401-11610,
author = {Petr Hlinen{\'{y}}},
title = {Note on Min-k-Planar Drawings of Graphs},
journal = {CoRR},
volume = {abs/2401.11610},
year = {2024}
}
@article{DBLP:journals/corr/abs-2403-16789,
author = {Petr Hlinen{\'{y}} and
Jan Jedelsk{\'{y}}},
title = {H-Clique-Width and a Hereditary Analogue of Product Structure},
journal = {CoRR},
volume = {abs/2403.16789},
year = {2024}
}
@article{DBLP:journals/corr/abs-2406-18933,
author = {Petr Hlinen{\'{y}} and
Liana Khazaliya},
title = {Crossing Number is NP-hard for Constant Path-width (and Tree-width)},
journal = {CoRR},
volume = {abs/2406.18933},
year = {2024}
}
@article{DBLP:journals/corr/abs-2407-21206,
author = {Martin Balko and
Petr Hlinen{\'{y}} and
Tom{\'{a}}s Masar{\'{\i}}k and
Joachim Orthaber and
Birgit Vogtenhuber and
Mirko H. Wagner},
title = {On the Uncrossed Number of Graphs},
journal = {CoRR},
volume = {abs/2407.21206},
year = {2024}
}
@article{DBLP:journals/algorithmica/CagiriciH23,
author = {Deniz Agaoglu {\c{C}}agirici and
Petr Hlinen{\'{y}}},
title = {Efficient Isomorphism for S\({}_{\mbox{d}}\)-Graphs and T-Graphs},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {352--383},
year = {2023}
}
@article{DBLP:journals/jctb/CagiriciHPS23,
author = {Onur {\c{C}}agirici and
Petr Hlinen{\'{y}} and
Filip Pokr{\'{y}}vka and
Abhisekh Sankaran},
title = {Clique-width of point configurations},
journal = {J. Comb. Theory {B}},
volume = {158},
number = {Part},
pages = {43--73},
year = {2023}
}
@article{DBLP:journals/jgaa/ChimaniH23,
author = {Markus Chimani and
Petr Hlinen{\'{y}}},
title = {Inserting Multiple Edges into a Planar Graph},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {6},
pages = {489--522},
year = {2023}
}
@inproceedings{DBLP:conf/gd/HlinenyM23,
author = {Petr Hlinen{\'{y}} and
Tom{\'{a}}s Masar{\'{\i}}k},
title = {Minimizing an Uncrossed Collection of Drawings},
booktitle = {{GD} {(1)}},
series = {Lecture Notes in Computer Science},
volume = {14465},
pages = {110--123},
publisher = {Springer},
year = {2023}
}
@inproceedings{DBLP:conf/icalp/HlinenyJ23,
author = {Petr Hlinen{\'{y}} and
Jan Jedelsk{\'{y}}},
title = {Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite
Planar},
booktitle = {{ICALP}},
series = {LIPIcs},
volume = {261},
pages = {75:1--75:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023}
}
@inproceedings{DBLP:conf/isaac/BergougnouxGGHP23,
author = {Benjamin Bergougnoux and
Jakub Gajarsk{\'{y}} and
Grzegorz Guspiel and
Petr Hlinen{\'{y}} and
Filip Pokr{\'{y}}vka and
Marek Sokolowski},
title = {Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width},
booktitle = {{ISAAC}},
series = {LIPIcs},
volume = {283},
pages = {11:1--11:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023}
}
@inproceedings{DBLP:conf/mfcs/CagiriciCDHHKK023,
author = {Deniz Agaoglu {\c{C}}agirici and
Onur {\c{C}}agirici and
Jan Derbisz and
Tim A. Hartmann and
Petr Hlinen{\'{y}} and
Jan Kratochv{\'{\i}}l and
Tomasz Krawczyk and
Peter Zeman},
title = {Recognizing H-Graphs - Beyond Circular-Arc Graphs},
booktitle = {{MFCS}},
series = {LIPIcs},
volume = {272},
pages = {8:1--8:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023}
}
@article{DBLP:journals/corr/abs-2303-10116,
author = {Petr Hlinen{\'{y}} and
Adam Straka},
title = {Stack and Queue Numbers of Graphs Revisited},
journal = {CoRR},
volume = {abs/2303.10116},
year = {2023}
}
@article{DBLP:journals/corr/abs-2306-03490,
author = {Petr Hlinen{\'{y}}},
title = {Complexity of Anchored Crossing Number and Crossing Number of Almost
Planar Graphs},
journal = {CoRR},
volume = {abs/2306.03490},
year = {2023}
}
@article{DBLP:journals/corr/abs-2306-09550,
author = {Petr Hlinen{\'{y}} and
Tom{\'{a}}s Masar{\'{\i}}k},
title = {Minimizing an Uncrossed Collection of Drawings},
journal = {CoRR},
volume = {abs/2306.09550},
year = {2023}
}
@article{DBLP:journals/corr/abs-2307-01732,
author = {Benjamin Bergougnoux and
Jakub Gajarsk{\'{y}} and
Grzegorz Guspiel and
Petr Hlinen{\'{y}} and
Filip Pokr{\'{y}}vka and
Marek Sokolowski},
title = {Sparse Graphs of Twin-width 2 Have Bounded Tree-width},
journal = {CoRR},
volume = {abs/2307.01732},
year = {2023}
}
@article{DBLP:journals/combinatorica/BokalDHLMW22,
author = {Drago Bokal and
Zdenek Dvor{\'{a}}k and
Petr Hlinen{\'{y}} and
Jes{\'{u}}s Lea{\~{n}}os and
Bojan Mohar and
Tilo Wiedera},
title = {Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical
Graphs with c {\(\leq\)} 12},
journal = {Comb.},
volume = {42},
number = {5},
pages = {701--728},
year = {2022}
}
@inproceedings{DBLP:conf/compgeom/HammH22,
author = {Thekla Hamm and
Petr Hlinen{\'{y}}},
title = {Parameterised Partially-Predrawn Crossing Number},
booktitle = {SoCG},
series = {LIPIcs},
volume = {224},
pages = {46:1--46:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022}
}
@inproceedings{DBLP:conf/isaac/BekosLH022,
author = {Michael A. Bekos and
Giordano Da Lozzo and
Petr Hlinen{\'{y}} and
Michael Kaufmann},
title = {Graph Product Structure for h-Framed Graphs},
booktitle = {{ISAAC}},
series = {LIPIcs},
volume = {248},
pages = {23:1--23:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022}
}
@inproceedings{DBLP:conf/walcom/CagiriciH22,
author = {Deniz Agaoglu {\c{C}}agirici and
Petr Hlinen{\'{y}}},
title = {Isomorphism Testing for T-graphs in {FPT}},
booktitle = {{WALCOM}},
series = {Lecture Notes in Computer Science},
volume = {13174},
pages = {239--250},
publisher = {Springer},
year = {2022}
}
@inproceedings{DBLP:conf/wg/BalabanHJ22,
author = {Jakub Balab{\'{a}}n and
Petr Hlinen{\'{y}} and
Jan Jedelsk{\'{y}}},
title = {Twin-Width and Transductions of Proper k-Mixed-Thin Graphs},
booktitle = {{WG}},
series = {Lecture Notes in Computer Science},
volume = {13453},
pages = {43--55},
publisher = {Springer},
year = {2022}
}
@article{DBLP:journals/corr/abs-2202-12536,
author = {Jakub Balab{\'{a}}n and
Petr Hlinen{\'{y}} and
Jan Jedelsk{\'{y}}},
title = {Twin-width and Transductions of Proper k-Mixed-Thin Graphs},
journal = {CoRR},
volume = {abs/2202.12536},
year = {2022}
}
@article{DBLP:journals/corr/abs-2202-12664,
author = {Deniz Agaoglu and
Petr Hlinen{\'{y}}},
title = {Automorphism Group of Marked Interval Graphs in {FPT}},
journal = {CoRR},
volume = {abs/2202.12664},
year = {2022}
}
@article{DBLP:journals/corr/abs-2202-13635,
author = {Thekla Hamm and
Petr Hlinen{\'{y}}},
title = {Parameterised Partially-Predrawn Crossing Number},
journal = {CoRR},
volume = {abs/2202.13635},
year = {2022}
}
@article{DBLP:journals/corr/abs-2204-11495,
author = {Michael A. Bekos and
Giordano Da Lozzo and
Petr Hlinen{\'{y}} and
Michael Kaufmann},
title = {Graph Product Structure for h-Framed Graphs},
journal = {CoRR},
volume = {abs/2204.11495},
year = {2022}
}
@article{DBLP:journals/corr/abs-2204-13742,
author = {Petr Hlinen{\'{y}} and
Filip Pokr{\'{y}}vka},
title = {Twin-width and Limits of Tractability of {FO} Model Checking on Geometric
Graphs},
journal = {CoRR},
volume = {abs/2204.13742},
year = {2022}
}
@article{DBLP:journals/corr/abs-2210-08620,
author = {Petr Hlinen{\'{y}} and
Jan Jedelsk{\'{y}}},
title = {Twin-width of Planar Graphs is at most 8},
journal = {CoRR},
volume = {abs/2210.08620},
year = {2022}
}
@article{DBLP:journals/corr/abs-2212-05433,
author = {Deniz Agaoglu {\c{C}}agirici and
Onur {\c{C}}agirici and
Jan Derbisz and
Tim A. Hartmann and
Petr Hlinen{\'{y}} and
Jan Kratochv{\'{\i}}l and
Tomasz Krawczyk and
Peter Zeman},
title = {Beyond circular-arc graphs - recognizing lollipop graphs and medusa
graphs},
journal = {CoRR},
volume = {abs/2212.05433},
year = {2022}
}
@inproceedings{DBLP:conf/iwpec/BalabanH21,
author = {Jakub Balab{\'{a}}n and
Petr Hlinen{\'{y}}},
title = {Twin-Width Is Linear in the Poset Width},
booktitle = {{IPEC}},
series = {LIPIcs},
volume = {214},
pages = {6:1--6:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021}
}
@inproceedings{DBLP:conf/mfcs/Bok0HJK21,
author = {Jan Bok and
Jir{\'{\i}} Fiala and
Petr Hlinen{\'{y}} and
Nikola Jedlickov{\'{a}} and
Jan Kratochv{\'{\i}}l},
title = {Computational Complexity of Covering Multigraphs with Semi-Edges:
Small Cases},
booktitle = {{MFCS}},
series = {LIPIcs},
volume = {202},
pages = {21:1--21:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021}
}
@article{DBLP:journals/corr/abs-2103-15214,
author = {Jan Bok and
Jir{\'{\i}} Fiala and
Petr Hlinen{\'{y}} and
Nikola Jedlickov{\'{a}} and
Jan Kratochv{\'{\i}}l},
title = {Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges},
journal = {CoRR},
volume = {abs/2103.15214},
year = {2021}
}
@article{DBLP:journals/corr/abs-2106-15337,
author = {Jakub Balab{\'{a}}n and
Petr Hlinen{\'{y}}},
title = {Twin-Width is Linear in the Poset Width},
journal = {CoRR},
volume = {abs/2106.15337},
year = {2021}
}
@article{DBLP:journals/corr/abs-2111-10910,
author = {Deniz Agaoglu and
Petr Hlinen{\'{y}}},
title = {Isomorphism Testing for T-graphs in {FPT}},
journal = {CoRR},
volume = {abs/2111.10910},
year = {2021}
}
@article{DBLP:journals/jct/ChimaniHS20,
author = {Markus Chimani and
Petr Hlinen{\'{y}} and
Gelasio Salazar},
title = {Toroidal grid minors and stretch in embedded graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {140},
pages = {323--371},
year = {2020}
}
@article{DBLP:journals/tocl/GajarskyHOLR20,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek and
Daniel Lokshtanov and
M. S. Ramanujan},
title = {A New Perspective on {FO} Model Checking of Dense Graph Classes},
journal = {{ACM} Trans. Comput. Log.},
volume = {21},
number = {4},
pages = {28:1--28:23},
year = {2020}
}
@inproceedings{DBLP:conf/mfcs/AgaogluH20,
author = {Deniz Agaoglu and
Petr Hlinen{\'{y}}},
title = {Isomorphism Problem for S{\_}d-Graphs},
booktitle = {{MFCS}},
series = {LIPIcs},
volume = {170},
pages = {4:1--4:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020}
}
@inproceedings{DBLP:conf/wg/CagiriciHPS20,
author = {Onur {\c{C}}agirici and
Petr Hlinen{\'{y}} and
Filip Pokr{\'{y}}vka and
Abhisekh Sankaran},
title = {Clique-Width of Point Configurations},
booktitle = {{WG}},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {54--66},
publisher = {Springer},
year = {2020}
}
@article{DBLP:journals/corr/abs-2004-02282,
author = {Onur {\c{C}}agirici and
Petr Hlinen{\'{y}} and
Filip Pokr{\'{y}}vka and
Abhisekh Sankaran},
title = {Clique-Width of Point Configurations},
journal = {CoRR},
volume = {abs/2004.02282},
year = {2020}
}
@article{DBLP:journals/combinatorics/BokalBDH19,
author = {Drago Bokal and
Mojca Bracic and
Marek Dern{\'{a}}r and
Petr Hlinen{\'{y}}},
title = {On Degree Properties of Crossing-Critical Families of Graphs},
journal = {Electron. J. Comb.},
volume = {26},
number = {1},
pages = {1},
year = {2019}
}
@article{DBLP:journals/comgeo/HlinenyPR19,
author = {Petr Hlinen{\'{y}} and
Filip Pokr{\'{y}}vka and
Bodhayan Roy},
title = {{FO} model checking on geometric graphs},
journal = {Comput. Geom.},
volume = {78},
pages = {1--19},
year = {2019}
}
@article{DBLP:journals/jcss/GajarskyHKO19,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Martin Kouteck{\'{y}} and
Shmuel Onn},
title = {Parameterized shifted combinatorial optimization},
journal = {J. Comput. Syst. Sci.},
volume = {99},
pages = {53--71},
year = {2019}
}
@article{DBLP:journals/lmcs/GanianHNOM19,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Jaroslav Nesetril and
Jan Obdrz{\'{a}}lek and
Patrice Ossona de Mendez},
title = {Shrub-depth: Capturing Height of Dense Graphs},
journal = {Log. Methods Comput. Sci.},
volume = {15},
number = {1},
year = {2019}
}
@inproceedings{DBLP:conf/cocoa/CagiriciGHR19,
author = {Onur {\c{C}}agirici and
Subir Kumar Ghosh and
Petr Hlinen{\'{y}} and
Bodhayan Roy},
title = {On Conflict-Free Chromatic Guarding of Simple Polygons},
booktitle = {{COCOA}},
series = {Lecture Notes in Computer Science},
volume = {11949},
pages = {601--612},
publisher = {Springer},
year = {2019}
}
@inproceedings{DBLP:conf/compgeom/BokalDHLMW19,
author = {Drago Bokal and
Zdenek Dvor{\'{a}}k and
Petr Hlinen{\'{y}} and
Jes{\'{u}}s Lea{\~{n}}os and
Bojan Mohar and
Tilo Wiedera},
title = {Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical
Graphs with c {\textless}= 12},
booktitle = {SoCG},
series = {LIPIcs},
volume = {129},
pages = {14:1--14:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019}
}
@inproceedings{DBLP:conf/gd/HlinenyS19,
author = {Petr Hlinen{\'{y}} and
Abhisekh Sankaran},
title = {Exact Crossing Number Parameterized by Vertex Cover},
booktitle = {{GD}},
series = {Lecture Notes in Computer Science},
volume = {11904},
pages = {307--319},
publisher = {Springer},
year = {2019}
}
@article{DBLP:journals/corr/abs-1903-05363,
author = {Drago Bokal and
Zdenek Dvor{\'{a}}k and
Petr Hlinen{\'{y}} and
Jes{\'{u}}s Lea{\~{n}}os and
Bojan Mohar and
Tilo Wiedera},
title = {Bounded maximum degree conjecture holds precisely for c-crossing-critical
graphs with c{\(\leq\)}12},
journal = {CoRR},
volume = {abs/1903.05363},
year = {2019}
}
@article{DBLP:journals/corr/abs-1904-08624,
author = {Onur {\c{C}}agirici and
Subir Kumar Ghosh and
Petr Hlinen{\'{y}} and
Bodhayan Roy},
title = {On conflict-free chromatic guarding of simple polygons},
journal = {CoRR},
volume = {abs/1904.08624},
year = {2019}
}
@article{DBLP:journals/corr/abs-1906-01904,
author = {Onur {\c{C}}agirici and
Petr Hlinen{\'{y}} and
Bodhayan Roy},
title = {On Colourability of Polygon Visibility Graphs},
journal = {CoRR},
volume = {abs/1906.01904},
year = {2019}
}
@article{DBLP:journals/corr/abs-1906-06048,
author = {Petr Hlinen{\'{y}} and
Abhisekh Sankaran},
title = {Exact Crossing Number Parameterized by Vertex Cover},
journal = {CoRR},
volume = {abs/1906.06048},
year = {2019}
}
@article{DBLP:journals/dam/GajarskyHT18,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Hans Raj Tiwary},
title = {Parameterized extension complexity of independent set and related
problems},
journal = {Discret. Appl. Math.},
volume = {248},
pages = {56--67},
year = {2018}
}
@article{DBLP:journals/siamdm/Hlineny18,
author = {Petr Hlinen{\'{y}}},
title = {A Simpler Self-reduction Algorithm for Matroid Path-Width},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {2},
pages = {1425--1440},
year = {2018}
}
@article{DBLP:journals/siamdm/HlinenyT18,
author = {Petr Hlinen{\'{y}} and
Carsten Thomassen},
title = {Deciding Parity of Graph Crossing Number},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {3},
pages = {1962--1965},
year = {2018}
}
@inproceedings{DBLP:conf/compgeom/DvorakHM18,
author = {Zdenek Dvor{\'{a}}k and
Petr Hlinen{\'{y}} and
Bojan Mohar},
title = {Structure and Generation of Crossing-Critical Graphs},
booktitle = {SoCG},
series = {LIPIcs},
volume = {99},
pages = {33:1--33:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018}
}
@article{DBLP:journals/corr/abs-1803-01931,
author = {Zdenek Dvor{\'{a}}k and
Petr Hlinen{\'{y}} and
Bojan Mohar},
title = {Structure and generation of crossing-critical graphs},
journal = {CoRR},
volume = {abs/1803.01931},
year = {2018}
}
@article{DBLP:journals/corr/abs-1805-01823,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Daniel Lokshtanov and
Jan Obdrz{\'{a}}lek and
M. S. Ramanujan},
title = {A New Perspective on {FO} Model Checking of Dense Graph Classes},
journal = {CoRR},
volume = {abs/1805.01823},
year = {2018}
}
@article{DBLP:journals/jco/ChimaniH17,
author = {Markus Chimani and
Petr Hlinen{\'{y}}},
title = {A tighter insertion-based approximation of the crossing number},
journal = {J. Comb. Optim.},
volume = {33},
number = {4},
pages = {1183--1225},
year = {2017}
}
@article{DBLP:journals/jcss/GajarskyHOORRVS17,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak and
Felix Reidl and
Peter Rossmanith and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar},
title = {Kernelization using structural parameters on sparse graph classes},
journal = {J. Comput. Syst. Sci.},
volume = {84},
pages = {219--242},
year = {2017}
}
@article{DBLP:journals/rsa/GajarskyHKKKOOT17,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Tom{\'{a}}s Kaiser and
Daniel Kr{\'{a}}l' and
Martin Kupec and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak and
Vojtech Tuma},
title = {First order limits of sparse graphs: Plane trees and path-width},
journal = {Random Struct. Algorithms},
volume = {50},
number = {4},
pages = {612--635},
year = {2017}
}
@inproceedings{DBLP:conf/cocoon/GajarskyHKO17,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Martin Kouteck{\'{y}} and
Shmuel Onn},
title = {Parameterized Shifted Combinatorial Optimization},
booktitle = {{COCOON}},
series = {Lecture Notes in Computer Science},
volume = {10392},
pages = {224--236},
publisher = {Springer},
year = {2017}
}
@inproceedings{DBLP:conf/fsttcs/CagiriciHR17,
author = {Onur Cagirici and
Petr Hlinen{\'{y}} and
Bodhayan Roy},
title = {On Colourability of Polygon Visibility Graphs},
booktitle = {{FSTTCS}},
series = {LIPIcs},
volume = {93},
pages = {21:1--21:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017}
}
@inproceedings{DBLP:conf/iwpec/HlinenyPR17,
author = {Petr Hlinen{\'{y}} and
Filip Pokr{\'{y}}vka and
Bodhayan Roy},
title = {{FO} Model Checking of Geometric Graphs},
booktitle = {{IPEC}},
series = {LIPIcs},
volume = {89},
pages = {19:1--19:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017}
}
@article{DBLP:journals/corr/GajarskyHKO17,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Martin Kouteck{\'{y}} and
Shmuel Onn},
title = {Parameterized Shifted Combinatorial Optimization},
journal = {CoRR},
volume = {abs/1702.06844},
year = {2017}
}
@article{DBLP:journals/corr/GanianHNOM17,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Jaroslav Nesetril and
Jan Obdrz{\'{a}}lek and
Patrice Ossona de Mendez},
title = {Shrub-depth: Capturing Height of Dense Graphs},
journal = {CoRR},
volume = {abs/1707.00359},
year = {2017}
}
@article{DBLP:journals/corr/abs-1709-03701,
author = {Petr Hlinen{\'{y}} and
Filip Pokr{\'{y}}vka and
Bodhayan Roy},
title = {{FO} model checking of geometric graphs},
journal = {CoRR},
volume = {abs/1709.03701},
year = {2017}
}
@article{DBLP:journals/ejc/HlinenyKOO16,
author = {Petr Hlinen{\'{y}} and
O{-}joung Kwon and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak},
title = {Tree-depth and vertex-minors},
journal = {Eur. J. Comb.},
volume = {56},
pages = {46--56},
year = {2016}
}
@article{DBLP:journals/jct/GanianHK0ORS16,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Joachim Kneis and
Daniel Meister and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
title = {Are there any good digraph width measures?},
journal = {J. Comb. Theory {B}},
volume = {116},
pages = {250--286},
year = {2016}
}
@inproceedings{DBLP:conf/compgeom/ChimaniH16,
author = {Markus Chimani and
Petr Hlinen{\'{y}}},
title = {Inserting Multiple Edges into a Planar Graph},
booktitle = {SoCG},
series = {LIPIcs},
volume = {51},
pages = {30:1--30:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016}
}
@inproceedings{DBLP:conf/compgeom/HlinenyD16,
author = {Petr Hlinen{\'{y}} and
Marek Dern{\'{a}}r},
title = {Crossing Number is Hard for Kernelization},
booktitle = {SoCG},
series = {LIPIcs},
volume = {51},
pages = {42:1--42:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016}
}
@inproceedings{DBLP:conf/lics/GajarskyHOLR16,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek and
Daniel Lokshtanov and
M. S. Ramanujan},
title = {A New Perspective on {FO} Model Checking of Dense Graph Classes},
booktitle = {{LICS}},
pages = {176--184},
publisher = {{ACM}},
year = {2016}
}
@article{DBLP:journals/corr/Hlineny16,
author = {Petr Hlinen{\'{y}}},
title = {Simpler Self-reduction Algorithm for Matroid Path-width},
journal = {CoRR},
volume = {abs/1605.09520},
year = {2016}
}
@article{DBLP:journals/corr/abs-1204-5194,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}}},
title = {Kernelizing {MSO} Properties of Trees of Fixed Height, and Some Consequences},
journal = {Log. Methods Comput. Sci.},
volume = {11},
number = {1},
year = {2015}
}
@article{DBLP:journals/corr/GajarskyHOO14,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak},
title = {Faster Existential {FO} Model Checking on Posets},
journal = {Log. Methods Comput. Sci.},
volume = {11},
number = {4},
year = {2015}
}
@article{DBLP:journals/corr/abs-1302-6043,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Daniel Kr{\'{a}}l and
Jan Obdrz{\'{a}}lek and
Jarett Schwartz and
Jakub Teska},
title = {{FO} Model Checking of Interval Graphs},
journal = {Log. Methods Comput. Sci.},
volume = {11},
number = {4},
year = {2015}
}
@article{DBLP:journals/ejc/DerkaH15,
author = {Martin Derka and
Petr Hlinen{\'{y}}},
title = {Planar emulators conjecture is nearly true for cubic graphs},
journal = {Eur. J. Comb.},
volume = {48},
pages = {63--70},
year = {2015}
}
@inproceedings{DBLP:conf/focs/GajarskyHLOORS15,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Daniel Lokshtanov and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak and
M. S. Ramanujan and
Saket Saurabh},
title = {{FO} Model Checking on Posets of Bounded Width},
booktitle = {{FOCS}},
pages = {963--974},
publisher = {{IEEE} Computer Society},
year = {2015}
}
@inproceedings{DBLP:conf/gd/BokalBDH15,
author = {Drago Bokal and
Mojca Bracic and
Marek Dern{\'{a}}r and
Petr Hlinen{\'{y}}},
title = {On Degree Properties of Crossing-Critical Families of Graphs},
booktitle = {{GD}},
series = {Lecture Notes in Computer Science},
volume = {9411},
pages = {75--86},
publisher = {Springer},
year = {2015}
}
@inproceedings{DBLP:conf/isaac/HlinenyS15,
author = {Petr Hlinen{\'{y}} and
Gelasio Salazar},
title = {On Hardness of the Joint Crossing Number},
booktitle = {{ISAAC}},
series = {Lecture Notes in Computer Science},
volume = {9472},
pages = {603--613},
publisher = {Springer},
year = {2015}
}
@inproceedings{DBLP:conf/memics/HlinenyS15,
author = {Petr Hlinen{\'{y}} and
Ondrej Sl{\'{a}}mecka},
title = {Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs},
booktitle = {{MEMICS}},
series = {Lecture Notes in Computer Science},
volume = {9548},
pages = {54--66},
publisher = {Springer},
year = {2015}
}
@article{DBLP:journals/corr/GajarskyHLOORS15,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Daniel Lokshtanov and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak and
M. S. Ramanujan and
Saket Saurabh},
title = {{FO} Model Checking on Posets of Bounded Width},
journal = {CoRR},
volume = {abs/1504.04115},
year = {2015}
}
@article{DBLP:journals/corr/BrazdilHKRA15,
author = {Tom{\'{a}}s Br{\'{a}}zdil and
Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera and
Vojtech Reh{\'{a}}k and
Mat{\'{u}}s Abaffy},
title = {Strategy Synthesis in Adversarial Patrolling Games},
journal = {CoRR},
volume = {abs/1507.03407},
year = {2015}
}
@article{DBLP:journals/corr/HlinenyS15,
author = {Petr Hlinen{\'{y}} and
Gelasio Salazar},
title = {On Hardness of the Joint Crossing Number},
journal = {CoRR},
volume = {abs/1509.01787},
year = {2015}
}
@article{DBLP:journals/corr/ChimaniH15,
author = {Markus Chimani and
Petr Hlinen{\'{y}}},
title = {Inserting Multiple Edges into a Planar Graph},
journal = {CoRR},
volume = {abs/1509.07952},
year = {2015}
}
@article{DBLP:journals/corr/GajarskyHT15,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Hans Raj Tiwary},
title = {Parameterized Extension Complexity of Independent Set and Related
Problems},
journal = {CoRR},
volume = {abs/1511.08841},
year = {2015}
}
@article{DBLP:journals/corr/HlinenyD15,
author = {Petr Hlinen{\'{y}} and
Marek Dern{\'{a}}r},
title = {Crossing Number is Hard for Kernelization},
journal = {CoRR},
volume = {abs/1512.02379},
year = {2015}
}
@article{DBLP:journals/dam/GanianHKLOR14,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Joachim Kneis and
Alexander Langer and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith},
title = {Digraph width measures in parameterized algorithmics},
journal = {Discret. Appl. Math.},
volume = {168},
pages = {88--107},
year = {2014}
}
@article{DBLP:journals/jcss/GanianHLORS14,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Alexander Langer and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
title = {Lower bounds on the complexity of MSO\({}_{\mbox{1}}\) model-checking},
journal = {J. Comput. Syst. Sci.},
volume = {80},
number = {1},
pages = {180--194},
year = {2014}
}
@article{DBLP:journals/siamdm/CabelloCH14,
author = {Sergio Cabello and
Markus Chimani and
Petr Hlinen{\'{y}}},
title = {Computing the Stretch of an Embedded Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {3},
pages = {1391--1401},
year = {2014}
}
@inproceedings{DBLP:conf/isaac/GajarskyHOO14,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak},
title = {Faster Existential {FO} Model Checking on Posets},
booktitle = {{ISAAC}},
series = {Lecture Notes in Computer Science},
volume = {8889},
pages = {441--451},
publisher = {Springer},
year = {2014}
}
@proceedings{DBLP:conf/memics/2014,
editor = {Petr Hlinen{\'{y}} and
Zdenek Dvor{\'{a}}k and
Jir{\'{\i}} Jaros and
Jan Kofron and
Jan Korenek and
Petr Matula and
Karel Pala},
title = {Mathematical and Engineering Methods in Computer Science - 9th International
Doctoral Workshop, {MEMICS} 2014, Tel{\v{c}}, Czech Republic, October
17-19, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8934},
publisher = {Springer},
year = {2014}
}
@article{DBLP:journals/corr/HlinenyKOO14,
author = {Petr Hlinen{\'{y}} and
O{-}joung Kwon and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak},
title = {Tree-depth and Vertex-minors},
journal = {CoRR},
volume = {abs/1403.7024},
year = {2014}
}
@article{DBLP:journals/aam/ChimaniDHK13,
author = {Markus Chimani and
Martin Derka and
Petr Hlinen{\'{y}} and
Matej Klus{\'{a}}cek},
title = {How not to characterize planar-emulable graphs},
journal = {Adv. Appl. Math.},
volume = {50},
number = {1},
pages = {46--68},
year = {2013}
}
@article{DBLP:journals/ejc/GanianHO13,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek},
title = {A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width},
journal = {Eur. J. Comb.},
volume = {34},
number = {3},
pages = {680--701},
year = {2013}
}
@article{DBLP:journals/fuin/GanianHO13,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek},
title = {Better Algorithms for Satisfiability Problems for Formulas of Bounded
Rank-width},
journal = {Fundam. Informaticae},
volume = {123},
number = {1},
pages = {59--76},
year = {2013}
}
@inproceedings{DBLP:conf/esa/GajarskyHOORRVS13,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak and
Felix Reidl and
Peter Rossmanith and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar},
title = {Kernelization Using Structural Parameters on Sparse Graph Classes},
booktitle = {{ESA}},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {529--540},
publisher = {Springer},
year = {2013}
}
@inproceedings{DBLP:conf/icalp/GanianHKOST13,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Daniel Kr{\'{a}}l' and
Jan Obdrz{\'{a}}lek and
Jarett Schwartz and
Jakub Teska},
title = {{FO} Model Checking of Interval Graphs},
booktitle = {{ICALP} {(2)}},
series = {Lecture Notes in Computer Science},
volume = {7966},
pages = {250--262},
publisher = {Springer},
year = {2013}
}
@article{DBLP:journals/corr/abs-1302-6863,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak and
Felix Reidl and
Peter Rossmanith and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar},
title = {Kernelization Using Structural Parameters on Sparse Graph Classes},
journal = {CoRR},
volume = {abs/1302.6863},
year = {2013}
}
@article{DBLP:journals/cai/HlinenyM12,
author = {Petr Hlinen{\'{y}} and
Ondrej Moris},
title = {Generalized Maneuvers in Route Planning for Computing and Informatics},
journal = {Comput. Informatics},
volume = {31},
number = {3},
pages = {531},
year = {2012}
}
@article{DBLP:journals/ejc/ChimaniHM12,
author = {Markus Chimani and
Petr Hlinen{\'{y}} and
Petra Mutzel},
title = {Vertex insertion approximates the crossing number of apex graphs},
journal = {Eur. J. Comb.},
volume = {33},
number = {3},
pages = {326--335},
year = {2012}
}
@article{DBLP:journals/tcs/HlinenyK12,
author = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {417},
pages = {1},
year = {2012}
}
@inproceedings{DBLP:conf/fsttcs/GajarskyH12,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}}},
title = {Faster Deciding {MSO} Properties of Trees of Fixed Height, and Some
Consequences},
booktitle = {{FSTTCS}},
series = {LIPIcs},
volume = {18},
pages = {112--123},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012}
}
@inproceedings{DBLP:conf/mfcs/GanianHNOMR12,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Jaroslav Nesetril and
Jan Obdrz{\'{a}}lek and
Patrice Ossona de Mendez and
Reshma Ramadurai},
title = {When Trees Grow Low: Shrubs and Fast {MSO1}},
booktitle = {{MFCS}},
series = {Lecture Notes in Computer Science},
volume = {7464},
pages = {419--430},
publisher = {Springer},
year = {2012}
}
@inproceedings{DBLP:conf/stacs/GanianHLOR12,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Alexander Langer and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
title = {Lower Bounds on the Complexity of MSO{\_}1 Model-Checking},
booktitle = {{STACS}},
series = {LIPIcs},
volume = {14},
pages = {326--337},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012}
}
@article{DBLP:journals/corr/abs-1201-2000,
author = {Petr Hlinen{\'{y}} and
Ondrej Moris},
title = {Dynamic Scope-Based Dijkstra's Algorithm},
journal = {CoRR},
volume = {abs/1201.2000},
year = {2012}
}
@article{DBLP:journals/corr/abs-1205-4363,
author = {Petr Hlinen{\'{y}} and
Ondrej Moris},
title = {Detours in Scope-Based Route Planning},
journal = {CoRR},
volume = {abs/1205.4363},
year = {2012}
}
@article{DBLP:journals/dmtcs/JelinkovaSHK11,
author = {Eva Jel{\'{\i}}nkov{\'{a}} and
Ondrej Such{\'{y}} and
Petr Hlinen{\'{y}} and
Jan Kratochv{\'{\i}}l},
title = {Parameterized Problems Related to Seidel's Switching},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {13},
number = {2},
pages = {19--44},
year = {2011}
}
@inproceedings{DBLP:conf/esa/HlinenyM11,
author = {Petr Hlinen{\'{y}} and
Ondrej Moris},
title = {Scope-Based Route Planning},
booktitle = {{ESA}},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {445--456},
publisher = {Springer},
year = {2011}
}
@inproceedings{DBLP:conf/icalp/ChimaniH11,
author = {Markus Chimani and
Petr Hlinen{\'{y}}},
title = {A Tighter Insertion-Based Approximation of the Crossing Number},
booktitle = {{ICALP} {(1)}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {122--134},
publisher = {Springer},
year = {2011}
}
@inproceedings{DBLP:conf/iwoca/ChimaniDHK11,
author = {Markus Chimani and
Martin Derka and
Petr Hlinen{\'{y}} and
Matej Klus{\'{a}}cek},
title = {How Not to Characterize Planar-Emulable Graphs},
booktitle = {{IWOCA}},
series = {Lecture Notes in Computer Science},
volume = {7056},
pages = {106--120},
publisher = {Springer},
year = {2011}
}
@inproceedings{DBLP:conf/memics/HlinenyM11,
author = {Petr Hlinen{\'{y}} and
Ondrej Moris},
title = {Generalized Maneuvers in Route Planning},
booktitle = {{MEMICS}},
series = {Lecture Notes in Computer Science},
volume = {7119},
pages = {155--166},
publisher = {Springer},
year = {2011}
}
@inproceedings{DBLP:conf/stacs/GanianHO11,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek},
title = {Clique-width: When Hard Does Not Mean Impossible},
booktitle = {{STACS}},
series = {LIPIcs},
volume = {9},
pages = {404--415},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011}
}
@article{DBLP:journals/corr/abs-1101-3182,
author = {Petr Hlinen{\'{y}} and
Ondrej Moris},
title = {Multi-Stage Improved Route Planning Approach: theoretical foundations},
journal = {CoRR},
volume = {abs/1101.3182},
year = {2011}
}
@article{DBLP:journals/corr/abs-1104-5039,
author = {Markus Chimani and
Petr Hlinen{\'{y}}},
title = {A Tighter Insertion-based Approximation of the Crossing Number},
journal = {CoRR},
volume = {abs/1104.5039},
year = {2011}
}
@article{DBLP:journals/corr/abs-1107-0176,
author = {Markus Chimani and
Martin Derka and
Petr Hlinen{\'{y}} and
Matej Klus{\'{a}}cek},
title = {How Not to Characterize Planar-emulable Graphs},
journal = {CoRR},
volume = {abs/1107.0176},
year = {2011}
}
@article{DBLP:journals/corr/abs-1107-0798,
author = {Petr Hlinen{\'{y}} and
Ondrej Moris},
title = {Generalized Maneuvers in Route Planning},
journal = {CoRR},
volume = {abs/1107.0798},
year = {2011}
}
@article{DBLP:journals/corr/abs-1109-5804,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Alexander Langer and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
title = {Lower Bounds on the Complexity of {MSO1} Model-Checking},
journal = {CoRR},
volume = {abs/1109.5804},
year = {2011}
}
@article{DBLP:journals/dam/GanianH10,
author = {Robert Ganian and
Petr Hlinen{\'{y}}},
title = {On parse trees and Myhill-Nerode-type tools for handling graphs of
bounded rank-width},
journal = {Discret. Appl. Math.},
volume = {158},
number = {7},
pages = {851--867},
year = {2010}
}
@article{DBLP:journals/gc/Hlineny10,
author = {Petr Hlinen{\'{y}}},
title = {20 Years of Negami's Planar Cover Conjecture},
journal = {Graphs Comb.},
volume = {26},
number = {4},
pages = {525--536},
year = {2010}
}
@article{DBLP:journals/jgt/HlinenyS10,
author = {Petr Hlinen{\'{y}} and
Gelasio Salazar},
title = {Stars and bonds in crossing-critical graphs},
journal = {J. Graph Theory},
volume = {65},
number = {3},
pages = {198--215},
year = {2010}
}
@inproceedings{DBLP:conf/fsttcs/GanianHO10,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek},
title = {Better Algorithms for Satisfiability Problems for Formulas of Bounded
Rank-width},
booktitle = {{FSTTCS}},
series = {LIPIcs},
volume = {8},
pages = {73--83},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010}
}
@inproceedings{DBLP:conf/iwpec/GanianHKMORS10,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Joachim Kneis and
Daniel Meister and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
title = {Are There Any Good Digraph Width Measures?},
booktitle = {{IPEC}},
series = {Lecture Notes in Computer Science},
volume = {6478},
pages = {135--146},
publisher = {Springer},
year = {2010}
}
@inproceedings{DBLP:conf/soda/HlinenyC10,
author = {Petr Hlinen{\'{y}} and
Markus Chimani},
title = {Approximating the Crossing Number of Graphs Embeddable in Any Orientable
Surface},
booktitle = {{SODA}},
pages = {918--927},
publisher = {{SIAM}},
year = {2010}
}
@inproceedings{DBLP:conf/sofsem/GanianH10,
author = {Robert Ganian and
Petr Hlinen{\'{y}}},
title = {New Results on the Complexity of Oriented Colouring on Restricted
Digraph Classes},
booktitle = {{SOFSEM}},
series = {Lecture Notes in Computer Science},
volume = {5901},
pages = {428--439},
publisher = {Springer},
year = {2010}
}
@proceedings{DBLP:conf/mfcs/2010,
editor = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Mathematical Foundations of Computer Science 2010, 35th International
Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6281},
publisher = {Springer},
year = {2010}
}
@article{DBLP:journals/corr/abs-1004-1485,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Joachim Kneis and
Daniel Meister and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
title = {Are there any good digraph width measures?},
journal = {CoRR},
volume = {abs/1004.1485},
year = {2010}
}
@article{DBLP:journals/corr/abs-1006-5621,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek},
title = {Better algorithms for satisfiability problems for formulas of bounded
rank-width},
journal = {CoRR},
volume = {abs/1006.5621},
year = {2010}
}
@article{DBLP:journals/ejc/HlinenyW09,
author = {Petr Hlinen{\'{y}} and
Geoff Whittle},
title = {Addendum to matroid tree-width},
journal = {Eur. J. Comb.},
volume = {30},
number = {4},
pages = {1036--1044},
year = {2009}
}
@inproceedings{DBLP:conf/iwoca/GanianH09,
author = {Robert Ganian and
Petr Hlinen{\'{y}}},
title = {Better Polynomial Algorithms on Graphs of Bounded Rank-Width},
booktitle = {{IWOCA}},
series = {Lecture Notes in Computer Science},
volume = {5874},
pages = {266--277},
publisher = {Springer},
year = {2009}
}
@inproceedings{DBLP:conf/iwpec/GanianHKLOR09,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Joachim Kneis and
Alexander Langer and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith},
title = {On Digraph Width Measures in Parameterized Algorithmics},
booktitle = {{IWPEC}},
series = {Lecture Notes in Computer Science},
volume = {5917},
pages = {185--197},
publisher = {Springer},
year = {2009}
}
@inproceedings{DBLP:conf/memics/HlinenyMV09,
author = {Petr Hlinen{\'{y}} and
V{\'{a}}clav Maty{\'{a}}s and
Tom{\'{a}}s Vojnar},
title = {Preface -- Annual Doctoral Workshop on Mathematical and Engineering
Methods in Computer Science (MEMICS'09)},
booktitle = {{MEMICS}},
series = {OASIcs},
volume = {13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
year = {2009}
}
@proceedings{DBLP:conf/memics/2009,
editor = {Petr Hlinen{\'{y}} and
V{\'{a}}clav Maty{\'{a}}s and
Tom{\'{a}}s Vojnar},
title = {Annual Doctoral Workshop on Mathematical and Engineering Methods in
Computer Science, {MEMICS} 2009, November 13-15, 2009, Prestige Hotel,
Znojmo, Czech Republic},
series = {OASIcs},
volume = {13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
year = {2009}
}
@article{DBLP:journals/cj/HlinenyOSG08,
author = {Petr Hlinen{\'{y}} and
Sang{-}il Oum and
Detlef Seese and
Georg Gottlob},
title = {Width Parameters Beyond Tree-width and their Applications},
journal = {Comput. J.},
volume = {51},
number = {3},
pages = {326--362},
year = {2008}
}
@article{DBLP:journals/combinatorics/GitlerHLS08,
author = {Isidoro Gitler and
Petr Hlinen{\'{y}} and
Jes{\'{u}}s Lea{\~{n}}os and
Gelasio Salazar},
title = {The Crossing Number of a Projective Graph is Quadratic in the Face-Width},
journal = {Electron. J. Comb.},
volume = {15},
number = {1},
year = {2008}
}
@article{DBLP:journals/combinatorics/Hlineny08,
author = {Petr Hlinen{\'{y}}},
title = {New Infinite Families of Almost-Planar Crossing-Critical Graphs},
journal = {Electron. J. Comb.},
volume = {15},
number = {1},
year = {2008}
}
@article{DBLP:journals/endm/HlinenyS08,
author = {Petr Hlinen{\'{y}} and
Gelasio Salazar},
title = {Stars and Bonds in Crossing-Critical Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {31},
pages = {271--275},
year = {2008}
}
@article{DBLP:journals/siamcomp/HlinenyO08,
author = {Petr Hlinen{\'{y}} and
Sang{-}il Oum},
title = {Finding Branch-Decompositions and Rank-Decompositions},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {3},
pages = {1012--1032},
year = {2008}
}
@inproceedings{DBLP:conf/gd/ChimaniHM08,
author = {Markus Chimani and
Petr Hlinen{\'{y}} and
Petra Mutzel},
title = {Approximating the Crossing Number of Apex Graphs},
booktitle = {{GD}},
series = {Lecture Notes in Computer Science},
volume = {5417},
pages = {432--434},
publisher = {Springer},
year = {2008}
}
@inproceedings{DBLP:conf/iwoca/HlinenyG08,
author = {Petr Hlinen{\'{y}} and
Robert Ganian},
title = {Automata approach to graphs of bounded rank-width},
booktitle = {{IWOCA}},
pages = {4--15},
publisher = {College Publications},
year = {2008}
}
@article{DBLP:journals/endm/HlinenyKNS07,
author = {Petr Hlinen{\'{y}} and
Jan Kratochv{\'{\i}}l and
Roman Nedela and
Martin Skoviera},
title = {Preface},
journal = {Electron. Notes Discret. Math.},
volume = {28},
pages = {1},
year = {2007}
}
@article{DBLP:journals/endm/GitlerHLS07,
author = {Isidoro Gitler and
Petr Hlinen{\'{y}} and
Jes{\'{u}}s Lea{\~{n}}os and
Gelasio Salazar},
title = {The crossing number of a projective graph is quadratic in the face-width},
journal = {Electron. Notes Discret. Math.},
volume = {29},
pages = {219--223},
year = {2007}
}
@article{DBLP:journals/mst/Hlineny07,
author = {Petr Hlinen{\'{y}}},
title = {Some Hard Problems on Matroid Spikes},
journal = {Theory Comput. Syst.},
volume = {41},
number = {3},
pages = {551--562},
year = {2007}
}
@inproceedings{DBLP:conf/esa/HlinenyO07,
author = {Petr Hlinen{\'{y}} and
Sang{-}il Oum},
title = {Finding Branch-Decompositions and Rank-Decompositions},
booktitle = {{ESA}},
series = {Lecture Notes in Computer Science},
volume = {4698},
pages = {163--174},
publisher = {Springer},
year = {2007}
}
@inproceedings{DBLP:conf/isaac/HlinenyS07,
author = {Petr Hlinen{\'{y}} and
Gelasio Salazar},
title = {Approximating the Crossing Number of Toroidal Graphs},
booktitle = {{ISAAC}},
series = {Lecture Notes in Computer Science},
volume = {4835},
pages = {148--159},
publisher = {Springer},
year = {2007}
}
@article{DBLP:journals/cpc/Hlineny06,
author = {Petr Hlinen{\'{y}}},
title = {The Tutte Polynomial for Matroids of Bounded Branch-Width},
journal = {Comb. Probab. Comput.},
volume = {15},
number = {3},
pages = {397--409},
year = {2006}
}
@article{DBLP:journals/cpc/GoddynHH06,
author = {Luis A. Goddyn and
Petr Hlinen{\'{y}} and
Winfried Hochst{\"{a}}ttler},
title = {Balanced Signings and the Chromatic Number of Oriented Matroids},
journal = {Comb. Probab. Comput.},
volume = {15},
number = {4},
pages = {523--539},
year = {2006}
}
@article{DBLP:journals/dam/Hlineny06,
author = {Petr Hlinen{\'{y}}},
title = {Equivalence-free exhaustive generation of matroid representations},
journal = {Discret. Appl. Math.},
volume = {154},
number = {8},
pages = {1210--1222},
year = {2006}
}
@article{DBLP:journals/ejc/HlinenyW06,
author = {Petr Hlinen{\'{y}} and
Geoff Whittle},
title = {Matroid tree-width},
journal = {Eur. J. Comb.},
volume = {27},
number = {7},
pages = {1117--1128},
year = {2006}
}
@article{DBLP:journals/jct/Hlineny06,
author = {Petr Hlinen{\'{y}}},
title = {Branch-width, parse trees, and monadic second-order logic for matroids},
journal = {J. Comb. Theory {B}},
volume = {96},
number = {3},
pages = {325--351},
year = {2006}
}
@article{DBLP:journals/jct/Hlineny06a,
author = {Petr Hlinen{\'{y}}},
title = {Crossing number is hard for cubic graphs},
journal = {J. Comb. Theory {B}},
volume = {96},
number = {4},
pages = {455--471},
year = {2006}
}
@article{DBLP:journals/siamdm/GimenezHN06,
author = {Omer Gim{\'{e}}nez and
Petr Hlinen{\'{y}} and
Marc Noy},
title = {Computing the Tutte Polynomial on Graphs of Bounded Clique-Width},
journal = {{SIAM} J. Discret. Math.},
volume = {20},
number = {4},
pages = {932--946},
year = {2006}
}
@article{DBLP:journals/tcs/HlinenyS06,
author = {Petr Hlinen{\'{y}} and
Detlef Seese},
title = {Trees, grids, and {MSO} decidability: From graphs to matroids},
journal = {Theor. Comput. Sci.},
volume = {351},
number = {3},
pages = {372--393},
year = {2006}
}
@inproceedings{DBLP:conf/gd/HlinenyS06,
author = {Petr Hlinen{\'{y}} and
Gelasio Salazar},
title = {On the Crossing Number of Almost Planar Graphs},
booktitle = {{GD}},
series = {Lecture Notes in Computer Science},
volume = {4372},
pages = {162--173},
publisher = {Springer},
year = {2006}
}
@inproceedings{DBLP:conf/mfcs/Hlineny06,
author = {Petr Hlinen{\'{y}}},
title = {On Matroid Representability and Minor Problems},
booktitle = {{MFCS}},
series = {Lecture Notes in Computer Science},
volume = {4162},
pages = {505--516},
publisher = {Springer},
year = {2006}
}
@article{DBLP:journals/siamcomp/Hlineny05,
author = {Petr Hlinen{\'{y}}},
title = {A Parametrized Algorithm for Matroid Branch-Width},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {2},
pages = {259--277},
year = {2005}
}
@inproceedings{DBLP:conf/wg/GimenezHN05,
author = {Omer Gim{\'{e}}nez and
Petr Hlinen{\'{y}} and
Marc Noy},
title = {Computing the Tutte Polynomial on Graphs of Bounded Clique-Width},
booktitle = {{WG}},
series = {Lecture Notes in Computer Science},
volume = {3787},
pages = {59--68},
publisher = {Springer},
year = {2005}
}
@article{DBLP:journals/jgt/HlinenyT04,
author = {Petr Hlinen{\'{y}} and
Robin Thomas},
title = {On possible counterexamples to Negami's planar cover conjecture},
journal = {J. Graph Theory},
volume = {46},
number = {3},
pages = {183--206},
year = {2004}
}
@article{DBLP:journals/siamdm/GeelenHW04,
author = {James F. Geelen and
Petr Hlinen{\'{y}} and
Geoffrey P. Whittle},
title = {Bridging Separations in Matroids},
journal = {{SIAM} J. Discret. Math.},
volume = {18},
number = {3},
pages = {638--646},
year = {2004}
}
@inproceedings{DBLP:conf/iwpec/HlinenyS04,
author = {Petr Hlinen{\'{y}} and
Detlef Seese},
title = {On Decidability of {MSO} Theories of Representable Matroids},
booktitle = {{IWPEC}},
series = {Lecture Notes in Computer Science},
volume = {3162},
pages = {96--107},
publisher = {Springer},
year = {2004}
}
@inproceedings{DBLP:conf/mfcs/Hlineny04,
author = {Petr Hlinen{\'{y}}},
title = {Crossing Number Is Hard for Cubic Graphs},
booktitle = {{MFCS}},
series = {Lecture Notes in Computer Science},
volume = {3153},
pages = {772--782},
publisher = {Springer},
year = {2004}
}
@article{DBLP:journals/jct/Hlineny03,
author = {Petr Hlinen{\'{y}}},
title = {Crossing-number critical graphs have bounded path-width},
journal = {J. Comb. Theory {B}},
volume = {88},
number = {2},
pages = {347--367},
year = {2003}
}
@inproceedings{DBLP:conf/mfcs/Hlineny03,
author = {Petr Hlinen{\'{y}}},
title = {On Matroid Properties Definable in the {MSO} Logic},
booktitle = {{MFCS}},
series = {Lecture Notes in Computer Science},
volume = {2747},
pages = {470--479},
publisher = {Springer},
year = {2003}
}
@inproceedings{DBLP:conf/stacs/Hlineny03,
author = {Petr Hlinen{\'{y}}},
title = {Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids},
booktitle = {{STACS}},
series = {Lecture Notes in Computer Science},
volume = {2607},
pages = {319--330},
publisher = {Springer},
year = {2003}
}
@article{DBLP:journals/combinatorics/Hlineny02,
author = {Petr Hlinen{\'{y}}},
title = {On the Excluded Minors for Matroids of Branch-Width Three},
journal = {Electron. J. Comb.},
volume = {9},
number = {1},
year = {2002}
}
@article{DBLP:journals/dcg/Hlineny01,
author = {Petr Hlinen{\'{y}}},
title = {An Addition to Art Galleries with Interior Walls},
journal = {Discret. Comput. Geom.},
volume = {25},
number = {2},
pages = {311--334},
year = {2001}
}
@article{DBLP:journals/dm/HlinenyK01,
author = {Petr Hlinen{\'{y}} and
Jan Kratochv{\'{\i}}l},
title = {Representing graphs by disks and balls (a survey of recognition-complexity
results)},
journal = {Discret. Math.},
volume = {229},
number = {1-3},
pages = {101--124},
year = {2001}
}
@article{DBLP:journals/dm/Hlineny01,
author = {Petr Hlinen{\'{y}}},
title = {Contact graphs of line segments are NP-complete},
journal = {Discret. Math.},
volume = {235},
number = {1-3},
pages = {95--106},
year = {2001}
}
@article{DBLP:journals/jgt/Hlineny01,
author = {Petr Hlinen{\'{y}}},
title = {Another two graphs with no planar covers},
journal = {J. Graph Theory},
volume = {37},
number = {4},
pages = {227--242},
year = {2001}
}
@inproceedings{DBLP:conf/gd/Hlineny01,
author = {Petr Hlinen{\'{y}}},
title = {Crossing-Critical Graphs and Path-Width},
booktitle = {{GD}},
series = {Lecture Notes in Computer Science},
volume = {2265},
pages = {102--114},
publisher = {Springer},
year = {2001}
}
@article{DBLP:journals/jgt/Hlineny99,
author = {Petr Hlinen{\'{y}}},
title = {A note on possible extensions of Negami's conjecture},
journal = {J. Graph Theory},
volume = {32},
number = {3},
pages = {234--240},
year = {1999}
}
@article{DBLP:journals/dam/Hlincny98,
author = {Petr Hlinen{\'{y}}},
title = {The Maximal Clique and Colourability of Curve Contact Graphs},
journal = {Discret. Appl. Math.},
volume = {81},
number = {1-3},
pages = {59--68},
year = {1998}
}
@article{DBLP:journals/jct/Hlineny98,
author = {Petr Hlinen{\'{y}}},
title = {Classes and Recognition of Curve Contact Graphs\({}^{\mbox{, }}\)},
journal = {J. Comb. Theory {B}},
volume = {74},
number = {1},
pages = {87--103},
year = {1998}
}
@inproceedings{DBLP:conf/gd/Hlineny97,
author = {Petr Hlinen{\'{y}}},
title = {Touching Graphs of Unit Balls},
booktitle = {{GD}},
series = {Lecture Notes in Computer Science},
volume = {1353},
pages = {350--358},
publisher = {Springer},
year = {1997}
}
@inproceedings{DBLP:conf/wg/HlinenyK97,
author = {Petr Hlinen{\'{y}} and
Jan Kratochv{\'{\i}}l},
title = {Computational Complexity of the Krausz Dimension of Graphs},
booktitle = {{WG}},
series = {Lecture Notes in Computer Science},
volume = {1335},
pages = {214--228},
publisher = {Springer},
year = {1997}
}
@inproceedings{DBLP:conf/gd/Hlineny95,
author = {Petr Hlinen{\'{y}}},
title = {Contact Graphs of Curves},
booktitle = {{GD}},
series = {Lecture Notes in Computer Science},
volume = {1027},
pages = {312--323},
publisher = {Springer},
year = {1995}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-08-27 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
