Published in: LIPIcs, Volume 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)
Zdeněk Dvořák. Representation of Short Distances in Structurally Sparse Graphs. In 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 254, pp. 28:1-28:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{dvorak:LIPIcs.STACS.2023.28, author = {Dvo\v{r}\'{a}k, Zden\v{e}k}, title = {{Representation of Short Distances in Structurally Sparse Graphs}}, booktitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)}, pages = {28:1--28:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-266-2}, ISSN = {1868-8969}, year = {2023}, volume = {254}, editor = {Berenbrink, Petra and Bouyer, Patricia and Dawar, Anuj and Kant\'{e}, Mamadou Moustapha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.28}, URN = {urn:nbn:de:0030-drops-176807}, doi = {10.4230/LIPIcs.STACS.2023.28}, annote = {Keywords: distances, structurally sparse graphs} }
Published in: LIPIcs, Volume 227, 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)
Zdeněk Dvořák. Approximation Metatheorems for Classes with Bounded Expansion. In 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 227, pp. 22:1-22:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dvorak:LIPIcs.SWAT.2022.22, author = {Dvo\v{r}\'{a}k, Zden\v{e}k}, title = {{Approximation Metatheorems for Classes with Bounded Expansion}}, booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)}, pages = {22:1--22:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-236-5}, ISSN = {1868-8969}, year = {2022}, volume = {227}, editor = {Czumaj, Artur and Xin, Qin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.22}, URN = {urn:nbn:de:0030-drops-161823}, doi = {10.4230/LIPIcs.SWAT.2022.22}, annote = {Keywords: bounded expansion, approximation, meta-algorithms} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Zdeněk Dvořák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, and Torsten Ueckerdt. On Comparable Box Dimension. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 38:1-38:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dvorak_et_al:LIPIcs.SoCG.2022.38, author = {Dvo\v{r}\'{a}k, Zden\v{e}k and Gon\c{c}alves, Daniel and Lahiri, Abhiruk and Tan, Jane and Ueckerdt, Torsten}, title = {{On Comparable Box Dimension}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {38:1--38:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.38}, URN = {urn:nbn:de:0030-drops-160461}, doi = {10.4230/LIPIcs.SoCG.2022.38}, annote = {Keywords: geometric graphs, minor-closed graph classes, treewidth fragility} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Zdeněk Dvořák, Jakub Pekárek, Torsten Ueckerdt, and Yelena Yuditsky. Weak Coloring Numbers of Intersection Graphs. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 39:1-39:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dvorak_et_al:LIPIcs.SoCG.2022.39, author = {Dvo\v{r}\'{a}k, Zden\v{e}k and Pek\'{a}rek, Jakub and Ueckerdt, Torsten and Yuditsky, Yelena}, title = {{Weak Coloring Numbers of Intersection Graphs}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {39:1--39:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.39}, URN = {urn:nbn:de:0030-drops-160477}, doi = {10.4230/LIPIcs.SoCG.2022.39}, annote = {Keywords: geometric intersection graphs, weak and strong coloring numbers} }
Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
Zdeněk Dvořák and Abhiruk Lahiri. Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 40:1-40:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dvorak_et_al:LIPIcs.ESA.2021.40, author = {Dvo\v{r}\'{a}k, Zden\v{e}k and Lahiri, Abhiruk}, title = {{Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {40:1--40:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.40}, URN = {urn:nbn:de:0030-drops-146216}, doi = {10.4230/LIPIcs.ESA.2021.40}, annote = {Keywords: approximation, sublinear separators} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Drago Bokal, Zdeněk Dvořák, Petr Hliněný, Jesús Leaños, Bojan Mohar, and Tilo Wiedera. Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 14:1-14:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bokal_et_al:LIPIcs.SoCG.2019.14, author = {Bokal, Drago and Dvo\v{r}\'{a}k, Zden\v{e}k and Hlin\v{e}n\'{y}, Petr and Lea\~{n}os, Jes\'{u}s and Mohar, Bojan and Wiedera, Tilo}, title = {{Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c \langle= 12}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {14:1--14:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.14}, URN = {urn:nbn:de:0030-drops-104183}, doi = {10.4230/LIPIcs.SoCG.2019.14}, annote = {Keywords: graph drawing, crossing number, crossing-critical, zip product} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Zdenek Dvorák and Ken-ichi Kawarabayashi. Additive Non-Approximability of Chromatic Number in Proper Minor-Closed Classes. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 47:1-47:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dvorak_et_al:LIPIcs.ICALP.2018.47, author = {Dvor\'{a}k, Zdenek and Kawarabayashi, Ken-ichi}, title = {{Additive Non-Approximability of Chromatic Number in Proper Minor-Closed Classes}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {47:1--47:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.47}, URN = {urn:nbn:de:0030-drops-90510}, doi = {10.4230/LIPIcs.ICALP.2018.47}, annote = {Keywords: non-approximability, chromatic number, minor-closed classes} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Zdenek Dvorák, Petr Hlinený, and Bojan Mohar. Structure and Generation of Crossing-Critical Graphs. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 33:1-33:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dvorak_et_al:LIPIcs.SoCG.2018.33, author = {Dvor\'{a}k, Zdenek and Hlinen\'{y}, Petr and Mohar, Bojan}, title = {{Structure and Generation of Crossing-Critical Graphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {33:1--33:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.33}, URN = {urn:nbn:de:0030-drops-87460}, doi = {10.4230/LIPIcs.SoCG.2018.33}, annote = {Keywords: crossing number, crossing-critical, path-width, exhaustive generation} }
Published in: LIPIcs, Volume 66, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
Zdenek Dvorák, Daniel Král, and Bojan Mohar. Graphic TSP in Cubic Graphs. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 66, pp. 27:1-27:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{dvorak_et_al:LIPIcs.STACS.2017.27, author = {Dvor\'{a}k, Zdenek and Kr\'{a}l, Daniel and Mohar, Bojan}, title = {{Graphic TSP in Cubic Graphs}}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)}, pages = {27:1--27:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-028-6}, ISSN = {1868-8969}, year = {2017}, volume = {66}, editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.27}, URN = {urn:nbn:de:0030-drops-70068}, doi = {10.4230/LIPIcs.STACS.2017.27}, annote = {Keywords: Graphic TSP, approximation algorithms, cubic graphs} }
Published in: LIPIcs, Volume 66, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
Zdenek Dvorák and Bernard Lidický. Independent Sets near the Lower Bound in Bounded Degree Graphs. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 66, pp. 28:1-28:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{dvorak_et_al:LIPIcs.STACS.2017.28, author = {Dvor\'{a}k, Zdenek and Lidick\'{y}, Bernard}, title = {{Independent Sets near the Lower Bound in Bounded Degree Graphs}}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)}, pages = {28:1--28:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-028-6}, ISSN = {1868-8969}, year = {2017}, volume = {66}, editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.28}, URN = {urn:nbn:de:0030-drops-70042}, doi = {10.4230/LIPIcs.STACS.2017.28}, annote = {Keywords: independent set, bounded degree, Delta-colorable, fixed parameter tractability} }
Feedback for Dagstuhl Publishing