Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jan Kratochvíl
@article{DBLP:journals/algorithmica/BokFJKR24,
author = {Jan Bok and
Jir{\'{\i}} Fiala and
Nikola Jedlickov{\'{a}} and
Jan Kratochv{\'{\i}}l and
Pawel Rzazewski},
title = {List Covering of Regular Multigraphs with Semi-edges},
journal = {Algorithmica},
volume = {86},
number = {3},
pages = {782--807},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01163-7},
doi = {10.1007/S00453-023-01163-7},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BokFJKR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-04907,
author = {Brigt Arve Toppe H{\aa}vardstun and
Jan Kratochv{\'{\i}}l and
Joakim Sunde and
Jan Arne Telle},
title = {On a Combinatorial Problem Arising in Machine Teaching},
journal = {CoRR},
volume = {abs/2402.04907},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.04907},
doi = {10.48550/ARXIV.2402.04907},
eprinttype = {arXiv},
eprint = {2402.04907},
timestamp = {Thu, 15 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-04907.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-03668,
author = {Nikola Jedlickov{\'{a}} and
Jan Kratochv{\'{\i}}l},
title = {On the Structure of Hamiltonian Graphs with Small Independence Number},
journal = {CoRR},
volume = {abs/2403.03668},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.03668},
doi = {10.48550/ARXIV.2403.03668},
eprinttype = {arXiv},
eprint = {2403.03668},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-03668.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GrilliHKR23,
author = {Luca Grilli and
Seok{-}Hee Hong and
Jan Kratochv{\'{\i}}l and
Ignaz Rutter},
title = {Drawing Simultaneously Embedded Graphs with Few Bends},
journal = {Int. J. Found. Comput. Sci.},
volume = {34},
number = {7},
pages = {807--824},
year = {2023},
url = {https://doi.org/10.1142/S0129054123420017},
doi = {10.1142/S0129054123420017},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/GrilliHKR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/CornelsenLGGKW23,
author = {Sabine Cornelsen and
Giordano Da Lozzo and
Luca Grilli and
Siddharth Gupta and
Jan Kratochv{\'{\i}}l and
Alexander Wolff},
editor = {Michael A. Bekos and
Markus Chimani},
title = {The Parametrized Complexity of the Segment Number},
booktitle = {Graph Drawing and Network Visualization - 31st International Symposium,
{GD} 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023,
Revised Selected Papers, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {14466},
pages = {97--113},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49275-4\_7},
doi = {10.1007/978-3-031-49275-4\_7},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/CornelsenLGGKW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KindermannKLV23,
author = {Philipp Kindermann and
Jan Kratochv{\'{\i}}l and
Giuseppe Liotta and
Pavel Valtr},
editor = {Michael A. Bekos and
Markus Chimani},
title = {Three Edge-Disjoint Plane Spanning Paths in a Point Set},
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 = {323--338},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49272-3\_22},
doi = {10.1007/978-3-031-49272-3\_22},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/KindermannKLV23.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}
}
@inproceedings{DBLP:conf/walcom/Kratochvil23,
author = {Jan Kratochv{\'{\i}}l},
editor = {Chun{-}Cheng Lin and
Bertrand M. T. Lin and
Giuseppe Liotta},
title = {Graph Covers: Where Topology Meets Computer Science, and Simple Means
Difficult},
booktitle = {{WALCOM:} Algorithms and Computation - 17th International Conference
and Workshops, {WALCOM} 2023, Hsinchu, Taiwan, March 22-24, 2023,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13973},
pages = {3--11},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-27051-2\_1},
doi = {10.1007/978-3-031-27051-2\_1},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/Kratochvil23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BokFJKS23,
author = {Jan Bok and
Jir{\'{\i}} Fiala and
Nikola Jedlickov{\'{a}} and
Jan Kratochv{\'{\i}}l and
Michaela Seifrtov{\'{a}}},
editor = {Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Computational Complexity of Covering Colored Mixed Multigraphs with
Degree Partition Equivalence Classes of Size at Most Two (Extended
Abstract)},
booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International
Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {14093},
pages = {101--115},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43380-1\_8},
doi = {10.1007/978-3-031-43380-1\_8},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BokFJKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-06431,
author = {Jan Bok and
Jir{\'{\i}} Fiala and
Nikola Jedlickov{\'{a}} and
Jan Kratochv{\'{\i}}l and
Michaela Seifrtov{\'{a}}},
title = {Computational Complexity of Covering Disconnected Multigraphs},
journal = {CoRR},
volume = {abs/2306.06431},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.06431},
doi = {10.48550/ARXIV.2306.06431},
eprinttype = {arXiv},
eprint = {2306.06431},
timestamp = {Fri, 16 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-06431.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-07237,
author = {Philipp Kindermann and
Jan Kratochv{\'{\i}}l and
Giuseppe Liotta and
Pavel Valtr},
title = {Three Edge-disjoint Plane Spanning Paths in a Point Set},
journal = {CoRR},
volume = {abs/2306.07237},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.07237},
doi = {10.48550/ARXIV.2306.07237},
eprinttype = {arXiv},
eprint = {2306.07237},
timestamp = {Fri, 16 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-07237.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-15416,
author = {Sabine Cornelsen and
Giordano Da Lozzo and
Luca Grilli and
Siddharth Gupta and
Jan Kratochv{\'{\i}}l and
Alexander Wolff},
title = {The Parametrized Complexity of the Segment Number},
journal = {CoRR},
volume = {abs/2308.15416},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.15416},
doi = {10.48550/ARXIV.2308.15416},
eprinttype = {arXiv},
eprint = {2308.15416},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-15416.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-09228,
author = {Nikola Jedlickov{\'{a}} and
Jan Kratochv{\'{\i}}l},
title = {Hamiltonian path and Hamiltonian cycle are solvable in polynomial
time in graphs of bounded independence number},
journal = {CoRR},
volume = {abs/2309.09228},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.09228},
doi = {10.48550/ARXIV.2309.09228},
eprinttype = {arXiv},
eprint = {2309.09228},
timestamp = {Fri, 22 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-09228.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GanianKS22,
author = {Robert Ganian and
Jan Kratochv{\'{\i}}l and
Stefan Szeider},
title = {Preface: Ninth workshop on graph classes, optimization, and Width
Parameters, Vienna, Austria},
journal = {Discret. Appl. Math.},
volume = {312},
pages = {1--2},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.02.009},
doi = {10.1016/J.DAM.2022.02.009},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GanianKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BekosFKKKR22,
author = {Michael A. Bekos and
Stefan Felsner and
Philipp Kindermann and
Stephen G. Kobourov and
Jan Kratochv{\'{\i}}l and
Ignaz Rutter},
editor = {Patrizio Angelini and
Reinhard von Hanxleden},
title = {The Rique-Number of Graphs},
booktitle = {Graph Drawing and Network Visualization - 30th International Symposium,
{GD} 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13764},
pages = {371--386},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-22203-0\_27},
doi = {10.1007/978-3-031-22203-0\_27},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BekosFKKKR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BokFJKR22,
author = {Jan Bok and
Jir{\'{\i}} Fiala and
Nikola Jedlickov{\'{a}} and
Jan Kratochv{\'{\i}}l and
Pawel Rzazewski},
editor = {Cristina Bazgan and
Henning Fernau},
title = {List Covering of Regular Multigraphs},
booktitle = {Combinatorial Algorithms - 33rd International Workshop, {IWOCA} 2022,
Trier, Germany, June 7-9, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13270},
pages = {228--242},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06678-8\_17},
doi = {10.1007/978-3-031-06678-8\_17},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BokFJKR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-04280,
author = {Jan Bok and
Jir{\'{\i}} Fiala and
Nikola Jedlickov{\'{a}} and
Jan Kratochv{\'{\i}}l and
Pawel Rzazewski},
title = {List covering of regular multigraphs},
journal = {CoRR},
volume = {abs/2204.04280},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.04280},
doi = {10.48550/ARXIV.2204.04280},
eprinttype = {arXiv},
eprint = {2204.04280},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-04280.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-00424,
author = {Michael A. Bekos and
Stefan Felsner and
Philipp Kindermann and
Stephen G. Kobourov and
Jan Kratochv{\'{\i}}l and
Ignaz Rutter},
title = {The Rique-Number of Graphs},
journal = {CoRR},
volume = {abs/2209.00424},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.00424},
doi = {10.48550/ARXIV.2209.00424},
eprinttype = {arXiv},
eprint = {2209.00424},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-00424.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}
}
@article{DBLP:journals/algorithmica/KratochvilMN21,
author = {Jan Kratochv{\'{\i}}l and
Tom{\'{a}}s Masar{\'{\i}}k and
Jana Novotn{\'{a}}},
title = {\emph{U}-Bubble Model for Mixed Unit Interval Graphs and Its Applications:
The MaxCut Problem Revisited},
journal = {Algorithmica},
volume = {83},
number = {12},
pages = {3649--3680},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00837-4},
doi = {10.1007/S00453-021-00837-4},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KratochvilMN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KaufmannKLMRV21,
author = {Michael Kaufmann and
Jan Kratochv{\'{\i}}l and
Fabian Lipp and
Fabrizio Montecchiani and
Chrysanthi N. Raftopoulou and
Pavel Valtr},
title = {The Stub Resolution of 1-planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {2},
pages = {625--642},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00575},
doi = {10.7155/JGAA.00575},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KaufmannKLMRV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BokFJKS21,
author = {Jan Bok and
Jir{\'{\i}} Fiala and
Nikola Jedlickov{\'{a}} and
Jan Kratochv{\'{\i}}l and
Michaela Seifrtov{\'{a}}},
editor = {Evripidis Bampis and
Aris Pagourtzis},
title = {Computational Complexity of Covering Disconnected Multigraphs},
booktitle = {Fundamentals of Computation Theory - 23rd International Symposium,
{FCT} 2021, Athens, Greece, September 12-15, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12867},
pages = {85--99},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86593-1\_6},
doi = {10.1007/978-3-030-86593-1\_6},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/BokFJKS21.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}
}
@inproceedings{DBLP:conf/mfcs/KratochvilMN20,
author = {Jan Kratochv{\'{\i}}l and
Tom{\'{a}}s Masar{\'{\i}}k and
Jana Novotn{\'{a}}},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {U-Bubble Model for Mixed Unit Interval Graphs and Its Applications:
The MaxCut Problem Revisited},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {57:1--57:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.57},
doi = {10.4230/LIPICS.MFCS.2020.57},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KratochvilMN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/0001KLMRV20,
author = {Michael Kaufmann and
Jan Kratochv{\'{\i}}l and
Fabian Lipp and
Fabrizio Montecchiani and
Chrysanthi N. Raftopoulou and
Pavel Valtr},
editor = {M. Sohel Rahman and
Kunihiko Sadakane and
Wing{-}Kin Sung},
title = {The Stub Resolution of 1-Planar Graphs},
booktitle = {{WALCOM:} Algorithms and Computation - 14th International Conference,
{WALCOM} 2020, Singapore, March 31 - April 2, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12049},
pages = {170--182},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-39881-1\_15},
doi = {10.1007/978-3-030-39881-1\_15},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/0001KLMRV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-08311,
author = {Jan Kratochv{\'{\i}}l and
Tom{\'{a}}s Masar{\'{\i}}k and
Jana Novotn{\'{a}}},
title = {U-Bubble Model for Mixed Unit Interval Graphs and its Applications:
The MaxCut Problem Revisited},
journal = {CoRR},
volume = {abs/2002.08311},
year = {2020},
url = {https://arxiv.org/abs/2002.08311},
eprinttype = {arXiv},
eprint = {2002.08311},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-08311.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DereniowskiGK19,
author = {Dariusz Dereniowski and
Tomas Gavenciak and
Jan Kratochv{\'{\i}}l},
title = {Cops, a fast robber and defensive domination on interval graphs},
journal = {Theor. Comput. Sci.},
volume = {794},
pages = {47--58},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.09.031},
doi = {10.1016/J.TCS.2018.09.031},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DereniowskiGK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrimkovJKKPRST18,
author = {Valentin E. Brimkov and
Konstanty Junosza{-}Szaniawski and
Sean Kafer and
Jan Kratochv{\'{\i}}l and
Martin Pergel and
Pawel Rzazewski and
Matthew Szczepankiewicz and
Joshua Terhaar},
title = {Homothetic polygons and beyond: Maximal cliques in intersection graphs},
journal = {Discret. Appl. Math.},
volume = {247},
pages = {263--277},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.03.046},
doi = {10.1016/J.DAM.2018.03.046},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrimkovJKKPRST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FialaGKKK18,
author = {Jir{\'{\i}} Fiala and
Tomas Gavenciak and
Dusan Knop and
Martin Kouteck{\'{y}} and
Jan Kratochv{\'{\i}}l},
title = {Parameterized complexity of distance labeling and uniform channel
assignment problems},
journal = {Discret. Appl. Math.},
volume = {248},
pages = {46--55},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.02.010},
doi = {10.1016/J.DAM.2017.02.010},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FialaGKKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KratochvilL18,
author = {Jan Kratochv{\'{\i}}l and
Zsuzsanna Lipt{\'{a}}k},
title = {Preface},
journal = {Eur. J. Comb.},
volume = {68},
pages = {1--2},
year = {2018},
url = {https://doi.org/10.1016/j.ejc.2017.07.007},
doi = {10.1016/J.EJC.2017.07.007},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/KratochvilL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GavenciakGJKK18,
author = {Tomas Gavenciak and
Przemyslaw Gordinowicz and
V{\'{\i}}t Jel{\'{\i}}nek and
Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l},
title = {Cops and Robbers on intersection graphs},
journal = {Eur. J. Comb.},
volume = {72},
pages = {45--69},
year = {2018},
url = {https://doi.org/10.1016/j.ejc.2018.04.009},
doi = {10.1016/J.EJC.2018.04.009},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/GavenciakGJKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FialaKKN18,
author = {Jir{\'{\i}} Fiala and
Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Roman Nedela},
title = {3-connected reduction for regular graph covers},
journal = {Eur. J. Comb.},
volume = {73},
pages = {170--210},
year = {2018},
url = {https://doi.org/10.1016/j.ejc.2018.06.002},
doi = {10.1016/J.EJC.2018.06.002},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FialaKKN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/TalonK18,
author = {Alexandre Talon and
Jan Kratochv{\'{\i}}l},
title = {Completion of the mixed unit interval graphs hierarchy},
journal = {J. Graph Theory},
volume = {87},
number = {3},
pages = {317--332},
year = {2018},
url = {https://doi.org/10.1002/jgt.22159},
doi = {10.1002/JGT.22159},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/TalonK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/0001KLMRV18,
author = {Michael Kaufmann and
Jan Kratochv{\'{\i}}l and
Fabian Lipp and
Fabrizio Montecchiani and
Chrysanthi N. Raftopoulou and
Pavel Valtr},
editor = {B. S. Panda and
Partha P. Goswami},
title = {Bounded Stub Resolution for Some Maximal 1-Planar Graphs},
booktitle = {Algorithms and Discrete Applied Mathematics - 4th International Conference,
{CALDAM} 2018, Guwahati, India, February 15-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10743},
pages = {214--220},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-74180-2\_18},
doi = {10.1007/978-3-319-74180-2\_18},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/caldam/0001KLMRV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KlavikKORSSV17,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Ignaz Rutter and
Toshiki Saitoh and
Maria Saumell and
Tom{\'{a}}s Vyskocil},
title = {Extending Partial Representations of Proper and Unit Interval Graphs},
journal = {Algorithmica},
volume = {77},
number = {4},
pages = {1071--1104},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0133-z},
doi = {10.1007/S00453-016-0133-Z},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KlavikKORSSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KlavikKOSV17,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Toshiki Saitoh and
Tom{\'{a}}s Vyskocil},
title = {Extending Partial Representations of Interval Graphs},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {945--967},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0186-z},
doi = {10.1007/S00453-016-0186-Z},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KlavikKOSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BinucciCDGKKMT17,
author = {Carla Binucci and
Markus Chimani and
Walter Didimo and
Martin Gronemann and
Karsten Klein and
Jan Kratochv{\'{\i}}l and
Fabrizio Montecchiani and
Ioannis G. Tollis},
title = {Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar
to Stegosaurus},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {1},
pages = {81--102},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00398},
doi = {10.7155/JGAA.00398},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BinucciCDGKKMT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AbelloKKV17,
author = {James Abello and
Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Tom{\'{a}}s Vyskocil},
title = {{MSOL} restricted contractibility to planar graphs},
journal = {Theor. Comput. Sci.},
volume = {676},
pages = {1--14},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.02.030},
doi = {10.1016/J.TCS.2017.02.030},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AbelloKKV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AngeliniCL0HH0K17,
author = {Patrizio Angelini and
Steven Chaplick and
Felice De Luca and
Jir{\'{\i}} Fiala and
Jaroslav Hancl Jr. and
Niklas Heinsohn and
Michael Kaufmann and
Stephen G. Kobourov and
Jan Kratochv{\'{\i}}l and
Pavel Valtr},
editor = {Fabrizio Frati and
Kwan{-}Liu Ma},
title = {On Vertex- and Empty-Ply Proximity Drawings},
booktitle = {Graph Drawing and Network Visualization - 25th International Symposium,
{GD} 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10692},
pages = {24--37},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-73915-1\_3},
doi = {10.1007/978-3-319-73915-1\_3},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AngeliniCL0HH0K17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-09233,
author = {Patrizio Angelini and
Steven Chaplick and
Felice De Luca and
Jir{\'{\i}} Fiala and
Jan Hancl Jr. and
Niklas Heinsohn and
Michael Kaufmann and
Stephen G. Kobourov and
Jan Kratochv{\'{\i}}l and
Pavel Valtr},
title = {On Vertex- and Empty-Ply Proximity Drawings},
journal = {CoRR},
volume = {abs/1708.09233},
year = {2017},
url = {http://arxiv.org/abs/1708.09233},
eprinttype = {arXiv},
eprint = {1708.09233},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-09233.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KratochvilTT16,
author = {Jan Kratochv{\'{\i}}l and
Jan Arne Telle and
Marek Tesar},
title = {Computational complexity of covering three-vertex multigraphs},
journal = {Theor. Comput. Sci.},
volume = {609},
pages = {104--117},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2015.09.013},
doi = {10.1016/J.TCS.2015.09.013},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KratochvilTT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/FialaGKKK16,
author = {Jir{\'{\i}} Fiala and
Tomas Gavenciak and
Dusan Knop and
Martin Kouteck{\'{y}} and
Jan Kratochv{\'{\i}}l},
editor = {Thang N. Dinh and
My T. Thai},
title = {Fixed Parameter Complexity of Distance Constrained Labeling and Uniform
Channel Assignment Problems - (Extended Abstract)},
booktitle = {Computing and Combinatorics - 22nd International Conference, {COCOON}
2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9797},
pages = {67--78},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-42634-1\_6},
doi = {10.1007/978-3-319-42634-1\_6},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/FialaGKKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/JelinekJK16,
author = {V{\'{\i}}t Jel{\'{\i}}nek and
Eva Jel{\'{\i}}nkov{\'{a}} and
Jan Kratochv{\'{\i}}l},
editor = {Thang N. Dinh and
My T. Thai},
title = {On the Hardness of Switching to a Small Number of Edges},
booktitle = {Computing and Combinatorics - 22nd International Conference, {COCOON}
2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9797},
pages = {159--170},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-42634-1\_13},
doi = {10.1007/978-3-319-42634-1\_13},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/JelinekJK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AngeliniCCLBEKK16,
author = {Patrizio Angelini and
Steven Chaplick and
Sabine Cornelsen and
Giordano Da Lozzo and
Giuseppe Di Battista and
Peter Eades and
Philipp Kindermann and
Jan Kratochv{\'{\i}}l and
Fabian Lipp and
Ignaz Rutter},
editor = {Yifan Hu and
Martin N{\"{o}}llenburg},
title = {Simultaneous Orthogonal Planarity},
booktitle = {Graph Drawing and Network Visualization - 24th International Symposium,
{GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9801},
pages = {532--545},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-50106-2\_41},
doi = {10.1007/978-3-319-50106-2\_41},
timestamp = {Sat, 17 Dec 2022 21:30:20 +0100},
biburl = {https://dblp.org/rec/conf/gd/AngeliniCCLBEKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JelinekJK16,
author = {V{\'{\i}}t Jel{\'{\i}}nek and
Eva Jel{\'{\i}}nkov{\'{a}} and
Jan Kratochv{\'{\i}}l},
title = {On the hardness of switching to a small number of edges},
journal = {CoRR},
volume = {abs/1603.00254},
year = {2016},
url = {http://arxiv.org/abs/1603.00254},
eprinttype = {arXiv},
eprint = {1603.00254},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JelinekJK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GavenciakGJKK16,
author = {Tomas Gavenciak and
Przemyslaw Gordinowicz and
V{\'{\i}}t Jel{\'{\i}}nek and
Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l},
title = {Cops and Robbers on Intersection Graphs},
journal = {CoRR},
volume = {abs/1607.08058},
year = {2016},
url = {http://arxiv.org/abs/1607.08058},
eprinttype = {arXiv},
eprint = {1607.08058},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GavenciakGJKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AngeliniCCLBEKK16,
author = {Patrizio Angelini and
Steven Chaplick and
Sabine Cornelsen and
Giordano Da Lozzo and
Giuseppe Di Battista and
Peter Eades and
Philipp Kindermann and
Jan Kratochv{\'{\i}}l and
Fabian Lipp and
Ignaz Rutter},
title = {Simultaneous Orthogonal Planarity},
journal = {CoRR},
volume = {abs/1608.08427},
year = {2016},
url = {http://arxiv.org/abs/1608.08427},
eprinttype = {arXiv},
eprint = {1608.08427},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AngeliniCCLBEKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FialaKKN16,
author = {Jir{\'{\i}} Fiala and
Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Roman Nedela},
title = {Algorithmic Aspects of Regular Graph Covers},
journal = {CoRR},
volume = {abs/1609.03013},
year = {2016},
url = {http://arxiv.org/abs/1609.03013},
eprinttype = {arXiv},
eprint = {1609.03013},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FialaKKN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AngeliniBFJKPR15,
author = {Patrizio Angelini and
Giuseppe Di Battista and
Fabrizio Frati and
V{\'{\i}}t Jel{\'{\i}}nek and
Jan Kratochv{\'{\i}}l and
Maurizio Patrignani and
Ignaz Rutter},
title = {Testing Planarity of Partially Embedded Graphs},
journal = {{ACM} Trans. Algorithms},
volume = {11},
number = {4},
pages = {32:1--32:42},
year = {2015},
url = {https://doi.org/10.1145/2629341},
doi = {10.1145/2629341},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/AngeliniBFJKPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KlavikKOS15,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Toshiki Saitoh},
title = {Extending partial representations of subclasses of chordal graphs},
journal = {Theor. Comput. Sci.},
volume = {576},
pages = {85--101},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.02.007},
doi = {10.1016/J.TCS.2015.02.007},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KlavikKOS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BinucciCDGKKMT15,
author = {Carla Binucci and
Markus Chimani and
Walter Didimo and
Martin Gronemann and
Karsten Klein and
Jan Kratochv{\'{\i}}l and
Fabrizio Montecchiani and
Ioannis G. Tollis},
editor = {Emilio Di Giacomo and
Anna Lubiw},
title = {2-Layer Fan-Planarity: From Caterpillar to Stegosaurus},
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 = {281--294},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-27261-0\_24},
doi = {10.1007/978-3-319-27261-0\_24},
timestamp = {Sun, 13 Nov 2022 09:57:26 +0100},
biburl = {https://dblp.org/rec/conf/gd/BinucciCDGKKMT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GavenciakGJKK15,
author = {Tomas Gavenciak and
Przemyslaw Gordinowicz and
V{\'{\i}}t Jel{\'{\i}}nek and
Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l},
editor = {Khaled M. Elbassioni and
Kazuhisa Makino},
title = {Cops and Robbers on String Graphs},
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 = {355--366},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48971-0\_31},
doi = {10.1007/978-3-662-48971-0\_31},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GavenciakGJKK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/TalonK15,
author = {Alexandre Talon and
Jan Kratochv{\'{\i}}l},
editor = {Rahul Jain and
Sanjay Jain and
Frank Stephan},
title = {Completion of the Mixed Unit Interval Graphs Hierarchy},
booktitle = {Theory and Applications of Models of Computation - 12th Annual Conference,
{TAMC} 2015, Singapore, May 18-20, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9076},
pages = {284--296},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-17142-5\_25},
doi = {10.1007/978-3-319-17142-5\_25},
timestamp = {Mon, 16 Sep 2019 15:30:10 +0200},
biburl = {https://dblp.org/rec/conf/tamc/TalonK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwoca/2014,
editor = {Jan Kratochv{\'{\i}}l and
Mirka Miller and
Dalibor Froncek},
title = {Combinatorial Algorithms - 25th International Workshop, {IWOCA} 2014,
Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8986},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-19315-1},
doi = {10.1007/978-3-319-19315-1},
isbn = {978-3-319-19314-4},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FialaGKKK15,
author = {Jir{\'{\i}} Fiala and
Tomas Gavenciak and
Dusan Knop and
Martin Kouteck{\'{y}} and
Jan Kratochv{\'{\i}}l},
title = {Distance constrained labeling on graphs with bounded neighborhood
diversity},
journal = {CoRR},
volume = {abs/1507.00640},
year = {2015},
url = {http://arxiv.org/abs/1507.00640},
eprinttype = {arXiv},
eprint = {1507.00640},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FialaGKKK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeggernesKO14,
author = {Pinar Heggernes and
Jan Kratochv{\'{\i}}l and
Sang{-}il Oum},
title = {Guest editors' foreword},
journal = {Discret. Appl. Math.},
volume = {168},
pages = {1--2},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.12.012},
doi = {10.1016/J.DAM.2013.12.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HeggernesKO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KratochvilS14,
author = {Jan Kratochv{\'{\i}}l and
Mark H. Siggers},
title = {Locally injective k-colourings of planar graphs},
journal = {Discret. Appl. Math.},
volume = {173},
pages = {53--61},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.03.020},
doi = {10.1016/J.DAM.2014.03.020},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KratochvilS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GavenciakKP14,
author = {Tomas Gavenciak and
Jan Kratochv{\'{\i}}l and
Pawel Pralat},
title = {Firefighting on square, hexagonal, and triangular grids},
journal = {Discret. Math.},
volume = {337},
pages = {142--155},
year = {2014},
url = {https://doi.org/10.1016/j.disc.2014.06.020},
doi = {10.1016/J.DISC.2014.06.020},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GavenciakKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/JelinkovaK14,
author = {Eva Jel{\'{\i}}nkov{\'{a}} and
Jan Kratochv{\'{\i}}l},
title = {On Switching to \emph{H}-Free Graphs},
journal = {J. Graph Theory},
volume = {75},
number = {4},
pages = {387--405},
year = {2014},
url = {https://doi.org/10.1002/jgt.21745},
doi = {10.1002/JGT.21745},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/JelinkovaK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/GrilliHKR14,
author = {Luca Grilli and
Seok{-}Hee Hong and
Jan Kratochv{\'{\i}}l and
Ignaz Rutter},
editor = {Christian A. Duncan and
Antonios Symvonis},
title = {Drawing Simultaneously Embedded Graphs with Few Bends},
booktitle = {Graph Drawing - 22nd International Symposium, {GD} 2014, W{\"{u}}rzburg,
Germany, September 24-26, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8871},
pages = {40--51},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-45803-7\_4},
doi = {10.1007/978-3-662-45803-7\_4},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gd/GrilliHKR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FialaKKN14,
author = {Jir{\'{\i}} Fiala and
Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Roman Nedela},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Algorithmic Aspects of Regular Graph Covers with Applications to Planar
Graphs},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {489--501},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_41},
doi = {10.1007/978-3-662-43948-7\_41},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FialaKKN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LozzoJKR14,
author = {Giordano Da Lozzo and
V{\'{\i}}t Jel{\'{\i}}nek and
Jan Kratochv{\'{\i}}l and
Ignaz Rutter},
editor = {Hee{-}Kap Ahn and
Chan{-}Su Shin},
title = {Planar Embeddings with Small and Uniform Faces},
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 = {633--645},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13075-0\_50},
doi = {10.1007/978-3-319-13075-0\_50},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/LozzoJKR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KratochvilTT14,
author = {Jan Kratochv{\'{\i}}l and
Jan Arne Telle and
Marek Tesar},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Computational Complexity of Covering Three-Vertex Multigraphs},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {493--504},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_42},
doi = {10.1007/978-3-662-44465-8\_42},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/KratochvilTT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KlavikKORSSV14,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Ignaz Rutter and
Toshiki Saitoh and
Maria Saumell and
Tom{\'{a}}s Vyskocil},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Extending Partial Representations of Proper and Unit Interval Graphs},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {253--264},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_22},
doi = {10.1007/978-3-319-08404-6\_22},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/KlavikKORSSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ChaplickDKMS14,
author = {Steven Chaplick and
Paul Dorbec and
Jan Kratochv{\'{\i}}l and
Micka{\"{e}}l Montassier and
Juraj Stacho},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {Contact Representations of Planar Graphs: Extending a Partial Representation
is Hard},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {139--151},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_12},
doi = {10.1007/978-3-319-12340-0\_12},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/ChaplickDKMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FialaKKN14,
author = {Jir{\'{\i}} Fiala and
Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Roman Nedela},
title = {Algorithmic Aspects of Regular Graph Covers with Applications to Planar
Graphs},
journal = {CoRR},
volume = {abs/1402.3774},
year = {2014},
url = {http://arxiv.org/abs/1402.3774},
eprinttype = {arXiv},
eprint = {1402.3774},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FialaKKN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LozzoJKR14,
author = {Giordano Da Lozzo and
V{\'{\i}}t Jel{\'{\i}}nek and
Jan Kratochv{\'{\i}}l and
Ignaz Rutter},
title = {Planar Embeddings with Small and Uniform Faces},
journal = {CoRR},
volume = {abs/1409.4299},
year = {2014},
url = {http://arxiv.org/abs/1409.4299},
eprinttype = {arXiv},
eprint = {1409.4299},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LozzoJKR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrimkovJKKPRST14,
author = {Valentin E. Brimkov and
Konstanty Junosza{-}Szaniawski and
Sean Kafer and
Jan Kratochv{\'{\i}}l and
Martin Pergel and
Pawel Rzazewski and
Matthew Szczepankiewicz and
Joshua Terhaar},
title = {Homothetic Polygons and Beyond: Intersection Graphs, Recognition,
and Maximum Clique},
journal = {CoRR},
volume = {abs/1411.2928},
year = {2014},
url = {http://arxiv.org/abs/1411.2928},
eprinttype = {arXiv},
eprint = {1411.2928},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrimkovJKKPRST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/TalonK14,
author = {Alexandre Talon and
Jan Kratochv{\'{\i}}l},
title = {Completion of the mixed unit interval graphs hierarchy},
journal = {CoRR},
volume = {abs/1412.0540},
year = {2014},
url = {http://arxiv.org/abs/1412.0540},
eprinttype = {arXiv},
eprint = {1412.0540},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/TalonK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/JelinekKR13,
author = {V{\'{\i}}t Jel{\'{\i}}nek and
Jan Kratochv{\'{\i}}l and
Ignaz Rutter},
title = {A Kuratowski-type theorem for planarity of partially embedded graphs},
journal = {Comput. Geom.},
volume = {46},
number = {4},
pages = {466--492},
year = {2013},
url = {https://doi.org/10.1016/j.comgeo.2012.07.005},
doi = {10.1016/J.COMGEO.2012.07.005},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/JelinekKR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Junosza-SzaniawskiKLR13,
author = {Konstanty Junosza{-}Szaniawski and
Jan Kratochv{\'{\i}}l and
Mathieu Liedloff and
Pawel Rzazewski},
title = {Determining the \emph{L}(2, 1)L(2, 1)-span in polynomial space},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2052--2061},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.027},
doi = {10.1016/J.DAM.2013.03.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Junosza-SzaniawskiKLR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KratochvilM13,
author = {Jan Kratochv{\'{\i}}l and
Mirka Miller},
title = {Preface},
journal = {Eur. J. Comb.},
volume = {34},
number = {1},
pages = {1--2},
year = {2013},
url = {https://doi.org/10.1016/j.ejc.2012.07.009},
doi = {10.1016/J.EJC.2012.07.009},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/KratochvilM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KratochvilM13a,
author = {Jan Kratochv{\'{\i}}l and
Mirka Miller},
title = {Preface},
journal = {Eur. J. Comb.},
volume = {34},
number = {3},
pages = {539--540},
year = {2013},
url = {https://doi.org/10.1016/j.ejc.2012.07.022},
doi = {10.1016/J.EJC.2012.07.022},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/KratochvilM13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/JelinekJKLTV13,
author = {V{\'{\i}}t Jel{\'{\i}}nek and
Eva Jel{\'{\i}}nkov{\'{a}} and
Jan Kratochv{\'{\i}}l and
Bernard Lidick{\'{y}} and
Marek Tesar and
Tom{\'{a}}s Vyskocil},
title = {The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree},
journal = {Graphs Comb.},
volume = {29},
number = {4},
pages = {981--1005},
year = {2013},
url = {https://doi.org/10.1007/s00373-012-1157-z},
doi = {10.1007/S00373-012-1157-Z},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/JelinekJKLTV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FialaKL13,
author = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Angsheng Li},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {494},
pages = {1},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.05.030},
doi = {10.1016/J.TCS.2013.05.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FialaKL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Junosza-SzaniawskiKLRR13,
author = {Konstanty Junosza{-}Szaniawski and
Jan Kratochv{\'{\i}}l and
Mathieu Liedloff and
Peter Rossmanith and
Pawel Rzazewski},
title = {Fast exact algorithm for L(2, 1)-labeling of graphs},
journal = {Theor. Comput. Sci.},
volume = {505},
pages = {42--54},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.06.037},
doi = {10.1016/J.TCS.2012.06.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Junosza-SzaniawskiKLRR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GavenciakJKK13,
author = {Tomas Gavenciak and
V{\'{\i}}t Jel{\'{\i}}nek and
Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Cops and Robbers on Intersection Graphs},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {174--184},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_17},
doi = {10.1007/978-3-642-45030-3\_17},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GavenciakJKK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/KratochvilU13,
author = {Jan Kratochv{\'{\i}}l and
Torsten Ueckerdt},
editor = {T.{-}H. Hubert Chan and
Lap Chi Lau and
Luca Trevisan},
title = {Non-crossing Connectors in the Plane},
booktitle = {Theory and Applications of Models of Computation, 10th International
Conference, {TAMC} 2013, Hong Kong, China, May 20-22, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7876},
pages = {108--120},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38236-9\_11},
doi = {10.1007/978-3-642-38236-9\_11},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/KratochvilU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KlavikKOSV13,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Toshiki Saitoh and
Tom{\'{a}}s Vyskocil},
title = {Linear-time Algorithm for Partial Representation Extension of Interval
Graphs},
journal = {CoRR},
volume = {abs/1306.2182},
year = {2013},
url = {http://arxiv.org/abs/1306.2182},
eprinttype = {arXiv},
eprint = {1306.2182},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KlavikKOSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeggernesKP12,
author = {Pinar Heggernes and
Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski},
title = {Guest editors' foreword},
journal = {Discret. Appl. Math.},
volume = {160},
number = {6},
pages = {683--684},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.01.001},
doi = {10.1016/J.DAM.2012.01.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HeggernesKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FialaGKLP12,
author = {Jir{\'{\i}} Fiala and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l and
Bernard Lidick{\'{y}} and
Dani{\"{e}}l Paulusma},
title = {Distance three labelings of trees},
journal = {Discret. Appl. Math.},
volume = {160},
number = {6},
pages = {764--779},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.02.004},
doi = {10.1016/J.DAM.2011.02.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FialaGKLP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachKS12,
author = {Petr A. Golovach and
Jan Kratochv{\'{\i}}l and
Ondrej Such{\'{y}}},
title = {Parameterized complexity of generalized domination problems},
journal = {Discret. Appl. Math.},
volume = {160},
number = {6},
pages = {780--792},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2010.11.012},
doi = {10.1016/J.DAM.2010.11.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolovachKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FrancisKV12,
author = {Mathew C. Francis and
Jan Kratochv{\'{\i}}l and
Tom{\'{a}}s Vyskocil},
title = {Segment representation of a subclass of co-planar graphs},
journal = {Discret. Math.},
volume = {312},
number = {10},
pages = {1815--1818},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2012.01.024},
doi = {10.1016/J.DISC.2012.01.024},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FrancisKV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KlavikKKW12,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Tomasz Krawczyk and
Bartosz Walczak},
editor = {Leah Epstein and
Paolo Ferragina},
title = {Extending Partial Representations of Function Graphs and Permutation
Graphs},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {671--682},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_58},
doi = {10.1007/978-3-642-33090-2\_58},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/KlavikKKW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KlavikKOS12,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Toshiki Saitoh},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {Extending Partial Representations of Subclasses of Chordal Graphs},
booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7676},
pages = {444--454},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_47},
doi = {10.1007/978-3-642-35261-4\_47},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KlavikKOS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Junosza-SzaniawskiKPR12,
author = {Konstanty Junosza{-}Szaniawski and
Jan Kratochv{\'{\i}}l and
Martin Pergel and
Pawel Rzazewski},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {Beyond Homothetic Polygons: Recognition and Maximum Clique},
booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7676},
pages = {619--628},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_64},
doi = {10.1007/978-3-642-35261-4\_64},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Junosza-SzaniawskiKPR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/AbelloKKV12,
author = {James Abello and
Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Tom{\'{a}}s Vyskocil},
editor = {Dimitrios M. Thilikos and
Gerhard J. Woeginger},
title = {{MSOL} Restricted Contractibility to Planar Graphs},
booktitle = {Parameterized and Exact Computation - 7th International Symposium,
{IPEC} 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7535},
pages = {194--205},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33293-7\_19},
doi = {10.1007/978-3-642-33293-7\_19},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/AbelloKKV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DouchaK12,
author = {Martin Doucha and
Jan Kratochv{\'{\i}}l},
editor = {Branislav Rovan and
Vladimiro Sassone and
Peter Widmayer},
title = {Cluster Vertex Deletion: {A} Parameterization between Vertex Cover
and Clique-Width},
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 = {348--359},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32589-2\_32},
doi = {10.1007/978-3-642-32589-2\_32},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DouchaK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Junosza-SzaniawskiKLR12,
author = {Konstanty Junosza{-}Szaniawski and
Jan Kratochv{\'{\i}}l and
Mathieu Liedloff and
Pawel Rzazewski},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {Determining the L(2, 1)-Span in Polynomial Space},
booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International
Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
Selcted Papers},
series = {Lecture Notes in Computer Science},
volume = {7551},
pages = {126--137},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_15},
doi = {10.1007/978-3-642-34611-8\_15},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Junosza-SzaniawskiKLR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ChaplickJKV12,
author = {Steven Chaplick and
V{\'{\i}}t Jel{\'{\i}}nek and
Jan Kratochv{\'{\i}}l and
Tom{\'{a}}s Vyskocil},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles
on a Grill},
booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International
Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
Selcted Papers},
series = {Lecture Notes in Computer Science},
volume = {7551},
pages = {274--285},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_28},
doi = {10.1007/978-3-642-34611-8\_28},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/ChaplickJKV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-0917,
author = {Jan Kratochv{\'{\i}}l and
Torsten Ueckerdt},
title = {Non-crossing Connectors in the Plane},
journal = {CoRR},
volume = {abs/1201.0917},
year = {2012},
url = {http://arxiv.org/abs/1201.0917},
eprinttype = {arXiv},
eprint = {1201.0917},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-0917.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-2915,
author = {V{\'{\i}}t Jel{\'{\i}}nek and
Jan Kratochv{\'{\i}}l and
Ignaz Rutter},
title = {A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs},
journal = {CoRR},
volume = {abs/1204.2915},
year = {2012},
url = {http://arxiv.org/abs/1204.2915},
eprinttype = {arXiv},
eprint = {1204.2915},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-2915.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-6070,
author = {James Abello and
Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Tom{\'{a}}s Vyskocil},
title = {Matching and l-Subgraph Contractibility to Planar Graphs},
journal = {CoRR},
volume = {abs/1204.6070},
year = {2012},
url = {http://arxiv.org/abs/1204.6070},
eprinttype = {arXiv},
eprint = {1204.6070},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-6070.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-6391,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Tomasz Krawczyk and
Bartosz Walczak},
title = {Extending partial representations of function graphs and permutation
graphs},
journal = {CoRR},
volume = {abs/1204.6391},
year = {2012},
url = {http://arxiv.org/abs/1204.6391},
eprinttype = {arXiv},
eprint = {1204.6391},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-6391.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-5159,
author = {Steven Chaplick and
V{\'{\i}}t Jel{\'{\i}}nek and
Jan Kratochv{\'{\i}}l and
Tom{\'{a}}s Vyskocil},
title = {Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles
on a Grill},
journal = {CoRR},
volume = {abs/1206.5159},
year = {2012},
url = {http://arxiv.org/abs/1206.5159},
eprinttype = {arXiv},
eprint = {1206.5159},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-5159.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-0255,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Toshiki Saitoh},
title = {Extending Partial Representations of Subclasses of Chordal Graphs},
journal = {CoRR},
volume = {abs/1207.0255},
year = {2012},
url = {http://arxiv.org/abs/1207.0255},
eprinttype = {arXiv},
eprint = {1207.0255},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-0255.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-6960,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Ignaz Rutter and
Toshiki Saitoh and
Maria Saumell and
Tom{\'{a}}s Vyskocil},
title = {Extending Partial Representations of Proper and Unit Interval Graphs},
journal = {CoRR},
volume = {abs/1207.6960},
year = {2012},
url = {http://arxiv.org/abs/1207.6960},
eprinttype = {arXiv},
eprint = {1207.6960},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-6960.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1210-8113,
author = {Jan Kratochv{\'{\i}}l and
Michal Vaner},
title = {A note on planar partial 3-trees},
journal = {CoRR},
volume = {abs/1210.8113},
year = {2012},
url = {http://arxiv.org/abs/1210.8113},
eprinttype = {arXiv},
eprint = {1210.8113},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1210-8113.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HavetKKKL11,
author = {Fr{\'{e}}d{\'{e}}ric Havet and
Martin Klazar and
Jan Kratochv{\'{\i}}l and
Dieter Kratsch and
Mathieu Liedloff},
title = {Exact Algorithms for \emph{L}(2, 1)-Labeling of Graphs},
journal = {Algorithmica},
volume = {59},
number = {2},
pages = {169--194},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9302-7},
doi = {10.1007/S00453-009-9302-7},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HavetKKKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominGKKL11,
author = {Fedor V. Fomin and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l and
Dieter Kratsch and
Mathieu Liedloff},
title = {Branch and Recharge: Exact Algorithms for Generalized Domination},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {252--273},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9418-9},
doi = {10.1007/S00453-010-9418-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FominGKKL11.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}
}
@article{DBLP:journals/jgt/FominKLMT11,
author = {Fedor V. Fomin and
Jan Kratochv{\'{\i}}l and
Daniel Lokshtanov and
Federico Mancini and
Jan Arne Telle},
title = {On the complexity of reconstructing \emph{H}-free graphs from their
Star Systems},
journal = {J. Graph Theory},
volume = {68},
number = {2},
pages = {113--124},
year = {2011},
url = {https://doi.org/10.1002/jgt.20544},
doi = {10.1002/JGT.20544},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FominKLMT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FialaGK11,
author = {Jir{\'{\i}} Fiala and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l},
title = {Parameterized complexity of coloring problems: Treewidth versus vertex
cover},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {23},
pages = {2513--2523},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.043},
doi = {10.1016/J.TCS.2010.10.043},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FialaGK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Kratochvil11,
author = {Jan Kratochv{\'{\i}}l},
editor = {Ferran Hurtado and
Marc J. van Kreveld},
title = {Can they cross? and how?: (the hitchhiker's guide to the universe
of geometric intersection graphs)},
booktitle = {Proceedings of the 27th {ACM} Symposium on Computational Geometry,
Paris, France, June 13-15, 2011},
pages = {75--76},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1998196.1998208},
doi = {10.1145/1998196.1998208},
timestamp = {Mon, 14 Jun 2021 16:24:49 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Kratochvil11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/JelinekKR11,
author = {V{\'{\i}}t Jel{\'{\i}}nek and
Jan Kratochv{\'{\i}}l and
Ignaz Rutter},
editor = {Ferran Hurtado and
Marc J. van Kreveld},
title = {A kuratowski-type theorem for planarity of partially embedded graphs},
booktitle = {Proceedings of the 27th {ACM} Symposium on Computational Geometry,
Paris, France, June 13-15, 2011},
pages = {107--116},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1998196.1998214},
doi = {10.1145/1998196.1998214},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/JelinekKR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Junosza-SzaniawskiKLRR11,
author = {Konstanty Junosza{-}Szaniawski and
Jan Kratochv{\'{\i}}l and
Mathieu Liedloff and
Peter Rossmanith and
Pawel Rzazewski},
editor = {Mitsunori Ogihara and
Jun Tarui},
title = {Fast Exact Algorithm for \emph{L}(2, 1)-Labeling of Graphs},
booktitle = {Theory and Applications of Models of Computation - 8th Annual Conference,
{TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6648},
pages = {82--93},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20877-5\_9},
doi = {10.1007/978-3-642-20877-5\_9},
timestamp = {Sun, 25 Oct 2020 23:06:59 +0100},
biburl = {https://dblp.org/rec/conf/tamc/Junosza-SzaniawskiKLRR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/KlavikKV11,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Tom{\'{a}}s Vyskocil},
editor = {Mitsunori Ogihara and
Jun Tarui},
title = {Extending Partial Representations of Interval Graphs},
booktitle = {Theory and Applications of Models of Computation - 8th Annual Conference,
{TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6648},
pages = {276--285},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20877-5\_28},
doi = {10.1007/978-3-642-20877-5\_28},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/KlavikKV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2011,
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {Graph-Theoretic Concepts in Computer Science - 37th International
Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June
21-24, 2011. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6986},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1},
doi = {10.1007/978-3-642-25870-1},
isbn = {978-3-642-25869-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeggernesKP10,
author = {Pinar Heggernes and
Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski},
title = {Guest Editors' Foreword},
journal = {Discret. Appl. Math.},
volume = {158},
number = {7},
pages = {729--730},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2010.01.003},
doi = {10.1016/J.DAM.2010.01.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HeggernesKP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KratochvilNR10,
author = {Jan Kratochv{\'{\i}}l and
Jaroslav Nesetril and
Zdenek Ryj{\'{a}}cek},
title = {Preface},
journal = {Discret. Math.},
volume = {310},
number = {3},
pages = {371--372},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.07.025},
doi = {10.1016/J.DISC.2009.07.025},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KratochvilNR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FominGKNS10,
author = {Fedor V. Fomin and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l and
Nicolas Nisse and
Karol Suchan},
title = {Pursuing a fast robber on a graph},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {7-9},
pages = {1167--1181},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2009.12.010},
doi = {10.1016/J.TCS.2009.12.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FominGKNS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/HorvatKP10,
author = {Boris Horvat and
Jan Kratochv{\'{\i}}l and
Tomaz Pisanski},
editor = {Costas S. Iliopoulos and
William F. Smyth},
title = {On the Computational Complexity of Degenerate Unit Distance Representations
of Graphs},
booktitle = {Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010,
London, UK, July 26-28, 2010, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6460},
pages = {274--285},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-19222-7\_28},
doi = {10.1007/978-3-642-19222-7\_28},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/HorvatKP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/CouryHKV10,
author = {Michael D. Coury and
Pavol Hell and
Jan Kratochv{\'{\i}}l and
Tom{\'{a}}s Vyskocil},
editor = {Alejandro L{\'{o}}pez{-}Ortiz},
title = {Faithful Representations of Graphs by Islands in the Extended Grid},
booktitle = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6034},
pages = {131--142},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12200-2\_13},
doi = {10.1007/978-3-642-12200-2\_13},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/CouryHKV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AngeliniBFJKPR10,
author = {Patrizio Angelini and
Giuseppe Di Battista and
Fabrizio Frati and
V{\'{\i}}t Jel{\'{\i}}nek and
Jan Kratochv{\'{\i}}l and
Maurizio Patrignani and
Ignaz Rutter},
editor = {Moses Charikar},
title = {Testing Planarity of Partially Embedded Graphs},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {202--221},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.19},
doi = {10.1137/1.9781611973075.19},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AngeliniBFJKPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tamc/2010,
editor = {Jan Kratochv{\'{\i}}l and
Angsheng Li and
Jir{\'{\i}} Fiala and
Petr Kolman},
title = {Theory and Applications of Models of Computation, 7th Annual Conference,
{TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6108},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13562-0},
doi = {10.1007/978-3-642-13562-0},
isbn = {978-3-642-13561-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/2010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KratochvilPS09,
author = {Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski and
Oriol Serra},
title = {Guest editors' foreword},
journal = {Discret. Appl. Math.},
volume = {157},
number = {12},
pages = {2575--2576},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.09.004},
doi = {10.1016/J.DAM.2008.09.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KratochvilPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/GoaocKOSSW09,
author = {Xavier Goaoc and
Jan Kratochv{\'{\i}}l and
Yoshio Okamoto and
Chan{-}Su Shin and
Andreas Spillner and
Alexander Wolff},
title = {Untangling a Planar Graph},
journal = {Discret. Comput. Geom.},
volume = {42},
number = {4},
pages = {542--569},
year = {2009},
url = {https://doi.org/10.1007/s00454-008-9130-6},
doi = {10.1007/S00454-008-9130-6},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/GoaocKOSSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BonatoGHK09,
author = {Anthony Bonato and
Petr A. Golovach and
Gena Hahn and
Jan Kratochv{\'{\i}}l},
title = {The capture time of a graph},
journal = {Discret. Math.},
volume = {309},
number = {18},
pages = {5588--5595},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.04.004},
doi = {10.1016/J.DISC.2008.04.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BonatoGHK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DouradoGKPS09,
author = {Mitre Costa Dourado and
John G. Gimbel and
Jan Kratochv{\'{\i}}l and
F{\'{a}}bio Protti and
Jayme Luiz Szwarcfiter},
title = {On the computation of the hull number of a graph},
journal = {Discret. Math.},
volume = {309},
number = {18},
pages = {5668--5674},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.04.020},
doi = {10.1016/J.DISC.2008.04.020},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DouradoGKPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FominGKKL09,
author = {Fedor V. Fomin and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l and
Dieter Kratsch and
Mathieu Liedloff},
title = {Sort and Search: Exact algorithms for generalized domination},
journal = {Inf. Process. Lett.},
volume = {109},
number = {14},
pages = {795--798},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.03.023},
doi = {10.1016/J.IPL.2009.03.023},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FominGKKL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/JelinkovaKKPSV09,
author = {Eva Jel{\'{\i}}nkov{\'{a}} and
Jan K{\'{a}}ra and
Jan Kratochv{\'{\i}}l and
Martin Pergel and
Ondrej Such{\'{y}} and
Tom{\'{a}}s Vyskocil},
title = {Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {3},
pages = {379--422},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00192},
doi = {10.7155/JGAA.00192},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/JelinkovaKKPSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/JelinekJKLTV09,
author = {V{\'{\i}}t Jel{\'{\i}}nek and
Eva Jel{\'{\i}}nkov{\'{a}} and
Jan Kratochv{\'{\i}}l and
Bernard Lidick{\'{y}} and
Marek Tesar and
Tom{\'{a}}s Vyskocil},
editor = {David Eppstein and
Emden R. Gansner},
title = {The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree},
booktitle = {Graph Drawing, 17th International Symposium, {GD} 2009, Chicago, IL,
USA, September 22-25, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5849},
pages = {304--315},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11805-0\_29},
doi = {10.1007/978-3-642-11805-0\_29},
timestamp = {Sun, 13 Nov 2022 09:57:30 +0100},
biburl = {https://dblp.org/rec/conf/gd/JelinekJKLTV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/FialaGK09,
author = {Jir{\'{\i}} Fiala and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l},
editor = {Jianer Chen and
S. Barry Cooper},
title = {Parameterized Complexity of Coloring Problems: Treewidth versus Vertex
Cover},
booktitle = {Theory and Applications of Models of Computation, 6th Annual Conference,
{TAMC} 2009, Changsha, China, May 18-22, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5532},
pages = {221--230},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02017-9\_25},
doi = {10.1007/978-3-642-02017-9\_25},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/FialaGK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolovachKS09,
author = {Petr A. Golovach and
Jan Kratochv{\'{\i}}l and
Ondrej Such{\'{y}}},
editor = {Christophe Paul and
Michel Habib},
title = {Parameterized Complexity of Generalized Domination Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {133--142},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_12},
doi = {10.1007/978-3-642-11409-0\_12},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/GolovachKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwoca/2009,
editor = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Mirka Miller},
title = {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},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10217-2},
doi = {10.1007/978-3-642-10217-2},
isbn = {978-3-642-10216-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csr/FialaK08,
author = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l},
title = {Locally constrained graph homomorphisms - structure, complexity, and
applications},
journal = {Comput. Sci. Rev.},
volume = {2},
number = {2},
pages = {97--111},
year = {2008},
url = {https://doi.org/10.1016/j.cosrev.2008.06.001},
doi = {10.1016/J.COSREV.2008.06.001},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csr/FialaK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FialaKP08,
author = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Attila P{\'{o}}r},
title = {On the computational complexity of partial covers of Theta graphs},
journal = {Discret. Appl. Math.},
volume = {156},
number = {7},
pages = {1143--1149},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.05.051},
doi = {10.1016/J.DAM.2007.05.051},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FialaKP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KratochvilP08,
author = {Jan Kratochv{\'{\i}}l and
Martin Pergel},
title = {Intersection graphs of homothetic polygons},
journal = {Electron. Notes Discret. Math.},
volume = {31},
pages = {277--280},
year = {2008},
url = {https://doi.org/10.1016/j.endm.2008.06.056},
doi = {10.1016/J.ENDM.2008.06.056},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KratochvilP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/JelinekJKL08,
author = {V{\'{\i}}t Jel{\'{\i}}nek and
Eva Jel{\'{\i}}nkov{\'{a}} and
Jan Kratochv{\'{\i}}l and
Bernard Lidick{\'{y}}},
editor = {Ioannis G. Tollis and
Maurizio Patrignani},
title = {Clustered Planarity: Embedded Clustered Graphs with Two-Component
Clusters},
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 = {121--132},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-642-00219-9\_13},
doi = {10.1007/978-3-642-00219-9\_13},
timestamp = {Sun, 13 Nov 2022 09:57:30 +0100},
biburl = {https://dblp.org/rec/conf/gd/JelinekJKL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gg/JelinkovaK08,
author = {Eva Jel{\'{\i}}nkov{\'{a}} and
Jan Kratochv{\'{\i}}l},
editor = {Hartmut Ehrig and
Reiko Heckel and
Grzegorz Rozenberg and
Gabriele Taentzer},
title = {On Switching to H-Free Graphs},
booktitle = {Graph Transformations, 4th International Conference, {ICGT} 2008,
Leicester, United Kingdom, September 7-13, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5214},
pages = {379--395},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-87405-8\_26},
doi = {10.1007/978-3-540-87405-8\_26},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gg/JelinkovaK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FialaGK08,
author = {Jir{\'{\i}} Fiala and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Computational Complexity of the Distance Constrained Labeling Problem
for Trees (Extended Abstract)},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {294--305},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_25},
doi = {10.1007/978-3-540-70575-8\_25},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/FialaGK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/FominGK08,
author = {Fedor V. Fomin and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l},
editor = {Giorgio Ausiello and
Juhani Karhum{\"{a}}ki and
Giancarlo Mauri and
C.{-}H. Luke Ong},
title = {On tractability of Cops and Robbers game},
booktitle = {Fifth {IFIP} International Conference On Theoretical Computer Science
- {TCS} 2008, {IFIP} 20th World Computer Congress, {TC} 1, Foundations
of Computer Science, September 7-10, 2008, Milano, Italy},
series = {{IFIP}},
volume = {273},
pages = {171--185},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-09680-3\_12},
doi = {10.1007/978-0-387-09680-3\_12},
timestamp = {Fri, 27 Sep 2019 10:35:17 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/FominGK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/FominKLMT08,
author = {Fedor V. Fomin and
Jan Kratochv{\'{\i}}l and
Daniel Lokshtanov and
Federico Mancini and
Jan Arne Telle},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {On the Complexity of Reconstructing {H} -free Graphs from Their Star
Systems},
booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
pages = {194--205},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_17},
doi = {10.1007/978-3-540-78773-0\_17},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/FominKLMT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/FialaGK08,
author = {Jir{\'{\i}} Fiala and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l},
editor = {Manindra Agrawal and
Ding{-}Zhu Du and
Zhenhua Duan and
Angsheng Li},
title = {Distance Constrained Labelings of Trees},
booktitle = {Theory and Applications of Models of Computation, 5th International
Conference, {TAMC} 2008, Xi'an, China, April 25-29, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4978},
pages = {125--135},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79228-4\_11},
doi = {10.1007/978-3-540-79228-4\_11},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/FialaGK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/GolovachK08,
author = {Petr A. Golovach and
Jan Kratochv{\'{\i}}l},
editor = {Manindra Agrawal and
Ding{-}Zhu Du and
Zhenhua Duan and
Angsheng Li},
title = {Generalized Domination in Degenerate Graphs: {A} Complete Dichotomy
of Computational Complexity},
booktitle = {Theory and Applications of Models of Computation, 5th International
Conference, {TAMC} 2008, Xi'an, China, April 25-29, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4978},
pages = {182--191},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79228-4\_16},
doi = {10.1007/978-3-540-79228-4\_16},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/GolovachK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KratochvilDF07,
author = {Jan Kratochv{\'{\i}}l and
Josep D{\'{\i}}az and
Jir{\'{\i}} Fiala},
title = {Editorial},
journal = {Discret. Appl. Math.},
volume = {155},
number = {2},
pages = {79--80},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2006.05.006},
doi = {10.1016/J.DAM.2006.05.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KratochvilDF07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/KaraKW07,
author = {Jan K{\'{a}}ra and
Jan Kratochv{\'{\i}}l and
David R. Wood},
title = {On the Complexity of the Balanced Vertex Ordering Problem},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {9},
number = {1},
year = {2007},
url = {https://doi.org/10.46298/dmtcs.383},
doi = {10.46298/DMTCS.383},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/KaraKW07.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/kybernetika/MinarikK07,
author = {Vojtech Min{\'{a}}rik and
Jan Kratochv{\'{\i}}l},
title = {Dislocation dynamics - analytical description of the interaction force
between dipolar loops},
journal = {Kybernetika},
volume = {43},
number = {6},
pages = {841--854},
year = {2007},
url = {http://www.kybernetika.cz/content/2007/6/841},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/kybernetika/MinarikK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BadentBGDFGKPPT07,
author = {Melanie Badent and
Carla Binucci and
Emilio Di Giacomo and
Walter Didimo and
Stefan Felsner and
Francesco Giordano and
Jan Kratochv{\'{\i}}l and
Pietro Palladino and
Maurizio Patrignani and
Francesco Trotta},
editor = {Prosenjit Bose},
title = {Homothetic Triangle Contact Representations of Planar Graphs},
booktitle = {Proceedings of the 19th Annual Canadian Conference on Computational
Geometry, {CCCG} 2007, August 20-22, 2007, Carleton University, Ottawa,
Canada},
pages = {233--236},
publisher = {Carleton University, Ottawa, Canada},
year = {2007},
url = {http://cccg.ca/proceedings/2007/09b4.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/BadentBGDFGKPPT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/KratochvilP07,
author = {Jan Kratochv{\'{\i}}l and
Martin Pergel},
editor = {Guohui Lin},
title = {Geometric Intersection Graphs: Do Short Cycles Help?},
booktitle = {Computing and Combinatorics, 13th Annual International Conference,
{COCOON} 2007, Banff, Canada, July 16-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4598},
pages = {118--128},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73545-8\_14},
doi = {10.1007/978-3-540-73545-8\_14},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/KratochvilP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/GoaocKOSW07,
author = {Xavier Goaoc and
Jan Kratochv{\'{\i}}l and
Yoshio Okamoto and
Chan{-}Su Shin and
Alexander Wolff},
editor = {Seok{-}Hee Hong and
Takao Nishizeki and
Wu Quan},
title = {Moving Vertices to Make Drawings Plane},
booktitle = {Graph Drawing, 15th International Symposium, {GD} 2007, Sydney, Australia,
September 24-26, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4875},
pages = {101--112},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77537-9\_13},
doi = {10.1007/978-3-540-77537-9\_13},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/gd/GoaocKOSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/JelinkovaKKPSV07,
author = {Eva Jel{\'{\i}}nkov{\'{a}} and
Jan K{\'{a}}ra and
Jan Kratochv{\'{\i}}l and
Martin Pergel and
Ondrej Such{\'{y}} and
Tom{\'{a}}s Vyskocil},
editor = {Seok{-}Hee Hong and
Takao Nishizeki and
Wu Quan},
title = {Clustered Planarity: Small Clusters in Eulerian Graphs},
booktitle = {Graph Drawing, 15th International Symposium, {GD} 2007, Sydney, Australia,
September 24-26, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4875},
pages = {303--314},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77537-9\_30},
doi = {10.1007/978-3-540-77537-9\_30},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/JelinkovaKKPSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KratochvilKL07,
author = {Jan Kratochv{\'{\i}}l and
Dieter Kratsch and
Mathieu Liedloff},
editor = {Ludek Kucera and
Anton{\'{\i}}n Kucera},
title = {Exact Algorithms for \emph{L} (2, 1)-Labeling of Graphs},
booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International
Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic,
August 26-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4708},
pages = {513--524},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74456-6\_46},
doi = {10.1007/978-3-540-74456-6\_46},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KratochvilKL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/FominGKKL07,
author = {Fedor V. Fomin and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l and
Dieter Kratsch and
Mathieu Liedloff},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Norbert Zeh},
title = {Branch and Recharge: Exact Algorithms for Generalized Domination},
booktitle = {Algorithms and Data Structures, 10th International Workshop, {WADS}
2007, Halifax, Canada, August 15-17, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4619},
pages = {507--518},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73951-7\_44},
doi = {10.1007/978-3-540-73951-7\_44},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/FominGKKL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolovachK07,
author = {Petr A. Golovach and
Jan Kratochv{\'{\i}}l},
editor = {Andreas Brandst{\"{a}}dt and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {Computational Complexity of Generalized Domination: {A} Complete Dichotomy
for Chordal Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop,
{WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4769},
pages = {1--11},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74839-7\_1},
doi = {10.1007/978-3-540-74839-7\_1},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/GolovachK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BroersmaFKW06,
author = {Hajo Broersma and
Fedor V. Fomin and
Jan Kratochv{\'{\i}}l and
Gerhard J. Woeginger},
title = {Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and
Paths Make It Difficult},
journal = {Algorithmica},
volume = {44},
number = {4},
pages = {343--361},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1176-8},
doi = {10.1007/S00453-005-1176-8},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BroersmaFKW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KralKPV06,
author = {Daniel Kr{\'{a}}l and
Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski and
Heinz{-}J{\"{u}}rgen Voss},
title = {Coloring mixed hypertrees},
journal = {Discret. Appl. Math.},
volume = {154},
number = {4},
pages = {660--672},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.05.019},
doi = {10.1016/J.DAM.2005.05.019},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KralKPV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KaraK06,
author = {Jan K{\'{a}}ra and
Jan Kratochv{\'{\i}}l},
editor = {Hans L. Bodlaender and
Michael A. Langston},
title = {Fixed Parameter Tractability of Independent Set in Segment Intersection
Graphs},
booktitle = {Parameterized and Exact Computation, Second International Workshop,
{IWPEC} 2006, Z{\"{u}}rich, Switzerland, September 13-15, 2006,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4169},
pages = {166--174},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11847250\_15},
doi = {10.1007/11847250\_15},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/KaraK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KaufmannKLS06,
author = {Michael Kaufmann and
Jan Kratochv{\'{\i}}l and
Katharina Anna Lehmann and
Amarendran Ramaswami Subramanian},
title = {Max-tolerance graphs as intersection graphs: cliques, cycles, and
recognition},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {832--841},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109649},
timestamp = {Wed, 20 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KaufmannKLS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FialaK06,
author = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l},
editor = {Fedor V. Fomin},
title = {Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy},
booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop,
{WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4271},
pages = {15--26},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11917496\_2},
doi = {10.1007/11917496\_2},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FialaK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KratochvilPS05,
author = {Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski and
Oriol Serra},
title = {Structural decompositions, width parameters, and graph labelings},
journal = {Discret. Appl. Math.},
volume = {145},
number = {2},
pages = {141--142},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.08.002},
doi = {10.1016/J.DAM.2004.08.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KratochvilPS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KloksKM05,
author = {Ton Kloks and
Jan Kratochv{\'{\i}}l and
Haiko M{\"{u}}ller},
title = {Computing the branchwidth of interval graphs},
journal = {Discret. Appl. Math.},
volume = {145},
number = {2},
pages = {266--275},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.01.015},
doi = {10.1016/J.DAM.2004.01.015},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KloksKM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FialaKP05,
author = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski},
title = {Systems of distant representatives},
journal = {Discret. Appl. Math.},
volume = {145},
number = {2},
pages = {306--316},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.02.018},
doi = {10.1016/J.DAM.2004.02.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FialaKP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FialaKP05,
author = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Attila P{\'{o}}r},
title = {On the computational complexity of partial covers of Theta graphs},
journal = {Electron. Notes Discret. Math.},
volume = {19},
pages = {79--85},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.05.012},
doi = {10.1016/J.ENDM.2005.05.012},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FialaKP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KoubekK05,
author = {V{\'{a}}clav Koubek and
Jan Kratochv{\'{\i}}l},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {345},
number = {2-3},
pages = {171--172},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.07.005},
doi = {10.1016/J.TCS.2005.07.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KoubekK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/KaraKW05,
author = {Jan K{\'{a}}ra and
Jan Kratochv{\'{\i}}l and
David R. Wood},
editor = {Lusheng Wang},
title = {On the Complexity of the Balanced Vertex Ordering Problem},
booktitle = {Computing and Combinatorics, 11th Annual International Conference,
{COCOON} 2005, Kunming, China, August 16-29, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3595},
pages = {849--858},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11533719\_86},
doi = {10.1007/11533719\_86},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/KaraKW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FialaGK05,
author = {Jir{\'{\i}} Fiala and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {Distance Constrained Labelings of Graphs of Bounded Treewidth},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {360--372},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_30},
doi = {10.1007/11523468\_30},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FialaGK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/FialaK05,
author = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l},
editor = {Mario Coppo and
Elena Lodi and
G. Michele Pinna},
title = {On the Computational Complexity of the \emph{L}\({}_{\mbox{(2, 1)}}\)-Labeling
Problem for Regular Graphs},
booktitle = {Theoretical Computer Science, 9th Italian Conference, {ICTCS} 2005,
Siena, Italy, October 12-14, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3701},
pages = {228--236},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11560586\_19},
doi = {10.1007/11560586\_19},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/FialaK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KralKV04,
author = {Daniel Kr{\'{a}}l and
Jan Kratochv{\'{\i}}l and
Heinz{-}J{\"{u}}rgen Voss},
title = {Mixed hypercacti},
journal = {Discret. Math.},
volume = {286},
number = {1-2},
pages = {99--113},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2003.11.051},
doi = {10.1016/J.DISC.2003.11.051},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KralKV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FialaGK04,
author = {Jir{\'{\i}} Fiala and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l},
editor = {Juraj Hromkovic and
Manfred Nagl and
Bernhard Westfechtel},
title = {Elegant Distance Constrained Labelings of Trees},
booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG
2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3353},
pages = {58--67},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30559-0\_5},
doi = {10.1007/978-3-540-30559-0\_5},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FialaGK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2004,
editor = {Jir{\'{\i}} Fiala and
V{\'{a}}clav Koubek and
Jan Kratochv{\'{\i}}l},
title = {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},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/b99679},
doi = {10.1007/B99679},
isbn = {3-540-22823-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/2004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KralKV03,
author = {Daniel Kr{\'{a}}l and
Jan Kratochv{\'{\i}}l and
Heinz{-}J{\"{u}}rgen Voss},
title = {Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs},
journal = {Theor. Comput. Sci.},
volume = {295},
pages = {263--278},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00408-5},
doi = {10.1016/S0304-3975(02)00408-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KralKV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KratochvilP03,
author = {Jan Kratochv{\'{\i}}l and
Martin Pergel},
editor = {Giuseppe Liotta},
title = {Two Results on Intersection Graphs of Polygons},
booktitle = {Graph Drawing, 11th International Symposium, {GD} 2003, Perugia, Italy,
September 21-24, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2912},
pages = {59--70},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24595-7\_6},
doi = {10.1007/978-3-540-24595-7\_6},
timestamp = {Sun, 13 Nov 2022 09:57:34 +0100},
biburl = {https://dblp.org/rec/conf/gd/KratochvilP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Kratochvil03,
author = {Jan Kratochv{\'{\i}}l},
editor = {Hans L. Bodlaender},
title = {Complexity of Hypergraph Coloring and Seidel's Switching},
booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop,
{WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2880},
pages = {297--308},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_26},
doi = {10.1007/978-3-540-39890-5\_26},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Kratochvil03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HahnKSS02,
author = {Gena Hahn and
Jan Kratochv{\'{\i}}l and
Jozef Sir{\'{a}}n and
Dominique Sotteau},
title = {On the injective chromatic number of graphs},
journal = {Discret. Math.},
volume = {256},
number = {1-2},
pages = {179--192},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00466-6},
doi = {10.1016/S0012-365X(01)00466-6},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/HahnKSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/FialaK02,
author = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l},
title = {Partial covers of graphs},
journal = {Discuss. Math. Graph Theory},
volume = {22},
number = {1},
pages = {89--99},
year = {2002},
url = {https://doi.org/10.7151/dmgt.1159},
doi = {10.7151/DMGT.1159},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/FialaK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KratochvilT02,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza},
title = {On the complexity of bicoloring clique hypergraphs of graphs},
journal = {J. Algorithms},
volume = {45},
number = {1},
pages = {40--54},
year = {2002},
url = {https://doi.org/10.1016/S0196-6774(02)00221-3},
doi = {10.1016/S0196-6774(02)00221-3},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/KratochvilT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FraysseixK02,
author = {Hubert de Fraysseix and
Jan Kratochv{\'{\i}}l},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {1},
pages = {3--5},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00042},
doi = {10.7155/JGAA.00042},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FraysseixK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/FialaKP02,
author = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski},
editor = {Stephen G. Kobourov and
Michael T. Goodrich},
title = {Geometric Systems of Disjoint Representatives},
booktitle = {Graph Drawing, 10th International Symposium, {GD} 2002, Irvine, CA,
USA, August 26-28, 2002, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2528},
pages = {110--117},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36151-0\_11},
doi = {10.1007/3-540-36151-0\_11},
timestamp = {Sun, 13 Nov 2022 09:57:34 +0100},
biburl = {https://dblp.org/rec/conf/gd/FialaKP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BroersmaFKW02,
author = {Hajo Broersma and
Fedor V. Fomin and
Jan Kratochv{\'{\i}}l and
Gerhard J. Woeginger},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths
Are Dangerous},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {160--169},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_17},
doi = {10.1007/3-540-45471-3\_17},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BroersmaFKW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KratochvilTV02,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza and
Margit Voigt},
editor = {Ludek Kucera},
title = {On the b-Chromatic Number of Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {310--320},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_27},
doi = {10.1007/3-540-36379-3\_27},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KratochvilTV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FialaKK01,
author = {Jir{\'{\i}} Fiala and
Ton Kloks and
Jan Kratochv{\'{\i}}l},
title = {Fixed-parameter complexity of lambda-labelings},
journal = {Discret. Appl. Math.},
volume = {113},
number = {1},
pages = {59--72},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00387-5},
doi = {10.1016/S0166-218X(00)00387-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FialaKK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FiedlerKN01a,
author = {Miroslav Fiedler and
Jan Kratochv{\'{\i}}l and
Jaroslav Nesetril},
title = {{DIMATIA} surveys (related to the Fifth Czech and Slovak Symposium
on Combinatorics, Graph Theory, Algorithms and Applications held in
Prague on July 6-11, 1998)},
journal = {Discret. Math.},
volume = {229},
number = {1-3},
pages = {1--2},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00222-3},
doi = {10.1016/S0012-365X(00)00222-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FiedlerKN01a.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/FiedlerKN01,
author = {Miroslav Fiedler and
Jan Kratochv{\'{\i}}l and
Jaroslav Nesetril},
title = {Foreword},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {1--2},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00223-5},
doi = {10.1016/S0012-365X(00)00223-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FiedlerKN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BabelKKKMO01,
author = {Luitpold Babel and
Ton Kloks and
Jan Kratochv{\'{\i}}l and
Dieter Kratsch and
Haiko M{\"{u}}ller and
Stephan Olariu},
title = {Efficient algorithms for graphs with few \emph{P}\({}_{\mbox{4}}\)'s},
journal = {Discret. Math.},
volume = {235},
number = {1-3},
pages = {29--51},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00258-2},
doi = {10.1016/S0012-365X(00)00258-2},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BabelKKKMO01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/FialaKP01,
author = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski},
editor = {Antonio Restivo and
Simona Ronchi Della Rocca and
Luca Roversi},
title = {Distance Constrained Labeling of Precolored Trees},
booktitle = {Theoretical Computer Science, 7th Italian Conference, {ICTCS} 2001,
Torino, Italy, October 4-6, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2202},
pages = {285--292},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45446-2\_18},
doi = {10.1007/3-540-45446-2\_18},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/FialaKP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FialaK01,
author = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l},
editor = {Peter Eades and
Tadao Takaoka},
title = {Complexity of Partial Covers of Graphs},
booktitle = {Algorithms and Computation, 12th International Symposium, {ISAAC}
2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2223},
pages = {537--549},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45678-3\_46},
doi = {10.1007/3-540-45678-3\_46},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FialaK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KralKV01,
author = {Daniel Kr{\'{a}}l and
Jan Kratochv{\'{\i}}l and
Heinz{-}J{\"{u}}rgen Voss},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Complexity Note on Mixed Hypergraphs},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {474--486},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_42},
doi = {10.1007/3-540-44683-4\_42},
timestamp = {Sat, 19 Oct 2019 20:31:50 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KralKV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KralKTW01,
author = {Daniel Kr{\'{a}}l and
Jan Kratochv{\'{\i}}l and
Zsolt Tuza and
Gerhard J. Woeginger},
editor = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Complexity of Coloring Graphs without Forbidden Induced Subgraphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop,
{WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2204},
pages = {254--262},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45477-2\_23},
doi = {10.1007/3-540-45477-2\_23},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KralKTW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HalldorssonKT00,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jan Kratochv{\'{\i}}l and
Jan Arne Telle},
title = {Independent Sets with Domination Constraints},
journal = {Discret. Appl. Math.},
volume = {99},
number = {1-3},
pages = {39--54},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00124-9},
doi = {10.1016/S0166-218X(99)00124-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HalldorssonKT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KratochvilM00,
author = {Jan Kratochv{\'{\i}}l and
Peter Mih{\'{o}}k},
title = {Hom-properties are uniquely factorizable into irreducible factors},
journal = {Discret. Math.},
volume = {213},
number = {1-3},
pages = {189--194},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00179-X},
doi = {10.1016/S0012-365X(99)00179-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KratochvilM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/HalldorssonKT00,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jan Kratochv{\'{\i}}l and
Jan Arne Telle},
title = {Mod-2 Independence and Domination in Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {355--363},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000272},
doi = {10.1142/S0129054100000272},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/HalldorssonKT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KratochvilT00,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza},
editor = {David B. Shmoys},
title = {On the complexity of bicoloring clique hypergraphs of graphs (extended
abstract)},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {40--41},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338230},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/KratochvilT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KralKPV00,
author = {Daniel Kr{\'{a}}l and
Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski and
Heinz{-}J{\"{u}}rgen Voss},
editor = {Ulrik Brandes and
Dorothea Wagner},
title = {Coloring Mixed Hypertrees},
booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop,
{WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1928},
pages = {279--289},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40064-8\_26},
doi = {10.1007/3-540-40064-8\_26},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KralKPV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KratochvilT99,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza},
title = {Rankings of Directed Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {12},
number = {3},
pages = {374--384},
year = {1999},
url = {https://doi.org/10.1137/S0895480197330242},
doi = {10.1137/S0895480197330242},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KratochvilT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KloksKM99,
author = {Ton Kloks and
Jan Kratochv{\'{\i}}l and
Haiko M{\"{u}}ller},
editor = {Christoph Meinel and
Sophie Tison},
title = {New Branchwidth Territories},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {173--183},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_16},
doi = {10.1007/3-540-49116-3\_16},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KloksKM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HalldorssonKT99,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jan Kratochv{\'{\i}}l and
Jan Arne Telle},
editor = {Peter Widmayer and
Gabriele Neyer and
Stephan J. Eidenbenz},
title = {Mod-2 Independence and Domination in Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop,
{WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1665},
pages = {101--109},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46784-X\_11},
doi = {10.1007/3-540-46784-X\_11},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/wg/HalldorssonKT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FialaKK99,
author = {Jir{\'{\i}} Fiala and
Ton Kloks and
Jan Kratochv{\'{\i}}l},
editor = {Peter Widmayer and
Gabriele Neyer and
Stephan J. Eidenbenz},
title = {Fixed-Parameter Complexity of lambda-Labelings},
booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop,
{WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1665},
pages = {350--363},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46784-X\_33},
doi = {10.1007/3-540-46784-X\_33},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/FialaKK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs49,
editor = {Ronald L. Graham and
Jan Kratochv{\'{\i}}l and
Jaroslav Nesetril and
Fred S. Roberts},
title = {Contemporary Trends in Discrete Mathematics: From {DIMACS} and {DIMATIA}
to the Future, Proceedings of a {DIMACS} Workshop, Stir{\'{\i}}n
Castle, Czech Republic, May 19-25, 1997},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {49},
publisher = {{DIMACS/AMS}},
year = {1999},
url = {https://doi.org/10.1090/dimacs/049},
doi = {10.1090/DIMACS/049},
isbn = {0-8218-0963-6},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/dimacs49.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/gd/1999,
editor = {Jan Kratochv{\'{\i}}l},
title = {Graph Drawing, 7th International Symposium, GD'99, Stir{\'{\i}}n
Castle, Czech Republic, September 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1731},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46648-7},
doi = {10.1007/3-540-46648-7},
isbn = {3-540-66904-3},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/1999.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/KratochvilMMP98,
author = {Jan Kratochv{\'{\i}}l and
Paul D. Manuel and
Mirka Miller and
Andrzej Proskurowski},
title = {Disjoint and unfolding domination in graphs},
journal = {Australas. {J} Comb.},
volume = {18},
pages = {277--292},
year = {1998},
url = {http://ajc.maths.uq.edu.au/pdf/18/ocr-ajc-v18-p277.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/KratochvilMMP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KratochvilK98,
author = {Jan Kratochv{\'{\i}}l and
Ales Kubena},
title = {On intersection representations of co-planar graphs},
journal = {Discret. Math.},
volume = {178},
number = {1-3},
pages = {251--255},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(97)81834-1},
doi = {10.1016/S0012-365X(97)81834-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KratochvilK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KratochvilTV98,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza and
Margit Voigt},
title = {Complexity of choosing subsets from color sets},
journal = {Discret. Math.},
volume = {191},
number = {1-3},
pages = {139--148},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(98)00101-0},
doi = {10.1016/S0012-365X(98)00101-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KratochvilTV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KratochvilTV98,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza and
Margit Voigt},
title = {Brooks-type theorems for choosability with separation},
journal = {J. Graph Theory},
volume = {27},
number = {1},
pages = {43--49},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1097-0118(199801)27:1\&\#60;43::AID-JGT7\&\#62;3.0.CO;2-G},
doi = {10.1002/(SICI)1097-0118(199801)27:1\&\#60;43::AID-JGT7\&\#62;3.0.CO;2-G},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KratochvilTV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/KratochvilPT98,
author = {Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski and
Jan Arne Telle},
title = {On the Complexity of Graph Covering Problems},
journal = {Nord. J. Comput.},
volume = {5},
number = {3},
pages = {173--195},
year = {1998},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/KratochvilPT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Kratochvil98,
author = {Jan Kratochv{\'{\i}}l},
editor = {Sue Whitesides},
title = {Crossing Number of Abstract Topological Graphs},
booktitle = {Graph Drawing, 6th International Symposium, GD'98, Montr{\'{e}}al,
Canada, August 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1547},
pages = {238--245},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-37623-2\_18},
doi = {10.1007/3-540-37623-2\_18},
timestamp = {Sun, 13 Nov 2022 09:57:36 +0100},
biburl = {https://dblp.org/rec/conf/gd/Kratochvil98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Telle98,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jan Kratochv{\'{\i}}l and
Jan Arne Telle},
editor = {Kim Guldstrand Larsen and
Sven Skyum and
Glynn Winskel},
title = {Independent Sets with Domination Constraints},
booktitle = {Automata, Languages and Programming, 25th International Colloquium,
ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1443},
pages = {176--187},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055051},
doi = {10.1007/BFB0055051},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Telle98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KratochvilT98,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza},
editor = {Juraj Hromkovic and
Ondrej S{\'{y}}kora},
title = {Rankings of Directed Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop,
{WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1517},
pages = {114--123},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/10692760\_10},
doi = {10.1007/10692760\_10},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KratochvilT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DahlhausKMM97,
author = {Elias Dahlhaus and
Jan Kratochv{\'{\i}}l and
Paul D. Manuel and
Mirka Miller},
title = {Transversal Partitioning in Balanced Hypergraphs},
journal = {Discret. Appl. Math.},
volume = {79},
number = {1-3},
pages = {75--89},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(97)00034-6},
doi = {10.1016/S0166-218X(97)00034-6},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DahlhausKMM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KostochkaK97,
author = {Alexandr V. Kostochka and
Jan Kratochv{\'{\i}}l},
title = {Covering and coloring polygon-circle graphs},
journal = {Discret. Math.},
volume = {163},
number = {1-3},
pages = {299--305},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00344-5},
doi = {10.1016/S0012-365X(96)00344-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KostochkaK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/KratochvilMS97,
author = {Jan Kratochv{\'{\i}}l and
Peter Mih{\'{o}}k and
Gabriel Semanisin},
title = {Graphs maximal with respect to hom-properties},
journal = {Discuss. Math. Graph Theory},
volume = {17},
number = {1},
pages = {77--88},
year = {1997},
url = {https://doi.org/10.7151/dmgt.1040},
doi = {10.7151/DMGT.1040},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmgt/KratochvilMS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/KratochvilS97,
author = {Jan Kratochv{\'{\i}}l and
Ingo Schiermeyer},
title = {On the computational complexity of (O, P)-partition problems},
journal = {Discuss. Math. Graph Theory},
volume = {17},
number = {2},
pages = {253--258},
year = {1997},
url = {https://doi.org/10.7151/dmgt.1052},
doi = {10.7151/DMGT.1052},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/KratochvilS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KratochvilPT97,
author = {Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski and
Jan Arne Telle},
title = {Covering Regular Graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {71},
number = {1},
pages = {1--16},
year = {1997},
url = {https://doi.org/10.1006/jctb.1996.1743},
doi = {10.1006/JCTB.1996.1743},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KratochvilPT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KratochvilS97,
author = {Jan Kratochv{\'{\i}}l and
Andr{\'{a}}s Seb{\"{o}}},
title = {Coloring precolored perfect graphs},
journal = {J. Graph Theory},
volume = {25},
number = {3},
pages = {207--215},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199707)25:3\&\#60;207::AID-JGT4\&\#62;3.0.CO;2-P},
doi = {10.1002/(SICI)1097-0118(199707)25:3\&\#60;207::AID-JGT4\&\#62;3.0.CO;2-P},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KratochvilS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/KratochvilTV97,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza and
Margit Voigt},
editor = {Ronald L. Graham and
Jan Kratochv{\'{\i}}l and
Jaroslav Nesetril and
Fred S. Roberts},
title = {New trends in the theory of graph colorings: Choosability and list
coloring},
booktitle = {Contemporary Trends in Discrete Mathematics: From {DIMACS} and {DIMATIA}
to the Future, Proceedings of a {DIMACS} Workshop, Stir{\'{\i}}n
Castle, Czech Republic, May 19-25, 1997},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {49},
pages = {183--197},
publisher = {{DIMACS/AMS}},
year = {1997},
url = {https://doi.org/10.1090/dimacs/049/13},
doi = {10.1090/DIMACS/049/13},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/KratochvilTV97.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/wg/KratochvilPT97,
author = {Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski and
Jan Arne Telle},
editor = {Rolf H. M{\"{o}}hring},
title = {Complexity of Colored Graph Covers I. Colored Directed Multigraphs},
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 = {242--257},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0024502},
doi = {10.1007/BFB0024502},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/KratochvilPT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Kratochvil96,
author = {Jan Kratochv{\'{\i}}l},
editor = {Stephen C. North},
title = {Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane},
booktitle = {Graph Drawing, Symposium on Graph Drawing, {GD} '96, Berkeley, California,
USA, September 18-20, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1190},
pages = {257--270},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-62495-3\_53},
doi = {10.1007/3-540-62495-3\_53},
timestamp = {Sun, 13 Nov 2022 09:57:38 +0100},
biburl = {https://dblp.org/rec/conf/gd/Kratochvil96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FellowsKMP95,
author = {Michael R. Fellows and
Jan Kratochv{\'{\i}}l and
Matthias Middendorf and
Frank Pfeiffer},
title = {The Complexity of Induced Minors and Related Problems},
journal = {Algorithmica},
volume = {13},
number = {3},
pages = {266--282},
year = {1995},
url = {https://doi.org/10.1007/BF01190507},
doi = {10.1007/BF01190507},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FellowsKMP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/KratochvilMM95,
author = {Jan Kratochv{\'{\i}}l and
Paul D. Manuel and
Mirka Miller},
title = {Generalized Domination in Chordal Graphs},
journal = {Nord. J. Comput.},
volume = {2},
number = {1},
pages = {41--50},
year = {1995},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/KratochvilMM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KratochvilP95,
author = {Jan Kratochv{\'{\i}}l and
Teresa M. Przytycka},
editor = {Franz{-}Josef Brandenburg},
title = {Grid Intersection and Box Intersection Graphs on Surfaces (Extended
Abstract)},
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 = {365--372},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/BFb0021820},
doi = {10.1007/BFB0021820},
timestamp = {Sun, 13 Nov 2022 09:57:38 +0100},
biburl = {https://dblp.org/rec/conf/gd/KratochvilP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KratochvilT94,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza},
title = {Algorithmic complexity of list colorings},
journal = {Discret. Appl. Math.},
volume = {50},
number = {3},
pages = {297--302},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90150-3},
doi = {10.1016/0166-218X(94)90150-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KratochvilT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Kratochvil94,
author = {Jan Kratochv{\'{\i}}l},
title = {A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness},
journal = {Discret. Appl. Math.},
volume = {52},
number = {3},
pages = {233--252},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90143-0},
doi = {10.1016/0166-218X(94)90143-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Kratochvil94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Kratochvil94,
author = {Jan Kratochv{\'{\i}}l},
title = {Regular codes in regular graphs are difficult},
journal = {Discret. Math.},
volume = {133},
number = {1-3},
pages = {191--205},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(94)90026-4},
doi = {10.1016/0012-365X(94)90026-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Kratochvil94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KratochvilT94,
author = {Jan Kratochv{\'{\i}}l and
Zsolt Tuza},
title = {Intersection Dimensions of Graph Classes},
journal = {Graphs Comb.},
volume = {10},
number = {2-4},
pages = {159--168},
year = {1994},
url = {https://doi.org/10.1007/BF02986660},
doi = {10.1007/BF02986660},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KratochvilT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KratochvilM94,
author = {Jan Kratochv{\'{\i}}l and
Jir{\'{\i}} Matousek},
title = {Intersection Graphs of Segments},
journal = {J. Comb. Theory, Ser. {B}},
volume = {62},
number = {2},
pages = {289--315},
year = {1994},
url = {https://doi.org/10.1006/jctb.1994.1071},
doi = {10.1006/JCTB.1994.1071},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KratochvilM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KratochvilPT94,
author = {Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski and
Jan Arne Telle},
editor = {Ernst W. Mayr and
Gunther Schmidt and
Gottfried Tinhofer},
title = {Complexity of Graph Covering Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop,
{WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {903},
pages = {93--105},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-59071-4\_40},
doi = {10.1007/3-540-59071-4\_40},
timestamp = {Sun, 02 Oct 2022 16:17:33 +0200},
biburl = {https://dblp.org/rec/conf/wg/KratochvilPT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/KratochvilK93,
author = {Jan Kratochv{\'{\i}}l and
Mirko Kriv{\'{a}}nek},
title = {Satisfiability of Co-Nested Formulas},
journal = {Acta Informatica},
volume = {30},
number = {4},
pages = {397--403},
year = {1993},
url = {https://doi.org/10.1007/BF01209713},
doi = {10.1007/BF01209713},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/KratochvilK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KratochvilST93,
author = {Jan Kratochv{\'{\i}}l and
Petr Savick{\'{y}} and
Zsolt Tuza},
title = {One More Occurrence of Variables Makes Satisfiability Jump From Trivial
to NP-Complete},
journal = {{SIAM} J. Comput.},
volume = {22},
number = {1},
pages = {203--210},
year = {1993},
url = {https://doi.org/10.1137/0222015},
doi = {10.1137/0222015},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KratochvilST93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KratochvilP92,
author = {Jan Kratochv{\'{\i}}l and
Svatopluk Poljak},
title = {Compatible 2-factors},
journal = {Discret. Appl. Math.},
volume = {36},
number = {3},
pages = {253--266},
year = {1992},
url = {https://doi.org/10.1016/0166-218X(92)90257-B},
doi = {10.1016/0166-218X(92)90257-B},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KratochvilP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JansonK92,
author = {Svante Janson and
Jan Kratochv{\'{\i}}l},
title = {Thresholds for classes of intersection graphs},
journal = {Discret. Math.},
volume = {108},
number = {1-3},
pages = {307--326},
year = {1992},
url = {https://doi.org/10.1016/0012-365X(92)90684-8},
doi = {10.1016/0012-365X(92)90684-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/JansonK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kratochvil91,
author = {Jan Kratochv{\'{\i}}l},
title = {String graphs. I. The number of critical nonstring graphs is infinite},
journal = {J. Comb. Theory, Ser. {B}},
volume = {52},
number = {1},
pages = {53--66},
year = {1991},
url = {https://doi.org/10.1016/0095-8956(91)90090-7},
doi = {10.1016/0095-8956(91)90090-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kratochvil91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kratochvil91a,
author = {Jan Kratochv{\'{\i}}l},
title = {String graphs. {II.} recognizing string graphs is NP-hard},
journal = {J. Comb. Theory, Ser. {B}},
volume = {52},
number = {1},
pages = {67--78},
year = {1991},
url = {https://doi.org/10.1016/0095-8956(91)90091-W},
doi = {10.1016/0095-8956(91)90091-W},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kratochvil91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KratochvilM91,
author = {Jan Kratochv{\'{\i}}l and
Jir{\'{\i}} Matousek},
title = {String graphs requiring exponential representations},
journal = {J. Comb. Theory, Ser. {B}},
volume = {53},
number = {1},
pages = {1--4},
year = {1991},
url = {https://doi.org/10.1016/0095-8956(91)90050-T},
doi = {10.1016/0095-8956(91)90050-T},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KratochvilM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JansonK91,
author = {Svante Janson and
Jan Kratochv{\'{\i}}l},
title = {Proportional Graphs},
journal = {Random Struct. Algorithms},
volume = {2},
number = {2},
pages = {209--224},
year = {1991},
url = {https://doi.org/10.1002/rsa.3240020205},
doi = {10.1002/RSA.3240020205},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JansonK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KratochvilLN91,
author = {Jan Kratochv{\'{\i}}l and
Anna Lubiw and
Jaroslav Nesetril},
title = {Noncrossing Subgraphs in Topological Layouts},
journal = {{SIAM} J. Discret. Math.},
volume = {4},
number = {2},
pages = {223--244},
year = {1991},
url = {https://doi.org/10.1137/0404022},
doi = {10.1137/0404022},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KratochvilLN91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gst/FellowsKMP91,
author = {Michael R. Fellows and
Jan Kratochv{\'{\i}}l and
Matthias Middendorf and
Frank Pfeiffer},
editor = {Neil Robertson and
Paul D. Seymour},
title = {Induced minors and related problems},
booktitle = {Graph Structure Theory, Proceedings of a {AMS-IMS-SIAM} Joint Summer
Research Conference on Graph Minors held June 22 to July 5, 1991,
at the University of Washington, Seattle, {USA}},
series = {Contemporary Mathematics},
volume = {147},
pages = {179--182},
publisher = {American Mathematical Society},
year = {1991},
timestamp = {Fri, 27 Aug 2021 14:49:51 +0200},
biburl = {https://dblp.org/rec/conf/gst/FellowsKMP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KratochvilZ88,
author = {Jan Kratochv{\'{\i}}l and
Dainis Zeps},
title = {On the number of Hamiltonian cycles in triangulations},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {191--194},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120209},
doi = {10.1002/JGT.3190120209},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KratochvilZ88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HellKKK88,
author = {Pavol Hell and
David G. Kirkpatrick and
Jan Kratochv{\'{\i}}l and
Igor Kr{\'{\i}}z},
title = {On Restricted Two-Factors},
journal = {{SIAM} J. Discret. Math.},
volume = {1},
number = {4},
pages = {472--484},
year = {1988},
url = {https://doi.org/10.1137/0401046},
doi = {10.1137/0401046},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HellKKK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KratochvilK88,
author = {Jan Kratochv{\'{\i}}l and
Mirko Kriv{\'{a}}nek},
editor = {Michal Chytil and
Ladislav Janiga and
V{\'{a}}clav Koubek},
title = {On the Computational Complexity of Codes in Graphs},
booktitle = {Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad,
Czechoslovakia, August 29 - September 2, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {324},
pages = {396--404},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/BFb0017162},
doi = {10.1007/BFB0017162},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KratochvilK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kratochvil86,
author = {Jan Kratochv{\'{\i}}l},
title = {Perfect codes over graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {40},
number = {2},
pages = {224--228},
year = {1986},
url = {https://doi.org/10.1016/0095-8956(86)90079-1},
doi = {10.1016/0095-8956(86)90079-1},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kratochvil86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
