BibTeX records: Petr Hlinený

download as .bib file

@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},
  url          = {https://doi.org/10.1016/j.ejc.2023.103820},
  doi          = {10.1016/J.EJC.2023.103820},
  timestamp    = {Fri, 16 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/CagiriciHR24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.48550/arXiv.2401.11610},
  doi          = {10.48550/ARXIV.2401.11610},
  eprinttype    = {arXiv},
  eprint       = {2401.11610},
  timestamp    = {Wed, 07 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2401-11610.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1007/s00453-022-01033-8},
  doi          = {10.1007/S00453-022-01033-8},
  timestamp    = {Fri, 10 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CagiriciH23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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, Ser. {B}},
  volume       = {158},
  number       = {Part},
  pages        = {43--73},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.jctb.2021.09.001},
  doi          = {10.1016/J.JCTB.2021.09.001},
  timestamp    = {Sun, 15 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jctb/CagiriciHPS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.7155/jgaa.00631},
  doi          = {10.7155/JGAA.00631},
  timestamp    = {Wed, 13 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/ChimaniH23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/HlinenyM23,
  author       = {Petr Hlinen{\'{y}} and
                  Tom{\'{a}}s Masar{\'{\i}}k},
  editor       = {Michael A. Bekos and
                  Markus Chimani},
  title        = {Minimizing an Uncrossed Collection of Drawings},
  booktitle    = {Graph Drawing and Network Visualization - 31st International Symposium,
                  {GD} 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023,
                  Revised Selected Papers, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {14465},
  pages        = {110--123},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-49272-3\_8},
  doi          = {10.1007/978-3-031-49272-3\_8},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/HlinenyM23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HlinenyJ23,
  author       = {Petr Hlinen{\'{y}} and
                  Jan Jedelsk{\'{y}}},
  editor       = {Kousha Etessami and
                  Uriel Feige and
                  Gabriele Puppis},
  title        = {Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite
                  Planar},
  booktitle    = {50th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
  series       = {LIPIcs},
  volume       = {261},
  pages        = {75:1--75:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2023.75},
  doi          = {10.4230/LIPICS.ICALP.2023.75},
  timestamp    = {Wed, 05 Jul 2023 16:19:52 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/HlinenyJ23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  editor       = {Satoru Iwata and
                  Naonori Kakimura},
  title        = {Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width},
  booktitle    = {34th International Symposium on Algorithms and Computation, {ISAAC}
                  2023, December 3-6, 2023, Kyoto, Japan},
  series       = {LIPIcs},
  volume       = {283},
  pages        = {11:1--11:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.11},
  doi          = {10.4230/LIPICS.ISAAC.2023.11},
  timestamp    = {Tue, 28 Nov 2023 13:12:50 +0100},
  biburl       = {https://dblp.org/rec/conf/isaac/BergougnouxGGHP23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  editor       = {J{\'{e}}r{\^{o}}me Leroux and
                  Sylvain Lombardy and
                  David Peleg},
  title        = {Recognizing H-Graphs - Beyond Circular-Arc Graphs},
  booktitle    = {48th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
  series       = {LIPIcs},
  volume       = {272},
  pages        = {8:1--8:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2023.8},
  doi          = {10.4230/LIPICS.MFCS.2023.8},
  timestamp    = {Mon, 04 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/mfcs/CagiriciCDHHKK023.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.48550/arXiv.2303.10116},
  doi          = {10.48550/ARXIV.2303.10116},
  eprinttype    = {arXiv},
  eprint       = {2303.10116},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2303-10116.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.48550/arXiv.2306.03490},
  doi          = {10.48550/ARXIV.2306.03490},
  eprinttype    = {arXiv},
  eprint       = {2306.03490},
  timestamp    = {Tue, 13 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2306-03490.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.48550/arXiv.2306.09550},
  doi          = {10.48550/ARXIV.2306.09550},
  eprinttype    = {arXiv},
  eprint       = {2306.09550},
  timestamp    = {Thu, 22 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2306-09550.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.48550/arXiv.2307.01732},
  doi          = {10.48550/ARXIV.2307.01732},
  eprinttype    = {arXiv},
  eprint       = {2307.01732},
  timestamp    = {Thu, 31 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2307-01732.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1007/s00493-021-4285-3},
  doi          = {10.1007/S00493-021-4285-3},
  timestamp    = {Fri, 01 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/combinatorica/BokalDHLMW22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/HammH22,
  author       = {Thekla Hamm and
                  Petr Hlinen{\'{y}}},
  editor       = {Xavier Goaoc and
                  Michael Kerber},
  title        = {Parameterised Partially-Predrawn Crossing Number},
  booktitle    = {38th International Symposium on Computational Geometry, SoCG 2022,
                  June 7-10, 2022, Berlin, Germany},
  series       = {LIPIcs},
  volume       = {224},
  pages        = {46:1--46:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2022.46},
  doi          = {10.4230/LIPICS.SOCG.2022.46},
  timestamp    = {Wed, 01 Jun 2022 16:45:26 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/HammH22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BekosLH022,
  author       = {Michael A. Bekos and
                  Giordano Da Lozzo and
                  Petr Hlinen{\'{y}} and
                  Michael Kaufmann},
  editor       = {Sang Won Bae and
                  Heejin Park},
  title        = {Graph Product Structure for h-Framed Graphs},
  booktitle    = {33rd International Symposium on Algorithms and Computation, {ISAAC}
                  2022, December 19-21, 2022, Seoul, Korea},
  series       = {LIPIcs},
  volume       = {248},
  pages        = {23:1--23:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.23},
  doi          = {10.4230/LIPICS.ISAAC.2022.23},
  timestamp    = {Wed, 14 Dec 2022 11:53:14 +0100},
  biburl       = {https://dblp.org/rec/conf/isaac/BekosLH022.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/CagiriciH22,
  author       = {Deniz Agaoglu {\c{C}}agirici and
                  Petr Hlinen{\'{y}}},
  editor       = {Petra Mutzel and
                  Md. Saidur Rahman and
                  Slamin},
  title        = {Isomorphism Testing for T-graphs in {FPT}},
  booktitle    = {{WALCOM:} Algorithms and Computation - 16th International Conference
                  and Workshops, {WALCOM} 2022, Jember, Indonesia, March 24-26, 2022,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13174},
  pages        = {239--250},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-030-96731-4\_20},
  doi          = {10.1007/978-3-030-96731-4\_20},
  timestamp    = {Fri, 01 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/walcom/CagiriciH22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BalabanHJ22,
  author       = {Jakub Balab{\'{a}}n and
                  Petr Hlinen{\'{y}} and
                  Jan Jedelsk{\'{y}}},
  editor       = {Michael A. Bekos and
                  Michael Kaufmann},
  title        = {Twin-Width and Transductions of Proper k-Mixed-Thin Graphs},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 48th International
                  Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022,
                  Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {13453},
  pages        = {43--55},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-15914-5\_4},
  doi          = {10.1007/978-3-031-15914-5\_4},
  timestamp    = {Mon, 05 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wg/BalabanHJ22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://arxiv.org/abs/2202.12536},
  eprinttype    = {arXiv},
  eprint       = {2202.12536},
  timestamp    = {Thu, 03 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2202-12536.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://arxiv.org/abs/2202.12664},
  eprinttype    = {arXiv},
  eprint       = {2202.12664},
  timestamp    = {Wed, 02 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2202-12664.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://arxiv.org/abs/2202.13635},
  eprinttype    = {arXiv},
  eprint       = {2202.13635},
  timestamp    = {Thu, 03 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2202-13635.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.48550/arXiv.2204.11495},
  doi          = {10.48550/ARXIV.2204.11495},
  eprinttype    = {arXiv},
  eprint       = {2204.11495},
  timestamp    = {Thu, 28 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2204-11495.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.48550/arXiv.2204.13742},
  doi          = {10.48550/ARXIV.2204.13742},
  eprinttype    = {arXiv},
  eprint       = {2204.13742},
  timestamp    = {Mon, 02 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2204-13742.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.48550/arXiv.2210.08620},
  doi          = {10.48550/ARXIV.2210.08620},
  eprinttype    = {arXiv},
  eprint       = {2210.08620},
  timestamp    = {Wed, 19 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2210-08620.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.48550/arXiv.2212.05433},
  doi          = {10.48550/ARXIV.2212.05433},
  eprinttype    = {arXiv},
  eprint       = {2212.05433},
  timestamp    = {Mon, 04 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2212-05433.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BalabanH21,
  author       = {Jakub Balab{\'{a}}n and
                  Petr Hlinen{\'{y}}},
  editor       = {Petr A. Golovach and
                  Meirav Zehavi},
  title        = {Twin-Width Is Linear in the Poset Width},
  booktitle    = {16th International Symposium on Parameterized and Exact Computation,
                  {IPEC} 2021, September 8-10, 2021, Lisbon, Portugal},
  series       = {LIPIcs},
  volume       = {214},
  pages        = {6:1--6:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.IPEC.2021.6},
  doi          = {10.4230/LIPICS.IPEC.2021.6},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/BalabanH21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  editor       = {Filippo Bonchi and
                  Simon J. Puglisi},
  title        = {Computational Complexity of Covering Multigraphs with Semi-Edges:
                  Small Cases},
  booktitle    = {46th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
  series       = {LIPIcs},
  volume       = {202},
  pages        = {21:1--21:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2021.21},
  doi          = {10.4230/LIPICS.MFCS.2021.21},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/mfcs/Bok0HJK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://arxiv.org/abs/2103.15214},
  eprinttype    = {arXiv},
  eprint       = {2103.15214},
  timestamp    = {Wed, 07 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2103-15214.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://arxiv.org/abs/2106.15337},
  eprinttype    = {arXiv},
  eprint       = {2106.15337},
  timestamp    = {Mon, 05 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2106-15337.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://arxiv.org/abs/2111.10910},
  eprinttype    = {arXiv},
  eprint       = {2111.10910},
  timestamp    = {Fri, 26 Nov 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2111-10910.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.jctb.2019.05.009},
  doi          = {10.1016/J.JCTB.2019.05.009},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/ChimaniHS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1145/3383206},
  doi          = {10.1145/3383206},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tocl/GajarskyHOLR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AgaogluH20,
  author       = {Deniz Agaoglu and
                  Petr Hlinen{\'{y}}},
  editor       = {Javier Esparza and
                  Daniel Kr{\'{a}}l'},
  title        = {Isomorphism Problem for S{\_}d-Graphs},
  booktitle    = {45th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
  series       = {LIPIcs},
  volume       = {170},
  pages        = {4:1--4:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2020.4},
  doi          = {10.4230/LIPICS.MFCS.2020.4},
  timestamp    = {Mon, 21 Dec 2020 13:23:22 +0100},
  biburl       = {https://dblp.org/rec/conf/mfcs/AgaogluH20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CagiriciHPS20,
  author       = {Onur {\c{C}}agirici and
                  Petr Hlinen{\'{y}} and
                  Filip Pokr{\'{y}}vka and
                  Abhisekh Sankaran},
  editor       = {Isolde Adler and
                  Haiko M{\"{u}}ller},
  title        = {Clique-Width of Point Configurations},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 46th International
                  Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {12301},
  pages        = {54--66},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-60440-0\_5},
  doi          = {10.1007/978-3-030-60440-0\_5},
  timestamp    = {Sat, 14 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wg/CagiriciHPS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://arxiv.org/abs/2004.02282},
  eprinttype    = {arXiv},
  eprint       = {2004.02282},
  timestamp    = {Wed, 08 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2004-02282.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.37236/7753},
  doi          = {10.37236/7753},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/BokalBDH19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.comgeo.2018.10.001},
  doi          = {10.1016/J.COMGEO.2018.10.001},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/comgeo/HlinenyPR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.jcss.2018.06.002},
  doi          = {10.1016/J.JCSS.2018.06.002},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/GajarskyHKO19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.23638/LMCS-15(1:7)2019},
  doi          = {10.23638/LMCS-15(1:7)2019},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/lmcs/GanianHNOM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/CagiriciGHR19,
  author       = {Onur {\c{C}}agirici and
                  Subir Kumar Ghosh and
                  Petr Hlinen{\'{y}} and
                  Bodhayan Roy},
  editor       = {Yingshu Li and
                  Mihaela Cardei and
                  Yan Huang},
  title        = {On Conflict-Free Chromatic Guarding of Simple Polygons},
  booktitle    = {Combinatorial Optimization and Applications - 13th International Conference,
                  {COCOA} 2019, Xiamen, China, December 13-15, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11949},
  pages        = {601--612},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-36412-0\_49},
  doi          = {10.1007/978-3-030-36412-0\_49},
  timestamp    = {Thu, 19 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cocoa/CagiriciGHR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  editor       = {Gill Barequet and
                  Yusu Wang},
  title        = {Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical
                  Graphs with c {\textless}= 12},
  booktitle    = {35th International Symposium on Computational Geometry, SoCG 2019,
                  June 18-21, 2019, Portland, Oregon, {USA}},
  series       = {LIPIcs},
  volume       = {129},
  pages        = {14:1--14:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2019.14},
  doi          = {10.4230/LIPICS.SOCG.2019.14},
  timestamp    = {Fri, 01 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/compgeom/BokalDHLMW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/HlinenyS19,
  author       = {Petr Hlinen{\'{y}} and
                  Abhisekh Sankaran},
  editor       = {Daniel Archambault and
                  Csaba D. T{\'{o}}th},
  title        = {Exact Crossing Number Parameterized by Vertex Cover},
  booktitle    = {Graph Drawing and Network Visualization - 27th International Symposium,
                  {GD} 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11904},
  pages        = {307--319},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-35802-0\_24},
  doi          = {10.1007/978-3-030-35802-0\_24},
  timestamp    = {Sun, 13 Nov 2022 09:57:24 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/HlinenyS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1903.05363},
  eprinttype    = {arXiv},
  eprint       = {1903.05363},
  timestamp    = {Fri, 01 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1903-05363.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1904.08624},
  eprinttype    = {arXiv},
  eprint       = {1904.08624},
  timestamp    = {Fri, 26 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-08624.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1906.01904},
  eprinttype    = {arXiv},
  eprint       = {1906.01904},
  timestamp    = {Fri, 14 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1906-01904.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1906.06048},
  eprinttype    = {arXiv},
  eprint       = {1906.06048},
  timestamp    = {Mon, 24 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1906-06048.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.dam.2017.04.042},
  doi          = {10.1016/J.DAM.2017.04.042},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GajarskyHT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1137/17M1120129},
  doi          = {10.1137/17M1120129},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Hlineny18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1137/17M1137231},
  doi          = {10.1137/17M1137231},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/HlinenyT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/DvorakHM18,
  author       = {Zdenek Dvor{\'{a}}k and
                  Petr Hlinen{\'{y}} and
                  Bojan Mohar},
  editor       = {Bettina Speckmann and
                  Csaba D. T{\'{o}}th},
  title        = {Structure and Generation of Crossing-Critical Graphs},
  booktitle    = {34th International Symposium on Computational Geometry, SoCG 2018,
                  June 11-14, 2018, Budapest, Hungary},
  series       = {LIPIcs},
  volume       = {99},
  pages        = {33:1--33:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2018.33},
  doi          = {10.4230/LIPICS.SOCG.2018.33},
  timestamp    = {Fri, 01 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/compgeom/DvorakHM18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1803.01931},
  eprinttype    = {arXiv},
  eprint       = {1803.01931},
  timestamp    = {Fri, 01 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1803-01931.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1805.01823},
  eprinttype    = {arXiv},
  eprint       = {1805.01823},
  timestamp    = {Tue, 03 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1805-01823.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1007/s10878-016-0030-z},
  doi          = {10.1007/S10878-016-0030-Z},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jco/ChimaniH17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.jcss.2016.09.002},
  doi          = {10.1016/J.JCSS.2016.09.002},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/GajarskyHOORRVS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1002/rsa.20676},
  doi          = {10.1002/RSA.20676},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/GajarskyHKKKOOT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/GajarskyHKO17,
  author       = {Jakub Gajarsk{\'{y}} and
                  Petr Hlinen{\'{y}} and
                  Martin Kouteck{\'{y}} and
                  Shmuel Onn},
  editor       = {Yixin Cao and
                  Jianer Chen},
  title        = {Parameterized Shifted Combinatorial Optimization},
  booktitle    = {Computing and Combinatorics - 23rd International Conference, {COCOON}
                  2017, Hong Kong, China, August 3-5, 2017, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10392},
  pages        = {224--236},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-62389-4\_19},
  doi          = {10.1007/978-3-319-62389-4\_19},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/GajarskyHKO17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/CagiriciHR17,
  author       = {Onur Cagirici and
                  Petr Hlinen{\'{y}} and
                  Bodhayan Roy},
  editor       = {Satya V. Lokam and
                  R. Ramanujam},
  title        = {On Colourability of Polygon Visibility Graphs},
  booktitle    = {37th {IARCS} Annual Conference on Foundations of Software Technology
                  and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
                  Kanpur, India},
  series       = {LIPIcs},
  volume       = {93},
  pages        = {21:1--21:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.21},
  doi          = {10.4230/LIPICS.FSTTCS.2017.21},
  timestamp    = {Fri, 03 Sep 2021 15:00:19 +0200},
  biburl       = {https://dblp.org/rec/conf/fsttcs/CagiriciHR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HlinenyPR17,
  author       = {Petr Hlinen{\'{y}} and
                  Filip Pokr{\'{y}}vka and
                  Bodhayan Roy},
  editor       = {Daniel Lokshtanov and
                  Naomi Nishimura},
  title        = {{FO} Model Checking of Geometric Graphs},
  booktitle    = {12th International Symposium on Parameterized and Exact Computation,
                  {IPEC} 2017, September 6-8, 2017, Vienna, Austria},
  series       = {LIPIcs},
  volume       = {89},
  pages        = {19:1--19:12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.IPEC.2017.19},
  doi          = {10.4230/LIPICS.IPEC.2017.19},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/HlinenyPR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1702.06844},
  eprinttype    = {arXiv},
  eprint       = {1702.06844},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/GajarskyHKO17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1707.00359},
  eprinttype    = {arXiv},
  eprint       = {1707.00359},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/GanianHNOM17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1709.03701},
  eprinttype    = {arXiv},
  eprint       = {1709.03701},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1709-03701.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.ejc.2016.03.001},
  doi          = {10.1016/J.EJC.2016.03.001},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejc/HlinenyKOO16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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, Ser. {B}},
  volume       = {116},
  pages        = {250--286},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.jctb.2015.09.001},
  doi          = {10.1016/J.JCTB.2015.09.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/GanianHK0ORS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ChimaniH16,
  author       = {Markus Chimani and
                  Petr Hlinen{\'{y}}},
  editor       = {S{\'{a}}ndor P. Fekete and
                  Anna Lubiw},
  title        = {Inserting Multiple Edges into a Planar Graph},
  booktitle    = {32nd International Symposium on Computational Geometry, SoCG 2016,
                  June 14-18, 2016, Boston, MA, {USA}},
  series       = {LIPIcs},
  volume       = {51},
  pages        = {30:1--30:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2016.30},
  doi          = {10.4230/LIPICS.SOCG.2016.30},
  timestamp    = {Wed, 16 Jun 2021 12:03:34 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/ChimaniH16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/HlinenyD16,
  author       = {Petr Hlinen{\'{y}} and
                  Marek Dern{\'{a}}r},
  editor       = {S{\'{a}}ndor P. Fekete and
                  Anna Lubiw},
  title        = {Crossing Number is Hard for Kernelization},
  booktitle    = {32nd International Symposium on Computational Geometry, SoCG 2016,
                  June 14-18, 2016, Boston, MA, {USA}},
  series       = {LIPIcs},
  volume       = {51},
  pages        = {42:1--42:10},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2016.42},
  doi          = {10.4230/LIPICS.SOCG.2016.42},
  timestamp    = {Wed, 16 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/HlinenyD16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  editor       = {Martin Grohe and
                  Eric Koskinen and
                  Natarajan Shankar},
  title        = {A New Perspective on {FO} Model Checking of Dense Graph Classes},
  booktitle    = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer
                  Science, {LICS} '16, New York, NY, USA, July 5-8, 2016},
  pages        = {176--184},
  publisher    = {{ACM}},
  year         = {2016},
  url          = {https://doi.org/10.1145/2933575.2935314},
  doi          = {10.1145/2933575.2935314},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/lics/GajarskyHOLR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1605.09520},
  eprinttype    = {arXiv},
  eprint       = {1605.09520},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Hlineny16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.2168/LMCS-11(1:19)2015},
  doi          = {10.2168/LMCS-11(1:19)2015},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1204-5194.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.2168/LMCS-11(4:8)2015},
  doi          = {10.2168/LMCS-11(4:8)2015},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/GajarskyHOO14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.2168/LMCS-11(4:11)2015},
  doi          = {10.2168/LMCS-11(4:11)2015},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1302-6043.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.ejc.2015.02.009},
  doi          = {10.1016/J.EJC.2015.02.009},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/DerkaH15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  editor       = {Venkatesan Guruswami},
  title        = {{FO} Model Checking on Posets of Bounded Width},
  booktitle    = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
                  2015, Berkeley, CA, USA, 17-20 October, 2015},
  pages        = {963--974},
  publisher    = {{IEEE} Computer Society},
  year         = {2015},
  url          = {https://doi.org/10.1109/FOCS.2015.63},
  doi          = {10.1109/FOCS.2015.63},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/GajarskyHLOORS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BokalBDH15,
  author       = {Drago Bokal and
                  Mojca Bracic and
                  Marek Dern{\'{a}}r and
                  Petr Hlinen{\'{y}}},
  editor       = {Emilio Di Giacomo and
                  Anna Lubiw},
  title        = {On Degree Properties of Crossing-Critical Families of Graphs},
  booktitle    = {Graph Drawing and Network Visualization - 23rd International Symposium,
                  {GD} 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {9411},
  pages        = {75--86},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-27261-0\_7},
  doi          = {10.1007/978-3-319-27261-0\_7},
  timestamp    = {Sun, 13 Nov 2022 09:57:26 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/BokalBDH15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HlinenyS15,
  author       = {Petr Hlinen{\'{y}} and
                  Gelasio Salazar},
  editor       = {Khaled M. Elbassioni and
                  Kazuhisa Makino},
  title        = {On Hardness of the Joint Crossing Number},
  booktitle    = {Algorithms and Computation - 26th International Symposium, {ISAAC}
                  2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9472},
  pages        = {603--613},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-48971-0\_51},
  doi          = {10.1007/978-3-662-48971-0\_51},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/HlinenyS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/memics/HlinenyS15,
  author       = {Petr Hlinen{\'{y}} and
                  Ondrej Sl{\'{a}}mecka},
  editor       = {Jan Kofron and
                  Tom{\'{a}}s Vojnar},
  title        = {Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs},
  booktitle    = {Mathematical and Engineering Methods in Computer Science - 10th International
                  Doctoral Workshop, {MEMICS} 2015, Tel{\v{c}}, Czech Republic, October
                  23-25, 2015, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {9548},
  pages        = {54--66},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-29817-7\_6},
  doi          = {10.1007/978-3-319-29817-7\_6},
  timestamp    = {Sun, 02 Oct 2022 16:11:36 +0200},
  biburl       = {https://dblp.org/rec/conf/memics/HlinenyS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1504.04115},
  eprinttype    = {arXiv},
  eprint       = {1504.04115},
  timestamp    = {Tue, 03 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/GajarskyHLOORS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1507.03407},
  eprinttype    = {arXiv},
  eprint       = {1507.03407},
  timestamp    = {Fri, 30 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BrazdilHKRA15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1509.01787},
  eprinttype    = {arXiv},
  eprint       = {1509.01787},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/HlinenyS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1509.07952},
  eprinttype    = {arXiv},
  eprint       = {1509.07952},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/ChimaniH15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1511.08841},
  eprinttype    = {arXiv},
  eprint       = {1511.08841},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/GajarskyHT15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1512.02379},
  eprinttype    = {arXiv},
  eprint       = {1512.02379},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/HlinenyD15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.dam.2013.10.038},
  doi          = {10.1016/J.DAM.2013.10.038},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GanianHKLOR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.jcss.2013.07.005},
  doi          = {10.1016/J.JCSS.2013.07.005},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/GanianHLORS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1137/130945636},
  doi          = {10.1137/130945636},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/CabelloCH14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GajarskyHOO14,
  author       = {Jakub Gajarsk{\'{y}} and
                  Petr Hlinen{\'{y}} and
                  Jan Obdrz{\'{a}}lek and
                  Sebastian Ordyniak},
  editor       = {Hee{-}Kap Ahn and
                  Chan{-}Su Shin},
  title        = {Faster Existential {FO} Model Checking on Posets},
  booktitle    = {Algorithms and Computation - 25th International Symposium, {ISAAC}
                  2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8889},
  pages        = {441--451},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-13075-0\_35},
  doi          = {10.1007/978-3-319-13075-0\_35},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/GajarskyHOO14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1007/978-3-319-14896-0},
  doi          = {10.1007/978-3-319-14896-0},
  isbn         = {978-3-319-14895-3},
  timestamp    = {Fri, 01 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/memics/2014.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1403.7024},
  eprinttype    = {arXiv},
  eprint       = {1403.7024},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/HlinenyKOO14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.aam.2012.06.004},
  doi          = {10.1016/J.AAM.2012.06.004},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aam/ChimaniDHK13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.ejc.2012.07.024},
  doi          = {10.1016/J.EJC.2012.07.024},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/GanianHO13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.3233/FI-2013-800},
  doi          = {10.3233/FI-2013-800},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/fuin/GanianHO13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  editor       = {Hans L. Bodlaender and
                  Giuseppe F. Italiano},
  title        = {Kernelization Using Structural Parameters on Sparse Graph Classes},
  booktitle    = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
                  France, September 2-4, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8125},
  pages        = {529--540},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40450-4\_45},
  doi          = {10.1007/978-3-642-40450-4\_45},
  timestamp    = {Mon, 03 Jan 2022 22:19:39 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/GajarskyHOORRVS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  editor       = {Fedor V. Fomin and
                  Rusins Freivalds and
                  Marta Z. Kwiatkowska and
                  David Peleg},
  title        = {{FO} Model Checking of Interval Graphs},
  booktitle    = {Automata, Languages, and Programming - 40th International Colloquium,
                  {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7966},
  pages        = {250--262},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-39212-2\_24},
  doi          = {10.1007/978-3-642-39212-2\_24},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/GanianHKOST13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1302.6863},
  eprinttype    = {arXiv},
  eprint       = {1302.6863},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1302-6863.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://www.cai.sk/ojs/index.php/cai/article/view/1007},
  timestamp    = {Mon, 14 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cai/HlinenyM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.ejc.2011.09.009},
  doi          = {10.1016/J.EJC.2011.09.009},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/ChimaniHM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.tcs.2011.12.073},
  doi          = {10.1016/J.TCS.2011.12.073},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HlinenyK12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GajarskyH12,
  author       = {Jakub Gajarsk{\'{y}} and
                  Petr Hlinen{\'{y}}},
  editor       = {Deepak D'Souza and
                  Telikepalli Kavitha and
                  Jaikumar Radhakrishnan},
  title        = {Faster Deciding {MSO} Properties of Trees of Fixed Height, and Some
                  Consequences},
  booktitle    = {{IARCS} Annual Conference on Foundations of Software Technology and
                  Theoretical Computer Science, {FSTTCS} 2012, December 15-17, 2012,
                  Hyderabad, India},
  series       = {LIPIcs},
  volume       = {18},
  pages        = {112--123},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2012},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2012.112},
  doi          = {10.4230/LIPICS.FSTTCS.2012.112},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/GajarskyH12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  editor       = {Branislav Rovan and
                  Vladimiro Sassone and
                  Peter Widmayer},
  title        = {When Trees Grow Low: Shrubs and Fast {MSO1}},
  booktitle    = {Mathematical Foundations of Computer Science 2012 - 37th International
                  Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7464},
  pages        = {419--430},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-32589-2\_38},
  doi          = {10.1007/978-3-642-32589-2\_38},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/mfcs/GanianHNOMR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  editor       = {Christoph D{\"{u}}rr and
                  Thomas Wilke},
  title        = {Lower Bounds on the Complexity of MSO{\_}1 Model-Checking},
  booktitle    = {29th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
  series       = {LIPIcs},
  volume       = {14},
  pages        = {326--337},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2012},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2012.326},
  doi          = {10.4230/LIPICS.STACS.2012.326},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/GanianHLOR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1201.2000},
  eprinttype    = {arXiv},
  eprint       = {1201.2000},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1201-2000.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1205.4363},
  eprinttype    = {arXiv},
  eprint       = {1205.4363},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1205-4363.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.46298/dmtcs.542},
  doi          = {10.46298/DMTCS.542},
  timestamp    = {Tue, 31 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dmtcs/JelinkovaSHK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HlinenyM11,
  author       = {Petr Hlinen{\'{y}} and
                  Ondrej Moris},
  editor       = {Camil Demetrescu and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title        = {Scope-Based Route Planning},
  booktitle    = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
                  Germany, September 5-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6942},
  pages        = {445--456},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23719-5\_38},
  doi          = {10.1007/978-3-642-23719-5\_38},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/HlinenyM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChimaniH11,
  author       = {Markus Chimani and
                  Petr Hlinen{\'{y}}},
  editor       = {Luca Aceto and
                  Monika Henzinger and
                  Jir{\'{\i}} Sgall},
  title        = {A Tighter Insertion-Based Approximation of the Crossing Number},
  booktitle    = {Automata, Languages and Programming - 38th International Colloquium,
                  {ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
                  {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {6755},
  pages        = {122--134},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22006-7\_11},
  doi          = {10.1007/978-3-642-22006-7\_11},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/ChimaniH11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/ChimaniDHK11,
  author       = {Markus Chimani and
                  Martin Derka and
                  Petr Hlinen{\'{y}} and
                  Matej Klus{\'{a}}cek},
  editor       = {Costas S. Iliopoulos and
                  William F. Smyth},
  title        = {How Not to Characterize Planar-Emulable Graphs},
  booktitle    = {Combinatorial Algorithms - 22nd International Workshop, {IWOCA} 2011,
                  Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {7056},
  pages        = {106--120},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-25011-8\_9},
  doi          = {10.1007/978-3-642-25011-8\_9},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwoca/ChimaniDHK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/memics/HlinenyM11,
  author       = {Petr Hlinen{\'{y}} and
                  Ondrej Moris},
  editor       = {Zdenek Kot{\'{a}}sek and
                  Jan Bouda and
                  Ivana Cern{\'{a}} and
                  Luk{\'{a}}s Sekanina and
                  Tom{\'{a}}s Vojnar and
                  David Antos},
  title        = {Generalized Maneuvers in Route Planning},
  booktitle    = {Mathematical and Engineering Methods in Computer Science - 7th International
                  Doctoral Workshop, {MEMICS} 2011, Lednice, Czech Republic, October
                  14-16, 2011, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {7119},
  pages        = {155--166},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-25929-6\_15},
  doi          = {10.1007/978-3-642-25929-6\_15},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/memics/HlinenyM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GanianHO11,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Jan Obdrz{\'{a}}lek},
  editor       = {Thomas Schwentick and
                  Christoph D{\"{u}}rr},
  title        = {Clique-width: When Hard Does Not Mean Impossible},
  booktitle    = {28th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2011, March 10-12, 2011, Dortmund, Germany},
  series       = {LIPIcs},
  volume       = {9},
  pages        = {404--415},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2011},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2011.404},
  doi          = {10.4230/LIPICS.STACS.2011.404},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/GanianHO11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1101.3182},
  eprinttype    = {arXiv},
  eprint       = {1101.3182},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1101-3182.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1104.5039},
  eprinttype    = {arXiv},
  eprint       = {1104.5039},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1104-5039.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1107.0176},
  eprinttype    = {arXiv},
  eprint       = {1107.0176},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1107-0176.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1107.0798},
  eprinttype    = {arXiv},
  eprint       = {1107.0798},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1107-0798.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1109.5804},
  eprinttype    = {arXiv},
  eprint       = {1109.5804},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1109-5804.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.dam.2009.10.018},
  doi          = {10.1016/J.DAM.2009.10.018},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GanianH10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1007/s00373-010-0934-9},
  doi          = {10.1007/S00373-010-0934-9},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/Hlineny10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1002/jgt.20473},
  doi          = {10.1002/JGT.20473},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/HlinenyS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GanianHO10,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Jan Obdrz{\'{a}}lek},
  editor       = {Kamal Lodaya and
                  Meena Mahajan},
  title        = {Better Algorithms for Satisfiability Problems for Formulas of Bounded
                  Rank-width},
  booktitle    = {{IARCS} Annual Conference on Foundations of Software Technology and
                  Theoretical Computer Science, {FSTTCS} 2010, December 15-18, 2010,
                  Chennai, India},
  series       = {LIPIcs},
  volume       = {8},
  pages        = {73--83},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2010},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2010.73},
  doi          = {10.4230/LIPICS.FSTTCS.2010.73},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/GanianHO10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  editor       = {Venkatesh Raman and
                  Saket Saurabh},
  title        = {Are There Any Good Digraph Width Measures?},
  booktitle    = {Parameterized and Exact Computation - 5th International Symposium,
                  {IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6478},
  pages        = {135--146},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-17493-3\_14},
  doi          = {10.1007/978-3-642-17493-3\_14},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/GanianHKMORS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HlinenyC10,
  author       = {Petr Hlinen{\'{y}} and
                  Markus Chimani},
  editor       = {Moses Charikar},
  title        = {Approximating the Crossing Number of Graphs Embeddable in Any Orientable
                  Surface},
  booktitle    = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
  pages        = {918--927},
  publisher    = {{SIAM}},
  year         = {2010},
  url          = {https://doi.org/10.1137/1.9781611973075.74},
  doi          = {10.1137/1.9781611973075.74},
  timestamp    = {Tue, 02 Feb 2021 17:07:39 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/HlinenyC10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/GanianH10,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}}},
  editor       = {Jan van Leeuwen and
                  Anca Muscholl and
                  David Peleg and
                  Jaroslav Pokorn{\'{y}} and
                  Bernhard Rumpe},
  title        = {New Results on the Complexity of Oriented Colouring on Restricted
                  Digraph Classes},
  booktitle    = {{SOFSEM} 2010: Theory and Practice of Computer Science, 36th Conference
                  on Current Trends in Theory and Practice of Computer Science, Spindleruv
                  Ml{\'{y}}n, Czech Republic, January 23-29, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5901},
  pages        = {428--439},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-11266-9\_36},
  doi          = {10.1007/978-3-642-11266-9\_36},
  timestamp    = {Sat, 30 Sep 2023 09:57:10 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/GanianH10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1007/978-3-642-15155-2},
  doi          = {10.1007/978-3-642-15155-2},
  isbn         = {978-3-642-15154-5},
  timestamp    = {Fri, 30 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/2010.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1004.1485},
  eprinttype    = {arXiv},
  eprint       = {1004.1485},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1004-1485.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://arxiv.org/abs/1006.5621},
  eprinttype    = {arXiv},
  eprint       = {1006.5621},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1006-5621.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.ejc.2008.09.028},
  doi          = {10.1016/J.EJC.2008.09.028},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/HlinenyW09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/GanianH09,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}}},
  editor       = {Jir{\'{\i}} Fiala and
                  Jan Kratochv{\'{\i}}l and
                  Mirka Miller},
  title        = {Better Polynomial Algorithms on Graphs of Bounded Rank-Width},
  booktitle    = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
                  Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
                  Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5874},
  pages        = {266--277},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-10217-2\_27},
  doi          = {10.1007/978-3-642-10217-2\_27},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwoca/GanianH09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  editor       = {Jianer Chen and
                  Fedor V. Fomin},
  title        = {On Digraph Width Measures in Parameterized Algorithmics},
  booktitle    = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
                  2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5917},
  pages        = {185--197},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-11269-0\_15},
  doi          = {10.1007/978-3-642-11269-0\_15},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/GanianHKLOR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/memics/HlinenyMV09,
  author       = {Petr Hlinen{\'{y}} and
                  V{\'{a}}clav Maty{\'{a}}s and
                  Tom{\'{a}}s Vojnar},
  editor       = {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    = {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},
  url          = {http://drops.dagstuhl.de/opus/volltexte/2009/2342},
  timestamp    = {Tue, 15 Feb 2022 09:40:04 +0100},
  biburl       = {https://dblp.org/rec/conf/memics/HlinenyMV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://drops.dagstuhl.de/portals/09006/},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/memics/2009.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1093/comjnl/bxm052},
  doi          = {10.1093/COMJNL/BXM052},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cj/HlinenyOSG08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://www.combinatorics.org/Volume\_15/Abstracts/v15i1r46.html},
  timestamp    = {Thu, 09 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/GitlerHLS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {http://www.combinatorics.org/Volume\_15/Abstracts/v15i1r102.html},
  timestamp    = {Thu, 09 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/Hlineny08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.endm.2008.06.055},
  doi          = {10.1016/J.ENDM.2008.06.055},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/HlinenyS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1137/070685920},
  doi          = {10.1137/070685920},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/HlinenyO08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/ChimaniHM08,
  author       = {Markus Chimani and
                  Petr Hlinen{\'{y}} and
                  Petra Mutzel},
  editor       = {Ioannis G. Tollis and
                  Maurizio Patrignani},
  title        = {Approximating the Crossing Number of Apex Graphs},
  booktitle    = {Graph Drawing, 16th International Symposium, {GD} 2008, Heraklion,
                  Crete, Greece, September 21-24, 2008. Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5417},
  pages        = {432--434},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-642-00219-9\_42},
  doi          = {10.1007/978-3-642-00219-9\_42},
  timestamp    = {Sun, 13 Nov 2022 09:57:30 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/ChimaniHM08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/HlinenyG08,
  author       = {Petr Hlinen{\'{y}} and
                  Robert Ganian},
  editor       = {Mirka Miller and
                  Koichi Wada},
  title        = {Automata approach to graphs of bounded rank-width},
  booktitle    = {Proceedings of the 19th International Workshop on Combinatorial Algorithms,
                  {IWOCA} 2008, September 13-15, 2008, Nagoya, Japan},
  pages        = {4--15},
  publisher    = {College Publications},
  year         = {2008},
  timestamp    = {Fri, 19 Jan 2024 14:56:10 +0100},
  biburl       = {https://dblp.org/rec/conf/iwoca/HlinenyG08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.endm.2007.01.001},
  doi          = {10.1016/J.ENDM.2007.01.001},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/HlinenyKNS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.endm.2007.07.037},
  doi          = {10.1016/J.ENDM.2007.07.037},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/GitlerHLS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1007/s00224-007-1307-5},
  doi          = {10.1007/S00224-007-1307-5},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Hlineny07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HlinenyO07,
  author       = {Petr Hlinen{\'{y}} and
                  Sang{-}il Oum},
  editor       = {Lars Arge and
                  Michael Hoffmann and
                  Emo Welzl},
  title        = {Finding Branch-Decompositions and Rank-Decompositions},
  booktitle    = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,
                  October 8-10, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4698},
  pages        = {163--174},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-75520-3\_16},
  doi          = {10.1007/978-3-540-75520-3\_16},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/HlinenyO07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HlinenyS07,
  author       = {Petr Hlinen{\'{y}} and
                  Gelasio Salazar},
  editor       = {Takeshi Tokuyama},
  title        = {Approximating the Crossing Number of Toroidal Graphs},
  booktitle    = {Algorithms and Computation, 18th International Symposium, {ISAAC}
                  2007, Sendai, Japan, December 17-19, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4835},
  pages        = {148--159},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-77120-3\_15},
  doi          = {10.1007/978-3-540-77120-3\_15},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/HlinenyS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1017/S0963548305007297},
  doi          = {10.1017/S0963548305007297},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Hlineny06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1017/S096354830500742X},
  doi          = {10.1017/S096354830500742X},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/GoddynHH06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.dam.2005.12.001},
  doi          = {10.1016/J.DAM.2005.12.001},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Hlineny06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.ejc.2006.06.005},
  doi          = {10.1016/J.EJC.2006.06.005},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/HlinenyW06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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, Ser. {B}},
  volume       = {96},
  number       = {3},
  pages        = {325--351},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.jctb.2005.08.005},
  doi          = {10.1016/J.JCTB.2005.08.005},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Hlineny06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Hlineny06a,
  author       = {Petr Hlinen{\'{y}}},
  title        = {Crossing number is hard for cubic graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {96},
  number       = {4},
  pages        = {455--471},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.jctb.2005.09.009},
  doi          = {10.1016/J.JCTB.2005.09.009},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Hlineny06a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1137/050645208},
  doi          = {10.1137/050645208},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/GimenezHN06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/j.tcs.2005.10.006},
  doi          = {10.1016/J.TCS.2005.10.006},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HlinenyS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/HlinenyS06,
  author       = {Petr Hlinen{\'{y}} and
                  Gelasio Salazar},
  editor       = {Michael Kaufmann and
                  Dorothea Wagner},
  title        = {On the Crossing Number of Almost Planar Graphs},
  booktitle    = {Graph Drawing, 14th International Symposium, {GD} 2006, Karlsruhe,
                  Germany, September 18-20, 2006. Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {4372},
  pages        = {162--173},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/978-3-540-70904-6\_17},
  doi          = {10.1007/978-3-540-70904-6\_17},
  timestamp    = {Sun, 13 Nov 2022 09:57:32 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/HlinenyS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Hlineny06,
  author       = {Petr Hlinen{\'{y}}},
  editor       = {Rastislav Kralovic and
                  Pawel Urzyczyn},
  title        = {On Matroid Representability and Minor Problems},
  booktitle    = {Mathematical Foundations of Computer Science 2006, 31st International
                  Symposium, {MFCS} 2006, Star{\'{a}} Lesn{\'{a}}, Slovakia,
                  August 28-September 1, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4162},
  pages        = {505--516},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11821069\_44},
  doi          = {10.1007/11821069\_44},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/Hlineny06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1137/S0097539702418589},
  doi          = {10.1137/S0097539702418589},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Hlineny05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GimenezHN05,
  author       = {Omer Gim{\'{e}}nez and
                  Petr Hlinen{\'{y}} and
                  Marc Noy},
  editor       = {Dieter Kratsch},
  title        = {Computing the Tutte Polynomial on Graphs of Bounded Clique-Width},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
                  {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {3787},
  pages        = {59--68},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11604686\_6},
  doi          = {10.1007/11604686\_6},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/GimenezHN05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1002/jgt.10177},
  doi          = {10.1002/JGT.10177},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/HlinenyT04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1137/S089548010139638X},
  doi          = {10.1137/S089548010139638X},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/GeelenHW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HlinenyS04,
  author       = {Petr Hlinen{\'{y}} and
                  Detlef Seese},
  editor       = {Rodney G. Downey and
                  Michael R. Fellows and
                  Frank K. H. A. Dehne},
  title        = {On Decidability of {MSO} Theories of Representable Matroids},
  booktitle    = {Parameterized and Exact Computation, First International Workshop,
                  {IWPEC} 2004, Bergen, Norway, September 14-17, 2004, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3162},
  pages        = {96--107},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-28639-4\_9},
  doi          = {10.1007/978-3-540-28639-4\_9},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/HlinenyS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Hlineny04,
  author       = {Petr Hlinen{\'{y}}},
  editor       = {Jir{\'{\i}} Fiala and
                  V{\'{a}}clav Koubek and
                  Jan Kratochv{\'{\i}}l},
  title        = {Crossing Number Is Hard for Cubic Graphs},
  booktitle    = {Mathematical Foundations of Computer Science 2004, 29th International
                  Symposium, {MFCS} 2004, Prague, Czech Republic, August 22-27, 2004,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3153},
  pages        = {772--782},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-28629-5\_60},
  doi          = {10.1007/978-3-540-28629-5\_60},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/Hlineny04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Hlineny03,
  author       = {Petr Hlinen{\'{y}}},
  title        = {Crossing-number critical graphs have bounded path-width},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {88},
  number       = {2},
  pages        = {347--367},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0095-8956(03)00037-6},
  doi          = {10.1016/S0095-8956(03)00037-6},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Hlineny03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Hlineny03,
  author       = {Petr Hlinen{\'{y}}},
  editor       = {Branislav Rovan and
                  Peter Vojt{\'{a}}s},
  title        = {On Matroid Properties Definable in the {MSO} Logic},
  booktitle    = {Mathematical Foundations of Computer Science 2003, 28th International
                  Symposium, {MFCS} 2003, Bratislava, Slovakia, August 25-29, 2003,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2747},
  pages        = {470--479},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/978-3-540-45138-9\_41},
  doi          = {10.1007/978-3-540-45138-9\_41},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/Hlineny03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Hlineny03,
  author       = {Petr Hlinen{\'{y}}},
  editor       = {Helmut Alt and
                  Michel Habib},
  title        = {Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids},
  booktitle    = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
                  Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2607},
  pages        = {319--330},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/3-540-36494-3\_29},
  doi          = {10.1007/3-540-36494-3\_29},
  timestamp    = {Thu, 14 Oct 2021 10:38:16 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Hlineny03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.37236/1648},
  doi          = {10.37236/1648},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/Hlineny02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1007/s004540010078},
  doi          = {10.1007/S004540010078},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/Hlineny01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/S0012-365X(00)00204-1},
  doi          = {10.1016/S0012-365X(00)00204-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/HlinenyK01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/S0012-365X(00)00263-6},
  doi          = {10.1016/S0012-365X(00)00263-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Hlineny01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1002/jgt.1018},
  doi          = {10.1002/JGT.1018},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Hlineny01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Hlineny01,
  author       = {Petr Hlinen{\'{y}}},
  editor       = {Petra Mutzel and
                  Michael J{\"{u}}nger and
                  Sebastian Leipert},
  title        = {Crossing-Critical Graphs and Path-Width},
  booktitle    = {Graph Drawing, 9th International Symposium, {GD} 2001 Vienna, Austria,
                  September 23-26, 2001, Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {2265},
  pages        = {102--114},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45848-4\_9},
  doi          = {10.1007/3-540-45848-4\_9},
  timestamp    = {Sun, 13 Nov 2022 09:57:35 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/Hlineny01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1002/(SICI)1097-0118(199911)32:3\&\#60;234::AID-JGT3\&\#62;3.0.CO;2-N},
  doi          = {10.1002/(SICI)1097-0118(199911)32:3\&\#60;234::AID-JGT3\&\#62;3.0.CO;2-N},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Hlineny99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@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},
  url          = {https://doi.org/10.1016/S0166-218X(97)00075-9},
  doi          = {10.1016/S0166-218X(97)00075-9},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Hlincny98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Hlineny98,
  author       = {Petr Hlinen{\'{y}}},
  title        = {Classes and Recognition of Curve Contact Graphs\({}^{\mbox{, }}\)},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {74},
  number       = {1},
  pages        = {87--103},
  year         = {1998},
  url          = {https://doi.org/10.1006/jctb.1998.1846},
  doi          = {10.1006/JCTB.1998.1846},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Hlineny98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Hlineny97,
  author       = {Petr Hlinen{\'{y}}},
  editor       = {Giuseppe Di Battista},
  title        = {Touching Graphs of Unit Balls},
  booktitle    = {Graph Drawing, 5th International Symposium, {GD} '97, Rome, Italy,
                  September 18-20, 1997, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1353},
  pages        = {350--358},
  publisher    = {Springer},
  year         = {1997},
  url          = {https://doi.org/10.1007/3-540-63938-1\_80},
  doi          = {10.1007/3-540-63938-1\_80},
  timestamp    = {Sun, 13 Nov 2022 09:57:37 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/Hlineny97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HlinenyK97,
  author       = {Petr Hlinen{\'{y}} and
                  Jan Kratochv{\'{\i}}l},
  editor       = {Rolf H. M{\"{o}}hring},
  title        = {Computational Complexity of the Krausz Dimension of Graphs},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop,
                  {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1335},
  pages        = {214--228},
  publisher    = {Springer},
  year         = {1997},
  url          = {https://doi.org/10.1007/BFb0024500},
  doi          = {10.1007/BFB0024500},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/HlinenyK97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Hlineny95,
  author       = {Petr Hlinen{\'{y}}},
  editor       = {Franz{-}Josef Brandenburg},
  title        = {Contact Graphs of Curves},
  booktitle    = {Graph Drawing, Symposium on Graph Drawing, {GD} '95, Passau, Germany,
                  September 20-22, 1995, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1027},
  pages        = {312--323},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/BFb0021814},
  doi          = {10.1007/BFB0021814},
  timestamp    = {Sun, 13 Nov 2022 09:57:38 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/Hlineny95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics