Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Torsten Ueckerdt
@article{DBLP:journals/cgt/HaJUZ24,
author = {Minh Tuan Ha and
Paul Jungeblut and
Torsten Ueckerdt and
Pawel Zylinski},
title = {Primal-Dual Cops and Robber},
journal = {Comput. Geom. Topol.},
volume = {3},
number = {2},
pages = {4:1--4:12},
year = {2024},
url = {https://www.cgt-journal.org/index.php/cgt/article/view/49},
timestamp = {Mon, 19 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cgt/HaJUZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HatzelJMPUW24,
author = {Meike Hatzel and
Gwena{\"{e}}l Joret and
Piotr Micek and
Marcin Pilipczuk and
Torsten Ueckerdt and
Bartosz Walczak},
title = {Tight Bound on Treedepth in Terms of Pathwidth and Longest Path},
journal = {Comb.},
volume = {44},
number = {2},
pages = {417--427},
year = {2024},
url = {https://doi.org/10.1007/s00493-023-00077-w},
doi = {10.1007/S00493-023-00077-W},
timestamp = {Fri, 29 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/HatzelJMPUW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-05892,
author = {Miriam Goetze and
Paul Jungeblut and
Torsten Ueckerdt},
title = {Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic
Graphs},
journal = {CoRR},
volume = {abs/2401.05892},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.05892},
doi = {10.48550/ARXIV.2401.05892},
eprinttype = {arXiv},
eprint = {2401.05892},
timestamp = {Thu, 25 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-05892.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-15394,
author = {Kolja Knauer and
Torsten Ueckerdt},
title = {Partitioning a Planar Graph into two Triangle-Forests},
journal = {CoRR},
volume = {abs/2401.15394},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.15394},
doi = {10.48550/ARXIV.2401.15394},
eprinttype = {arXiv},
eprint = {2401.15394},
timestamp = {Thu, 08 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-15394.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CardinalKMPUV23,
author = {Jean Cardinal and
Kolja Knauer and
Piotr Micek and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
Torsten Ueckerdt and
Narmada Varadarajan},
title = {Colouring bottomless rectangles and arborescences},
journal = {Comput. Geom.},
volume = {115},
pages = {102020},
year = {2023},
url = {https://doi.org/10.1016/j.comgeo.2023.102020},
doi = {10.1016/J.COMGEO.2023.102020},
timestamp = {Fri, 21 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/CardinalKMPUV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JungeblutMU23,
author = {Paul Jungeblut and
Laura Merker and
Torsten Ueckerdt},
title = {A Sublinear Bound on the Page Number of Upward Planar Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {37},
number = {4},
pages = {2312--2331},
year = {2023},
url = {https://doi.org/10.1137/22m1522450},
doi = {10.1137/22M1522450},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/JungeblutMU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AngeliniBK00U23,
author = {Patrizio Angelini and
Michael A. Bekos and
Julia Katheder and
Michael Kaufmann and
Maximilian Pfister and
Torsten Ueckerdt},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {Axis-Parallel Right Angle Crossing Graphs},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {9:1--9:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.9},
doi = {10.4230/LIPICS.ESA.2023.9},
timestamp = {Wed, 30 Aug 2023 15:40:45 +0200},
biburl = {https://dblp.org/rec/conf/esa/AngeliniBK00U23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JungeblutMU23,
author = {Paul Jungeblut and
Laura Merker and
Torsten Ueckerdt},
title = {Directed Acyclic Outerplanar Graphs Have Constant Stack Number},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1937--1952},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00118},
doi = {10.1109/FOCS57990.2023.00118},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/JungeblutMU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/JungeblutSU23,
author = {Paul Jungeblut and
Samuel Schneider and
Torsten Ueckerdt},
editor = {Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Cops and Robber - When Capturing Is Not Surrounding},
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 = {403--416},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43380-1\_29},
doi = {10.1007/978-3-031-43380-1\_29},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/JungeblutSU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-05514,
author = {Minh Tuan Ha and
Paul Jungeblut and
Torsten Ueckerdt},
title = {Primal-Dual Cops and Robber},
journal = {CoRR},
volume = {abs/2301.05514},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.05514},
doi = {10.48550/ARXIV.2301.05514},
eprinttype = {arXiv},
eprint = {2301.05514},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-05514.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-02995,
author = {Meike Hatzel and
Gwena{\"{e}}l Joret and
Piotr Micek and
Marcin Pilipczuk and
Torsten Ueckerdt and
Bartosz Walczak},
title = {Tight bound on treedepth in terms of pathwidth and longest path},
journal = {CoRR},
volume = {abs/2302.02995},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.02995},
doi = {10.48550/ARXIV.2302.02995},
eprinttype = {arXiv},
eprint = {2302.02995},
timestamp = {Mon, 13 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-02995.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-10577,
author = {Paul Jungeblut and
Samuel Schneider and
Torsten Ueckerdt},
title = {Cops and Robber - When Capturing is not Surrounding},
journal = {CoRR},
volume = {abs/2302.10577},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.10577},
doi = {10.48550/ARXIV.2302.10577},
eprinttype = {arXiv},
eprint = {2302.10577},
timestamp = {Thu, 23 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-10577.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-13655,
author = {Kolja Knauer and
Torsten Ueckerdt},
title = {Clustered independence and bounded treewidth},
journal = {CoRR},
volume = {abs/2303.13655},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.13655},
doi = {10.48550/ARXIV.2303.13655},
eprinttype = {arXiv},
eprint = {2303.13655},
timestamp = {Thu, 13 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-13655.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-17028,
author = {Therese Biedl and
David Eppstein and
Torsten Ueckerdt},
title = {On the complexity of embedding in graph products},
journal = {CoRR},
volume = {abs/2303.17028},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.17028},
doi = {10.48550/ARXIV.2303.17028},
eprinttype = {arXiv},
eprint = {2303.17028},
timestamp = {Fri, 14 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-17028.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-17073,
author = {Patrizio Angelini and
Michael A. Bekos and
Julia Katheder and
Michael Kaufmann and
Maximilian Pfister and
Torsten Ueckerdt},
title = {Axis-Parallel Right Angle Crossing Graphs},
journal = {CoRR},
volume = {abs/2306.17073},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.17073},
doi = {10.48550/ARXIV.2306.17073},
eprinttype = {arXiv},
eprint = {2306.17073},
timestamp = {Mon, 03 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-17073.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-05757,
author = {Tim Planken and
Torsten Ueckerdt},
title = {Shallow Hitting Edge Sets in Uniform Hypergraphs},
journal = {CoRR},
volume = {abs/2307.05757},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.05757},
doi = {10.48550/ARXIV.2307.05757},
eprinttype = {arXiv},
eprint = {2307.05757},
timestamp = {Thu, 27 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-05757.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-19982,
author = {Tim Planken and
Torsten Ueckerdt},
title = {Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting
Sets},
journal = {CoRR},
volume = {abs/2310.19982},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.19982},
doi = {10.48550/ARXIV.2310.19982},
eprinttype = {arXiv},
eprint = {2310.19982},
timestamp = {Fri, 03 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-19982.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-06193,
author = {Michael Kaufmann and
Boris Klemz and
Kristin Knorr and
Meghana M. Reddy and
Felix Schr{\"{o}}der and
Torsten Ueckerdt},
title = {The Density Formula: One Lemma to Bound Them All},
journal = {CoRR},
volume = {abs/2311.06193},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.06193},
doi = {10.48550/ARXIV.2311.06193},
eprinttype = {arXiv},
eprint = {2311.06193},
timestamp = {Thu, 16 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-06193.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/0001U22,
author = {Michael Kaufmann and
Torsten Ueckerdt},
title = {The Density of Fan-Planar Graphs},
journal = {Electron. J. Comb.},
volume = {29},
number = {1},
year = {2022},
url = {https://doi.org/10.37236/10521},
doi = {10.37236/10521},
timestamp = {Fri, 04 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/0001U22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/UeckerdtWY22,
author = {Torsten Ueckerdt and
David R. Wood and
Wendy Yi},
title = {An Improved Planar Graph Product Structure Theorem},
journal = {Electron. J. Comb.},
volume = {29},
number = {2},
year = {2022},
url = {https://doi.org/10.37236/10614},
doi = {10.37236/10614},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/UeckerdtWY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Dvorak0LTU22,
author = {Zdenek Dvor{\'{a}}k and
Daniel Gon{\c{c}}alves and
Abhiruk Lahiri and
Jane Tan and
Torsten Ueckerdt},
editor = {Xavier Goaoc and
Michael Kerber},
title = {On Comparable Box Dimension},
booktitle = {38th International Symposium on Computational Geometry, SoCG 2022,
June 7-10, 2022, Berlin, Germany},
series = {LIPIcs},
volume = {224},
pages = {38:1--38:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2022.38},
doi = {10.4230/LIPICS.SOCG.2022.38},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/Dvorak0LTU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/DvorakPUY22,
author = {Zdenek Dvor{\'{a}}k and
Jakub Pek{\'{a}}rek and
Torsten Ueckerdt and
Yelena Yuditsky},
editor = {Xavier Goaoc and
Michael Kerber},
title = {Weak Coloring Numbers of Intersection Graphs},
booktitle = {38th International Symposium on Computational Geometry, SoCG 2022,
June 7-10, 2022, Berlin, Germany},
series = {LIPIcs},
volume = {224},
pages = {39:1--39:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2022.39},
doi = {10.4230/LIPICS.SOCG.2022.39},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/DvorakPUY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GoetzeJU22,
author = {Miriam Goetze and
Paul Jungeblut and
Torsten Ueckerdt},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {62:1--62:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.62},
doi = {10.4230/LIPICS.ESA.2022.62},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/GoetzeJU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JungeblutMU22,
author = {Paul Jungeblut and
Laura Merker and
Torsten Ueckerdt},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {A Sublinear Bound on the Page Number of Upward Planar Graphs},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {963--978},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.42},
doi = {10.1137/1.9781611977073.42},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/JungeblutMU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ChekanU22,
author = {Vera Chekan and
Torsten Ueckerdt},
editor = {Michael A. Bekos and
Michael Kaufmann},
title = {Polychromatic Colorings of Unions of Geometric Hypergraphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International
Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13453},
pages = {144--157},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-15914-5\_11},
doi = {10.1007/978-3-031-15914-5\_11},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/ChekanU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-07686,
author = {Zdenek Dvor{\'{a}}k and
Daniel Gon{\c{c}}alves and
Abhiruk Lahiri and
Jane Tan and
Torsten Ueckerdt},
title = {On Comparable Box Dimension},
journal = {CoRR},
volume = {abs/2203.07686},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.07686},
doi = {10.48550/ARXIV.2203.07686},
eprinttype = {arXiv},
eprint = {2203.07686},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-07686.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-11750,
author = {Miriam Goetze and
Paul Jungeblut and
Torsten Ueckerdt},
title = {Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs},
journal = {CoRR},
volume = {abs/2204.11750},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.11750},
doi = {10.48550/ARXIV.2204.11750},
eprinttype = {arXiv},
eprint = {2204.11750},
timestamp = {Thu, 28 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-11750.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-04732,
author = {Paul Jungeblut and
Laura Merker and
Torsten Ueckerdt},
title = {Directed Acyclic Outerplanar Graphs Have Constant Stack Number},
journal = {CoRR},
volume = {abs/2211.04732},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.04732},
doi = {10.48550/ARXIV.2211.04732},
eprinttype = {arXiv},
eprint = {2211.04732},
timestamp = {Wed, 16 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-04732.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/GueganKRU21,
author = {Guillaume Gu{\'{e}}gan and
Kolja Knauer and
Jonathan Rollin and
Torsten Ueckerdt},
title = {The interval number of a planar graph is at most three},
journal = {J. Comb. Theory, Ser. {B}},
volume = {146},
pages = {61--67},
year = {2021},
url = {https://doi.org/10.1016/j.jctb.2020.07.006},
doi = {10.1016/J.JCTB.2020.07.006},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jctb/GueganKRU21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KaufmannPTU21,
author = {Michael Kaufmann and
J{\'{a}}nos Pach and
G{\'{e}}za T{\'{o}}th and
Torsten Ueckerdt},
title = {The number of crossings in multigraphs with no empty lens},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {383--396},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00563},
doi = {10.7155/JGAA.00563},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KaufmannPTU21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DamasdiFGKLNU21,
author = {G{\'{a}}bor Dam{\'{a}}sdi and
Stefan Felsner and
Ant{\'{o}}nio Gir{\~{a}}o and
Bal{\'{a}}zs Keszegh and
David Lewis and
D{\'{a}}niel T. Nagy and
Torsten Ueckerdt},
title = {On Covering Numbers, Young Diagrams, and the Local Dimension of Posets},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {2},
pages = {915--927},
year = {2021},
url = {https://doi.org/10.1137/20M1313684},
doi = {10.1137/20M1313684},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/DamasdiFGKLNU21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/ChaplickKPRU21,
author = {Steven Chaplick and
Fabian Klute and
Irene Parada and
Jonathan Rollin and
Torsten Ueckerdt},
editor = {Helen C. Purchase and
Ignaz Rutter},
title = {Edge-Minimum Saturated k-Planar Drawings},
booktitle = {Graph Drawing and Network Visualization - 29th International Symposium,
{GD} 2021, T{\"{u}}bingen, Germany, September 14-17, 2021, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {12868},
pages = {3--17},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92931-2\_1},
doi = {10.1007/978-3-030-92931-2\_1},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/ChaplickKPRU21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/FelsnerUW21,
author = {Stefan Felsner and
Torsten Ueckerdt and
Kaja Wille},
editor = {Helen C. Purchase and
Ignaz Rutter},
title = {On the Queue-Number of Partial Orders},
booktitle = {Graph Drawing and Network Visualization - 29th International Symposium,
{GD} 2021, T{\"{u}}bingen, Germany, September 14-17, 2021, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {12868},
pages = {231--241},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92931-2\_17},
doi = {10.1007/978-3-030-92931-2\_17},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/FelsnerUW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/FelsnerMUV21,
author = {Stefan Felsner and
Laura Merker and
Torsten Ueckerdt and
Pavel Valtr},
editor = {Helen C. Purchase and
Ignaz Rutter},
title = {Linear Layouts of Complete Graphs},
booktitle = {Graph Drawing and Network Visualization - 29th International Symposium,
{GD} 2021, T{\"{u}}bingen, Germany, September 14-17, 2021, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {12868},
pages = {257--270},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92931-2\_19},
doi = {10.1007/978-3-030-92931-2\_19},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/FelsnerMUV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/FrankKKMPUW21,
author = {Fabian Frank and
Michael Kaufmann and
Stephen G. Kobourov and
Tamara Mchedlidze and
Sergey Pupyrev and
Torsten Ueckerdt and
Alexander Wolff},
editor = {Tom{\'{a}}s Bures and
Riccardo Dondi and
Johann Gamper and
Giovanna Guerrini and
Tomasz Jurdzinski and
Claus Pahl and
Florian Sikora and
Prudence W. H. Wong},
title = {Using the Metro-Map Metaphor for Drawing Hypergraphs},
booktitle = {{SOFSEM} 2021: Theory and Practice of Computer Science - 47th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12607},
pages = {361--372},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-67731-2\_26},
doi = {10.1007/978-3-030-67731-2\_26},
timestamp = {Sun, 25 Jul 2021 11:44:25 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/FrankKKMPUW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-17094,
author = {Zdenek Dvor{\'{a}}k and
Jakub Pek{\'{a}}rek and
Torsten Ueckerdt and
Yelena Yuditsky},
title = {Weak Coloring Numbers of Intersection Graphs},
journal = {CoRR},
volume = {abs/2103.17094},
year = {2021},
url = {https://arxiv.org/abs/2103.17094},
eprinttype = {arXiv},
eprint = {2103.17094},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-17094.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-05227,
author = {Paul Jungeblut and
Laura Merker and
Torsten Ueckerdt},
title = {A Sublinear Bound on the Page Number of Upward Planar Graphs},
journal = {CoRR},
volume = {abs/2107.05227},
year = {2021},
url = {https://doi.org/10.48550/arXiv.2107.05227},
doi = {10.48550/ARXIV.2107.05227},
eprinttype = {arXiv},
eprint = {2107.05227},
timestamp = {Tue, 14 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-05227.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-00198,
author = {Torsten Ueckerdt and
David R. Wood and
Wendy Yi},
title = {An improved planar graph product structure theorem},
journal = {CoRR},
volume = {abs/2108.00198},
year = {2021},
url = {https://arxiv.org/abs/2108.00198},
eprinttype = {arXiv},
eprint = {2108.00198},
timestamp = {Thu, 05 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-00198.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-05112,
author = {Stefan Felsner and
Laura Merker and
Torsten Ueckerdt and
Pavel Valtr},
title = {Linear Layouts of Complete Graphs},
journal = {CoRR},
volume = {abs/2108.05112},
year = {2021},
url = {https://arxiv.org/abs/2108.05112},
eprinttype = {arXiv},
eprint = {2108.05112},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-05112.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-09994,
author = {Stefan Felsner and
Torsten Ueckerdt and
Kaja Wille},
title = {On the Queue-Number of Partial Orders},
journal = {CoRR},
volume = {abs/2108.09994},
year = {2021},
url = {https://arxiv.org/abs/2108.09994},
eprinttype = {arXiv},
eprint = {2108.09994},
timestamp = {Fri, 27 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-09994.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-02894,
author = {Vera Chekan and
Torsten Ueckerdt},
title = {Polychromatic Colorings of Unions of Geometric Hypergraphs},
journal = {CoRR},
volume = {abs/2112.02894},
year = {2021},
url = {https://arxiv.org/abs/2112.02894},
eprinttype = {arXiv},
eprint = {2112.02894},
timestamp = {Wed, 08 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-02894.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DujmovicJMMUW20,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
Torsten Ueckerdt and
David R. Wood},
title = {Planar Graphs Have Bounded Queue-Number},
journal = {J. {ACM}},
volume = {67},
number = {4},
pages = {22:1--22:38},
year = {2020},
url = {https://doi.org/10.1145/3385731},
doi = {10.1145/3385731},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DujmovicJMMUW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/KaufmannBKPRU20,
author = {Michael A. Bekos and
Michael Kaufmann and
Fabian Klute and
Sergey Pupyrev and
Chrysanthi N. Raftopoulou and
Torsten Ueckerdt},
title = {Four Pages Are Indeed Necessary for Planar Graphs},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {332--353},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a12},
doi = {10.20382/JOCG.V11I1A12},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/KaufmannBKPRU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/MerkerU20,
author = {Laura Merker and
Torsten Ueckerdt},
editor = {David Auber and
Pavel Valtr},
title = {The Local Queue Number of Graphs with Bounded Treewidth},
booktitle = {Graph Drawing and Network Visualization - 28th International Symposium,
{GD} 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12590},
pages = {26--39},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-68766-3\_3},
doi = {10.1007/978-3-030-68766-3\_3},
timestamp = {Tue, 27 Dec 2022 18:26:56 +0100},
biburl = {https://dblp.org/rec/conf/gd/MerkerU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/JungeblutU20,
author = {Paul Jungeblut and
Torsten Ueckerdt},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Guarding Quadrangulations and Stacked Triangulations with Edges},
booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {14--26},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_2},
doi = {10.1007/978-3-030-60440-0\_2},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/JungeblutU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FelsnerKU20,
author = {Stefan Felsner and
Kolja Knauer and
Torsten Ueckerdt},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Plattenbauten: Touching Rectangles in Space},
booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {161--173},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_13},
doi = {10.1007/978-3-030-60440-0\_13},
timestamp = {Thu, 22 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/FelsnerKU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-06367,
author = {G{\'{a}}bor Dam{\'{a}}sdi and
Stefan Felsner and
Ant{\'{o}}nio Gir{\~{a}}o and
Bal{\'{a}}zs Keszegh and
David Lewis and
D{\'{a}}niel T. Nagy and
Torsten Ueckerdt},
title = {On Covering Numbers, Young Diagrams, and the Local Dimension of Posets},
journal = {CoRR},
volume = {abs/2001.06367},
year = {2020},
url = {https://arxiv.org/abs/2001.06367},
eprinttype = {arXiv},
eprint = {2001.06367},
timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-06367.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-07630,
author = {Michael A. Bekos and
Michael Kaufmann and
Fabian Klute and
Sergey Pupyrev and
Chrysanthi N. Raftopoulou and
Torsten Ueckerdt},
title = {Four Pages Are Indeed Necessary for Planar Graphs},
journal = {CoRR},
volume = {abs/2004.07630},
year = {2020},
url = {https://arxiv.org/abs/2004.07630},
eprinttype = {arXiv},
eprint = {2004.07630},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-07630.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-13722,
author = {Paul Jungeblut and
Torsten Ueckerdt},
title = {Guarding Quadrangulations and Stacked Triangulations with Edges},
journal = {CoRR},
volume = {abs/2006.13722},
year = {2020},
url = {https://arxiv.org/abs/2006.13722},
eprinttype = {arXiv},
eprint = {2006.13722},
timestamp = {Wed, 01 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-13722.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-07806,
author = {Stefan Felsner and
Kolja Knauer and
Torsten Ueckerdt},
title = {Plattenbauten: Touching Rectangles in Space},
journal = {CoRR},
volume = {abs/2007.07806},
year = {2020},
url = {https://arxiv.org/abs/2007.07806},
eprinttype = {arXiv},
eprint = {2007.07806},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-07806.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-05392,
author = {Laura Merker and
Torsten Ueckerdt},
title = {The Local Queue Number of Graphs with Bounded Treewidth},
journal = {CoRR},
volume = {abs/2008.05392},
year = {2020},
url = {https://arxiv.org/abs/2008.05392},
eprinttype = {arXiv},
eprint = {2008.05392},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-05392.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-08631,
author = {Steven Chaplick and
Jonathan Rollin and
Torsten Ueckerdt},
title = {Edge-Minimum Saturated k-Planar Drawings},
journal = {CoRR},
volume = {abs/2012.08631},
year = {2020},
url = {https://arxiv.org/abs/2012.08631},
eprinttype = {arXiv},
eprint = {2012.08631},
timestamp = {Sat, 02 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-08631.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/AxenovichSTU19,
author = {Maria Axenovich and
Ursula Schade and
Carsten Thomassen and
Torsten Ueckerdt},
title = {Planar Ramsey Graphs},
journal = {Electron. J. Comb.},
volume = {26},
number = {4},
pages = {4},
year = {2019},
url = {https://doi.org/10.37236/8366},
doi = {10.37236/8366},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/AxenovichSTU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AxenovichDRU19,
author = {Maria Axenovich and
Philip D{\"{o}}rr and
Jonathan Rollin and
Torsten Ueckerdt},
title = {Induced and weak induced arboricities},
journal = {Discret. Math.},
volume = {342},
number = {2},
pages = {511--519},
year = {2019},
url = {https://doi.org/10.1016/j.disc.2018.10.018},
doi = {10.1016/J.DISC.2018.10.018},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AxenovichDRU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KnauerU19,
author = {Kolja Knauer and
Torsten Ueckerdt},
title = {Decomposing 4-connected planar triangulations into two trees and one
path},
journal = {J. Comb. Theory, Ser. {B}},
volume = {134},
pages = {88--109},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2018.05.006},
doi = {10.1016/J.JCTB.2018.05.006},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KnauerU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BekosFGMMRU19,
author = {Michael A. Bekos and
Henry F{\"{o}}rster and
Martin Gronemann and
Tamara Mchedlidze and
Fabrizio Montecchiani and
Chrysanthi N. Raftopoulou and
Torsten Ueckerdt},
title = {Planar Graphs of Bounded Degree Have Bounded Queue Number},
journal = {{SIAM} J. Comput.},
volume = {48},
number = {5},
pages = {1487--1502},
year = {2019},
url = {https://doi.org/10.1137/19M125340X},
doi = {10.1137/19M125340X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BekosFGMMRU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GritzbachUWW019,
author = {Sascha Gritzbach and
Torsten Ueckerdt and
Dorothea Wagner and
Franziska Wegner and
Matthias Wolf},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {Engineering Negative Cycle Canceling for Wind Farm Cabling},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {55:1--55:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.55},
doi = {10.4230/LIPICS.ESA.2019.55},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/GritzbachUWW019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DujmovicJMMUW19,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
Torsten Ueckerdt and
David R. Wood},
editor = {David Zuckerman},
title = {Planar Graphs have Bounded Queue-Number},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {862--875},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00056},
doi = {10.1109/FOCS.2019.00056},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DujmovicJMMUW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/MerkerU19,
author = {Laura Merker and
Torsten Ueckerdt},
editor = {Daniel Archambault and
Csaba D. T{\'{o}}th},
title = {Local and Union Page Numbers},
booktitle = {Graph Drawing and Network Visualization - 27th International Symposium,
{GD} 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11904},
pages = {447--459},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-35802-0\_34},
doi = {10.1007/978-3-030-35802-0\_34},
timestamp = {Sun, 13 Nov 2022 09:57:24 +0100},
biburl = {https://dblp.org/rec/conf/gd/MerkerU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BekosFGMMRU19,
author = {Michael A. Bekos and
Henry F{\"{o}}rster and
Martin Gronemann and
Tamara Mchedlidze and
Fabrizio Montecchiani and
Chrysanthi N. Raftopoulou and
Torsten Ueckerdt},
editor = {Moses Charikar and
Edith Cohen},
title = {Planar graphs of bounded degree have bounded queue number},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {176--184},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316324},
doi = {10.1145/3313276.3316324},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BekosFGMMRU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-08223,
author = {Stefan Felsner and
Torsten Ueckerdt},
title = {A Note on Covering Young Diagrams with Applications to Local Dimension
of Posets},
journal = {CoRR},
volume = {abs/1902.08223},
year = {2019},
url = {http://arxiv.org/abs/1902.08223},
eprinttype = {arXiv},
eprint = {1902.08223},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-08223.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-04791,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
Torsten Ueckerdt and
David R. Wood},
title = {Planar Graphs have Bounded Queue-Number},
journal = {CoRR},
volume = {abs/1904.04791},
year = {2019},
url = {http://arxiv.org/abs/1904.04791},
eprinttype = {arXiv},
eprint = {1904.04791},
timestamp = {Thu, 25 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-04791.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-09994,
author = {Laura Merker and
Torsten Ueckerdt},
title = {Local and Union Page Numbers},
journal = {CoRR},
volume = {abs/1907.09994},
year = {2019},
url = {http://arxiv.org/abs/1907.09994},
eprinttype = {arXiv},
eprint = {1907.09994},
timestamp = {Tue, 30 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-09994.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-02129,
author = {Sascha Gritzbach and
Torsten Ueckerdt and
Dorothea Wagner and
Franziska Wegner and
Matthias Wolf},
title = {Engineering Negative Cycle Canceling for Wind Farm Cabling},
journal = {CoRR},
volume = {abs/1908.02129},
year = {2019},
url = {http://arxiv.org/abs/1908.02129},
eprinttype = {arXiv},
eprint = {1908.02129},
timestamp = {Fri, 09 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-02129.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/AxenovichRU18,
author = {Maria Axenovich and
Jonathan Rollin and
Torsten Ueckerdt},
title = {Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs},
journal = {Comb.},
volume = {38},
number = {5},
pages = {1021--1043},
year = {2018},
url = {https://doi.org/10.1007/s00493-017-3593-0},
doi = {10.1007/S00493-017-3593-0},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/AxenovichRU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BlasiusSU18,
author = {Thomas Bl{\"{a}}sius and
Peter Stumpf and
Torsten Ueckerdt},
title = {Local and union boxicity},
journal = {Discret. Math.},
volume = {341},
number = {5},
pages = {1307--1315},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2018.02.003},
doi = {10.1016/J.DISC.2018.02.003},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BlasiusSU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/AxenovichGRU18,
author = {Maria Axenovich and
Daniel Gon{\c{c}}alves and
Jonathan Rollin and
Torsten Ueckerdt},
title = {The k-strong induced arboricity of a graph},
journal = {Eur. J. Comb.},
volume = {67},
pages = {1--20},
year = {2018},
url = {https://doi.org/10.1016/j.ejc.2017.05.010},
doi = {10.1016/J.EJC.2017.05.010},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/AxenovichGRU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eninf/GritzbachUWWW18,
author = {Sascha Gritzbach and
Torsten Ueckerdt and
Dorothea Wagner and
Franziska Wegner and
Matthias Wolf},
title = {Publisher Correction: Towards negative cycle canceling in wind farm
cable layout optimization},
journal = {Energy Inform.},
volume = {1},
number = {1},
year = {2018},
url = {https://doi.org/10.1186/s42162-018-0063-x},
doi = {10.1186/S42162-018-0063-X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eninf/GritzbachUWWW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eninf/GritzbachUWWW18a,
author = {Sascha Gritzbach and
Torsten Ueckerdt and
Dorothea Wagner and
Franziska Wegner and
Matthias Wolf},
title = {Towards negative cycle canceling in wind farm cable layout optimization},
journal = {Energy Inform.},
volume = {1},
number = {{S1}},
year = {2018},
url = {https://doi.org/10.1186/s42162-018-0030-6},
doi = {10.1186/S42162-018-0030-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eninf/GritzbachUWWW18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChimaniFKUVW18,
author = {Markus Chimani and
Stefan Felsner and
Stephen G. Kobourov and
Torsten Ueckerdt and
Pavel Valtr and
Alexander Wolff},
title = {On the Maximum Crossing Number},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {1},
pages = {67--87},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00458},
doi = {10.7155/JGAA.00458},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChimaniFKUVW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KnauerMU18,
author = {Kolja Knauer and
Piotr Micek and
Torsten Ueckerdt},
editor = {Therese Biedl and
Andreas Kerren},
title = {The Queue-Number of Posets of Bounded Width or Height},
booktitle = {Graph Drawing and Network Visualization - 26th International Symposium,
{GD} 2018, Barcelona, Spain, September 26-28, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11282},
pages = {200--212},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04414-5\_14},
doi = {10.1007/978-3-030-04414-5\_14},
timestamp = {Sun, 13 Nov 2022 09:57:25 +0100},
biburl = {https://dblp.org/rec/conf/gd/KnauerMU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/0001PTU18,
author = {Michael Kaufmann and
J{\'{a}}nos Pach and
G{\'{e}}za T{\'{o}}th and
Torsten Ueckerdt},
editor = {Therese Biedl and
Andreas Kerren},
title = {The Number of Crossings in Multigraphs with No Empty Lens},
booktitle = {Graph Drawing and Network Visualization - 26th International Symposium,
{GD} 2018, Barcelona, Spain, September 26-28, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11282},
pages = {242--254},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04414-5\_17},
doi = {10.1007/978-3-030-04414-5\_17},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/0001PTU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AngeliniB0PU18,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Maximilian Pfister and
Torsten Ueckerdt},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {Beyond-Planarity: Tur{\'{a}}n-Type Results for Non-Planar Bipartite
Graphs},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {28:1--28:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.28},
doi = {10.4230/LIPICS.ISAAC.2018.28},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/AngeliniB0PU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-02152,
author = {Maria Axenovich and
Philip D{\"{o}}rr and
Jonathan Rollin and
Torsten Ueckerdt},
title = {Induced and Weak Induced Arboricities},
journal = {CoRR},
volume = {abs/1803.02152},
year = {2018},
url = {http://arxiv.org/abs/1803.02152},
eprinttype = {arXiv},
eprint = {1803.02152},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-02152.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-02947,
author = {Guillaume Gu{\'{e}}gan and
Kolja Knauer and
Jonathan Rollin and
Torsten Ueckerdt},
title = {The interval number of a planar graph is at most three},
journal = {CoRR},
volume = {abs/1805.02947},
year = {2018},
url = {http://arxiv.org/abs/1805.02947},
eprinttype = {arXiv},
eprint = {1805.02947},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-02947.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-04489,
author = {Kolja Knauer and
Piotr Micek and
Torsten Ueckerdt},
title = {The queue-number of planar posets},
journal = {CoRR},
volume = {abs/1806.04489},
year = {2018},
url = {http://arxiv.org/abs/1806.04489},
eprinttype = {arXiv},
eprint = {1806.04489},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-04489.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-10480,
author = {Michael Kaufmann and
J{\'{a}}nos Pach and
G{\'{e}}za T{\'{o}}th and
Torsten Ueckerdt},
title = {The number of crossings in multigraphs with no empty lens},
journal = {CoRR},
volume = {abs/1808.10480},
year = {2018},
url = {http://arxiv.org/abs/1808.10480},
eprinttype = {arXiv},
eprint = {1808.10480},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-10480.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-00816,
author = {Michael A. Bekos and
Henry F{\"{o}}rster and
Martin Gronemann and
Tamara Mchedlidze and
Fabrizio Montecchiani and
Chrysanthi N. Raftopoulou and
Torsten Ueckerdt},
title = {Planar Graphs of Bounded Degree have Constant Queue Number},
journal = {CoRR},
volume = {abs/1811.00816},
year = {2018},
url = {http://arxiv.org/abs/1811.00816},
eprinttype = {arXiv},
eprint = {1811.00816},
timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-00816.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-00832,
author = {Maria Axenovich and
Carsten Thomassen and
Ursula Schade and
Torsten Ueckerdt},
title = {Planar Ramsey graphs},
journal = {CoRR},
volume = {abs/1812.00832},
year = {2018},
url = {http://arxiv.org/abs/1812.00832},
eprinttype = {arXiv},
eprint = {1812.00832},
timestamp = {Thu, 03 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-00832.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/AxenovichRU17,
author = {Maria Axenovich and
Jonathan Rollin and
Torsten Ueckerdt},
title = {The chromatic number of ordered graphs with constrained conflict graphs},
journal = {Australas. {J} Comb.},
volume = {69},
pages = {74--104},
year = {2017},
url = {http://ajc.maths.uq.edu.au/pdf/69/ajc\_v69\_p074.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/AxenovichRU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AxenovichUW17,
author = {Maria Axenovich and
Torsten Ueckerdt and
Pascal Weiner},
title = {Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short
Paths},
journal = {J. Graph Theory},
volume = {85},
number = {3},
pages = {601--618},
year = {2017},
url = {https://doi.org/10.1002/jgt.22093},
doi = {10.1002/JGT.22093},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AxenovichUW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AxenovichRU17,
author = {Maria Axenovich and
Jonathan Rollin and
Torsten Ueckerdt},
title = {Conditions on Ramsey Nonequivalence},
journal = {J. Graph Theory},
volume = {86},
number = {2},
pages = {159--192},
year = {2017},
url = {https://doi.org/10.1002/jgt.22119},
doi = {10.1002/JGT.22119},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/AxenovichRU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/ChimaniFKUVW17,
author = {Markus Chimani and
Stefan Felsner and
Stephen G. Kobourov and
Torsten Ueckerdt and
Pavel Valtr and
Alexander Wolff},
editor = {Ljiljana Brankovic and
Joe Ryan and
William F. Smyth},
title = {On the Maximum Crossing Number},
booktitle = {Combinatorial Algorithms - 28th International Workshop, {IWOCA} 2017,
Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10765},
pages = {61--74},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-78825-8\_6},
doi = {10.1007/978-3-319-78825-8\_6},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/ChimaniFKUVW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChimaniFKUVW17,
author = {Markus Chimani and
Stefan Felsner and
Stephen G. Kobourov and
Torsten Ueckerdt and
Pavel Valtr and
Alexander Wolff},
title = {On the Maximum Crossing Number},
journal = {CoRR},
volume = {abs/1705.05176},
year = {2017},
url = {http://arxiv.org/abs/1705.05176},
eprinttype = {arXiv},
eprint = {1705.05176},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/ChimaniFKUVW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-02411,
author = {Kolja Knauer and
Torsten Ueckerdt},
title = {Decomposing 4-connected planar triangulations into two trees and one
path},
journal = {CoRR},
volume = {abs/1710.02411},
year = {2017},
url = {http://arxiv.org/abs/1710.02411},
eprinttype = {arXiv},
eprint = {1710.02411},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-02411.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-09855,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Maximilian Pfister and
Torsten Ueckerdt},
title = {Beyond-Planarity: Density Results for Bipartite Graphs},
journal = {CoRR},
volume = {abs/1712.09855},
year = {2017},
url = {http://arxiv.org/abs/1712.09855},
eprinttype = {arXiv},
eprint = {1712.09855},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-09855.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FelsnerKMU16,
author = {Stefan Felsner and
Kolja B. Knauer and
George B. Mertzios and
Torsten Ueckerdt},
title = {Intersection graphs of L-shapes and segments in the plane},
journal = {Discret. Appl. Math.},
volume = {206},
pages = {48--55},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2016.01.028},
doi = {10.1016/J.DAM.2016.01.028},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FelsnerKMU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KnauerU16,
author = {Kolja B. Knauer and
Torsten Ueckerdt},
title = {Three ways to cover a graph},
journal = {Discret. Math.},
volume = {339},
number = {2},
pages = {745--758},
year = {2016},
url = {https://doi.org/10.1016/j.disc.2015.10.023},
doi = {10.1016/J.DISC.2015.10.023},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KnauerU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AxenovichCU16,
author = {Maria Axenovich and
Enrica Cherubini and
Torsten Ueckerdt},
title = {Spectrum of Mixed Bi-uniform Hypergraphs},
journal = {Graphs Comb.},
volume = {32},
number = {2},
pages = {453--461},
year = {2016},
url = {https://doi.org/10.1007/s00373-015-1586-6},
doi = {10.1007/S00373-015-1586-6},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AxenovichCU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/int/ChaplickMUW16,
author = {Steven Chaplick and
Piotr Micek and
Torsten Ueckerdt and
Veit Wiechert},
title = {A Note on Concurrent Graph Sharing Games},
journal = {Integers},
volume = {16},
pages = {G1},
year = {2016},
url = {http://math.colgate.edu/\%7Eintegers/qg1/qg1.Abstract.html},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/int/ChaplickMUW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/AxenovichU16,
author = {Maria Axenovich and
Torsten Ueckerdt},
title = {Density of range capturing hypergraphs},
journal = {J. Comput. Geom.},
volume = {7},
number = {1},
pages = {1--21},
year = {2016},
url = {https://doi.org/10.20382/jocg.v7i1a1},
doi = {10.20382/JOCG.V7I1A1},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/AxenovichU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EppsteinGSU16,
author = {David Eppstein and
Mereke van Garderen and
Bettina Speckmann and
Torsten Ueckerdt},
title = {Convex-Arc Drawings of Pseudolines},
journal = {CoRR},
volume = {abs/1601.06865},
year = {2016},
url = {http://arxiv.org/abs/1601.06865},
eprinttype = {arXiv},
eprint = {1601.06865},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EppsteinGSU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AxenovichRU16,
author = {Maria Axenovich and
Jonathan Rollin and
Torsten Ueckerdt},
title = {Chromatic number of ordered graphs with forbidden ordered subgraphs},
journal = {CoRR},
volume = {abs/1603.00312},
year = {2016},
url = {http://arxiv.org/abs/1603.00312},
eprinttype = {arXiv},
eprint = {1603.00312},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AxenovichRU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AxenovichGRU16,
author = {Maria Axenovich and
Daniel Gon{\c{c}}alves and
Jonathan Rollin and
Torsten Ueckerdt},
title = {The k-strong induced arboricity of a graph},
journal = {CoRR},
volume = {abs/1607.07174},
year = {2016},
url = {http://arxiv.org/abs/1607.07174},
eprinttype = {arXiv},
eprint = {1607.07174},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AxenovichGRU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlasiusSU16,
author = {Thomas Bl{\"{a}}sius and
Peter Stumpf and
Torsten Ueckerdt},
title = {Local and Union Boxicity},
journal = {CoRR},
volume = {abs/1609.09447},
year = {2016},
url = {http://arxiv.org/abs/1609.09447},
eprinttype = {arXiv},
eprint = {1609.09447},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BlasiusSU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AxenovichRU16a,
author = {Maria Axenovich and
Jonathan Rollin and
Torsten Ueckerdt},
title = {The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs},
journal = {CoRR},
volume = {abs/1610.01111},
year = {2016},
url = {http://arxiv.org/abs/1610.01111},
eprinttype = {arXiv},
eprint = {1610.01111},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AxenovichRU16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HoskeRUW15,
author = {Daniel Hoske and
Jonathan Rollin and
Torsten Ueckerdt and
Stefan Walzer},
title = {Playing weighted Tron on trees},
journal = {Discret. Math.},
volume = {338},
number = {12},
pages = {2341--2347},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2015.06.002},
doi = {10.1016/J.DISC.2015.06.002},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HoskeRUW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/FelsnerMU15,
author = {Stefan Felsner and
Piotr Micek and
Torsten Ueckerdt},
editor = {Lars Arge and
J{\'{a}}nos Pach},
title = {On-line Coloring between Two Lines},
booktitle = {31st International Symposium on Computational Geometry, SoCG 2015,
June 22-25, 2015, Eindhoven, The Netherlands},
series = {LIPIcs},
volume = {34},
pages = {630--641},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.SOCG.2015.630},
doi = {10.4230/LIPICS.SOCG.2015.630},
timestamp = {Wed, 16 Jun 2021 12:03:14 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/FelsnerMU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KlawitterNU15,
author = {Jonathan Klawitter and
Martin N{\"{o}}llenburg and
Torsten Ueckerdt},
editor = {Emilio Di Giacomo and
Anna Lubiw},
title = {Combinatorial Properties of Triangle-Free Rectangle Arrangements and
the Squarability Problem},
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 = {231--244},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-27261-0\_20},
doi = {10.1007/978-3-319-27261-0\_20},
timestamp = {Sun, 13 Nov 2022 09:57:26 +0100},
biburl = {https://dblp.org/rec/conf/gd/KlawitterNU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AlamBRUW15,
author = {Md. Jawaherul Alam and
Thomas Bl{\"{a}}sius and
Ignaz Rutter and
Torsten Ueckerdt and
Alexander Wolff},
editor = {Emilio Di Giacomo and
Anna Lubiw},
title = {Pixel and Voxel Representations of Graphs},
booktitle = {Graph Drawing and Network Visualization - 23rd International Symposium,
{GD} 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9411},
pages = {472--486},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-27261-0\_39},
doi = {10.1007/978-3-319-27261-0\_39},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AlamBRUW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AlamE0KPSU15,
author = {Md. Jawaherul Alam and
David Eppstein and
Michael Kaufmann and
Stephen G. Kobourov and
Sergey Pupyrev and
Andr{\'{e}} Schulz and
Torsten Ueckerdt},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {Contact Graphs of Circular Arcs},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {1--13},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_1},
doi = {10.1007/978-3-319-21840-3\_1},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/AlamE0KPSU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AlamEKPTU15,
author = {Md. Jawaherul Alam and
William S. Evans and
Stephen G. Kobourov and
Sergey Pupyrev and
Jackson Toeniskoetter and
Torsten Ueckerdt},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {Contact Representations of Graphs in 3D},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {14--27},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_2},
doi = {10.1007/978-3-319-21840-3\_2},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/AlamEKPTU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlamEKPTU15,
author = {Md. Jawaherul Alam and
William S. Evans and
Stephen G. Kobourov and
Sergey Pupyrev and
Jackson Toeniskoetter and
Torsten Ueckerdt},
title = {Primal-Dual Representations of Planar Graphs and L-Contact Representations
of Optimal 1-Planar Graphs},
journal = {CoRR},
volume = {abs/1501.00304},
year = {2015},
url = {http://arxiv.org/abs/1501.00304},
eprinttype = {arXiv},
eprint = {1501.00304},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlamEKPTU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlamE0KPSU15,
author = {Md. Jawaherul Alam and
David Eppstein and
Michael Kaufmann and
Stephen G. Kobourov and
Sergey Pupyrev and
Andr{\'{e}} Schulz and
Torsten Ueckerdt},
title = {Contact Representations of Sparse Planar Graphs},
journal = {CoRR},
volume = {abs/1501.00318},
year = {2015},
url = {http://arxiv.org/abs/1501.00318},
eprinttype = {arXiv},
eprint = {1501.00318},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlamE0KPSU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlamBRUW15,
author = {Muhammad Jawaherul Alam and
Thomas Bl{\"{a}}sius and
Ignaz Rutter and
Torsten Ueckerdt and
Alexander Wolff},
title = {Pixel and Voxel Representations of Graphs},
journal = {CoRR},
volume = {abs/1507.01450},
year = {2015},
url = {http://arxiv.org/abs/1507.01450},
eprinttype = {arXiv},
eprint = {1507.01450},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlamBRUW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AxenovichUW15,
author = {Maria Axenovich and
Torsten Ueckerdt and
Pascal Weiner},
title = {Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short
Paths},
journal = {CoRR},
volume = {abs/1507.02815},
year = {2015},
url = {http://arxiv.org/abs/1507.02815},
eprinttype = {arXiv},
eprint = {1507.02815},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AxenovichUW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KlawitterNU15,
author = {Jonathan Klawitter and
Martin N{\"{o}}llenburg and
Torsten Ueckerdt},
title = {Combinatorial Properties of Triangle-Free Rectangle Arrangements and
the Squarability Problem},
journal = {CoRR},
volume = {abs/1509.00835},
year = {2015},
url = {http://arxiv.org/abs/1509.00835},
eprinttype = {arXiv},
eprint = {1509.00835},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KlawitterNU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/WalzerAU14,
author = {Stefan Walzer and
Maria Axenovich and
Torsten Ueckerdt},
title = {Packing polyominoes clumsily},
journal = {Comput. Geom.},
volume = {47},
number = {1},
pages = {52--60},
year = {2014},
url = {https://doi.org/10.1016/j.comgeo.2013.08.011},
doi = {10.1016/J.COMGEO.2013.08.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/WalzerAU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeldtKU14,
author = {Daniel Heldt and
Kolja B. Knauer and
Torsten Ueckerdt},
title = {Edge-intersection graphs of grid paths: The bend-number},
journal = {Discret. Appl. Math.},
volume = {167},
pages = {144--162},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.10.035},
doi = {10.1016/J.DAM.2013.10.035},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HeldtKU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeldtKU14a,
author = {Daniel Heldt and
Kolja B. Knauer and
Torsten Ueckerdt},
title = {On the bend-number of planar and outerplanar graphs},
journal = {Discret. Appl. Math.},
volume = {179},
pages = {109--119},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.07.015},
doi = {10.1016/J.DAM.2014.07.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HeldtKU14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/AxenovichMU14,
author = {Maria Axenovich and
Ryan R. Martin and
Torsten Ueckerdt},
title = {Twins in graphs},
journal = {Eur. J. Comb.},
volume = {39},
pages = {188--197},
year = {2014},
url = {https://doi.org/10.1016/j.ejc.2014.01.007},
doi = {10.1016/J.EJC.2014.01.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/AxenovichMU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CardinalKMU14,
author = {Jean Cardinal and
Kolja B. Knauer and
Piotr Micek and
Torsten Ueckerdt},
title = {Making Octants Colorful and Related Covering Decomposition Problems},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {4},
pages = {1948--1959},
year = {2014},
url = {https://doi.org/10.1137/140955975},
doi = {10.1137/140955975},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CardinalKMU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BarthFKLNOPSUW14,
author = {Lukas Barth and
Sara Irina Fabrikant and
Stephen G. Kobourov and
Anna Lubiw and
Martin N{\"{o}}llenburg and
Yoshio Okamoto and
Sergey Pupyrev and
Claudio Squarcella and
Torsten Ueckerdt and
Alexander Wolff},
editor = {Alberto Pardo and
Alfredo Viola},
title = {Semantic Word Cloud Representations: Hardness and Approximation Algorithms},
booktitle = {{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium,
Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8392},
pages = {514--525},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-642-54423-1\_45},
doi = {10.1007/978-3-642-54423-1\_45},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/BarthFKLNOPSUW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FelsnerKMU14,
author = {Stefan Felsner and
Kolja B. Knauer and
George B. Mertzios and
Torsten Ueckerdt},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Intersection Graphs of L-Shapes and Segments in the Plane},
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 = {299--310},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_26},
doi = {10.1007/978-3-662-44465-8\_26},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FelsnerKMU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CardinalKMU14,
author = {Jean Cardinal and
Kolja B. Knauer and
Piotr Micek and
Torsten Ueckerdt},
editor = {Chandra Chekuri},
title = {Making Octants Colorful and Related Covering Decomposition Problems},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {1424--1432},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.105},
doi = {10.1137/1.9781611973402.105},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/CardinalKMU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KaufmannU14,
author = {Michael Kaufmann and
Torsten Ueckerdt},
title = {The Density of Fan-Planar Graphs},
journal = {CoRR},
volume = {abs/1403.6184},
year = {2014},
url = {http://arxiv.org/abs/1403.6184},
eprinttype = {arXiv},
eprint = {1403.6184},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KaufmannU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AxenovichU14,
author = {Maria Axenovich and
Torsten Ueckerdt},
title = {Density of range capturing hypergraphs},
journal = {CoRR},
volume = {abs/1404.1298},
year = {2014},
url = {http://arxiv.org/abs/1404.1298},
eprinttype = {arXiv},
eprint = {1404.1298},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AxenovichU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AxenovichCU14,
author = {Maria Axenovich and
Enrica Cherubini and
Torsten Ueckerdt},
title = {Spectrum of mixed bi-uniform hypergraphs},
journal = {CoRR},
volume = {abs/1407.1422},
year = {2014},
url = {http://arxiv.org/abs/1407.1422},
eprinttype = {arXiv},
eprint = {1407.1422},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AxenovichCU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FelsnerMU14,
author = {Stefan Felsner and
Piotr Micek and
Torsten Ueckerdt},
title = {On-line coloring between two lines},
journal = {CoRR},
volume = {abs/1411.0402},
year = {2014},
url = {http://arxiv.org/abs/1411.0402},
eprinttype = {arXiv},
eprint = {1411.0402},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FelsnerMU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HoskeRUW14,
author = {Daniel Hoske and
Jonathan Rollin and
Torsten Ueckerdt and
Stefan Walzer},
title = {Playing weighted Tron on Trees},
journal = {CoRR},
volume = {abs/1412.4100},
year = {2014},
url = {http://arxiv.org/abs/1412.4100},
eprinttype = {arXiv},
eprint = {1412.4100},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HoskeRUW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AlamBFKKU13,
author = {Md. Jawaherul Alam and
Therese Biedl and
Stefan Felsner and
Michael Kaufmann and
Stephen G. Kobourov and
Torsten Ueckerdt},
title = {Computing Cartograms with Optimal Complexity},
journal = {Discret. Comput. Geom.},
volume = {50},
number = {3},
pages = {784--810},
year = {2013},
url = {https://doi.org/10.1007/s00454-013-9521-1},
doi = {10.1007/S00454-013-9521-1},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/AlamBFKKU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChaplickU13,
author = {Steven Chaplick and
Torsten Ueckerdt},
title = {Planar Graphs as VPG-Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {4},
pages = {475--494},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00300},
doi = {10.7155/JGAA.00300},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChaplickU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/CardinalKMU13,
author = {Jean Cardinal and
Kolja B. Knauer and
Piotr Micek and
Torsten Ueckerdt},
title = {Making Triangles Colorful},
journal = {J. Comput. Geom.},
volume = {4},
number = {1},
pages = {240--246},
year = {2013},
url = {https://doi.org/10.20382/jocg.v4i1a10},
doi = {10.20382/JOCG.V4I1A10},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/CardinalKMU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KobourovUV13,
author = {Stephen G. Kobourov and
Torsten Ueckerdt and
Kevin Verbeek},
editor = {Sanjeev Khanna},
title = {Combinatorial and Geometric Properties of Planar Laman Graphs},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {1668--1678},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.120},
doi = {10.1137/1.9781611973105.120},
timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
biburl = {https://dblp.org/rec/conf/soda/KobourovUV13.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}
}
@inproceedings{DBLP:conf/wads/AsinowskiCCCHHKLLMRU13,
author = {Andrei Asinowski and
Jean Cardinal and
Nathann Cohen and
S{\'{e}}bastien Collette and
Thomas Hackl and
Michael Hoffmann and
Kolja B. Knauer and
Stefan Langerman and
Michal Lason and
Piotr Micek and
G{\"{u}}nter Rote and
Torsten Ueckerdt},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless
Rectangles},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {73--84},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_7},
doi = {10.1007/978-3-642-40104-6\_7},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/AsinowskiCCCHHKLLMRU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ChaplickKU13,
author = {Steven Chaplick and
Stephen G. Kobourov and
Torsten Ueckerdt},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Equilateral L-Contact Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {8165},
pages = {139--151},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_13},
doi = {10.1007/978-3-642-45043-3\_13},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/ChaplickKU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-2426,
author = {Andrei Asinowski and
Jean Cardinal and
Nathann Cohen and
S{\'{e}}bastien Collette and
Thomas Hackl and
Michael Hoffmann and
Kolja B. Knauer and
Stefan Langerman and
Michal Lason and
Piotr Micek and
G{\"{u}}nter Rote and
Torsten Ueckerdt},
title = {Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless
Rectangles},
journal = {CoRR},
volume = {abs/1302.2426},
year = {2013},
url = {http://arxiv.org/abs/1302.2426},
eprinttype = {arXiv},
eprint = {1302.2426},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-2426.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-1279,
author = {Steven Chaplick and
Stephen G. Kobourov and
Torsten Ueckerdt},
title = {Equilateral L-Contact Graphs},
journal = {CoRR},
volume = {abs/1303.1279},
year = {2013},
url = {http://arxiv.org/abs/1303.1279},
eprinttype = {arXiv},
eprint = {1303.1279},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-1279.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-8016,
author = {Lukas Barth and
Stephen G. Kobourov and
Sergey Pupyrev and
Torsten Ueckerdt},
title = {On Semantic Word Cloud Representation},
journal = {CoRR},
volume = {abs/1304.8016},
year = {2013},
url = {http://arxiv.org/abs/1304.8016},
eprinttype = {arXiv},
eprint = {1304.8016},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-8016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CardinalKMU13,
author = {Jean Cardinal and
Kolja B. Knauer and
Piotr Micek and
Torsten Ueckerdt},
title = {Making Octants Colorful and Related Covering Decomposition Problems},
journal = {CoRR},
volume = {abs/1307.2705},
year = {2013},
url = {http://arxiv.org/abs/1307.2705},
eprinttype = {arXiv},
eprint = {1307.2705},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CardinalKMU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BarthFKLNOPSUW13,
author = {Lukas Barth and
Sara Irina Fabrikant and
Stephen G. Kobourov and
Anna Lubiw and
Martin N{\"{o}}llenburg and
Yoshio Okamoto and
Sergey Pupyrev and
Claudio Squarcella and
Torsten Ueckerdt and
Alexander Wolff},
title = {Semantic Word Cloud Representations: Hardness and Approximation Algorithms},
journal = {CoRR},
volume = {abs/1311.4778},
year = {2013},
url = {http://arxiv.org/abs/1311.4778},
eprinttype = {arXiv},
eprint = {1311.4778},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BarthFKLNOPSUW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AlamBFKKU12,
author = {Md. Jawaherul Alam and
Therese Biedl and
Stefan Felsner and
Michael Kaufmann and
Stephen G. Kobourov and
Torsten Ueckerdt},
editor = {Tamal K. Dey and
Sue Whitesides},
title = {Computing cartograms with optimal complexity},
booktitle = {Proceedings of the 28th {ACM} Symposium on Computational Geometry,
Chapel Hill, NC, USA, June 17-20, 2012},
pages = {21--30},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2261250.2261254},
doi = {10.1145/2261250.2261254},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AlamBFKKU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/ChaplickU12,
author = {Steven Chaplick and
Torsten Ueckerdt},
editor = {Walter Didimo and
Maurizio Patrignani},
title = {Planar Graphs as VPG-Graphs},
booktitle = {Graph Drawing - 20th International Symposium, {GD} 2012, Redmond,
WA, USA, September 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7704},
pages = {174--186},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-36763-2\_16},
doi = {10.1007/978-3-642-36763-2\_16},
timestamp = {Sun, 13 Nov 2022 09:57:28 +0100},
biburl = {https://dblp.org/rec/conf/gd/ChaplickU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/HeldtKU12,
author = {Daniel Heldt and
Kolja B. Knauer and
Torsten Ueckerdt},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {On the Bend-Number of Planar and Outerplanar Graphs},
booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {458--469},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_39},
doi = {10.1007/978-3-642-29344-3\_39},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/HeldtKU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-0066,
author = {Md. Jawaherul Alam and
Therese Biedl and
Stefan Felsner and
Michael Kaufmann and
Stephen G. Kobourov and
Torsten Ueckerdt},
title = {Computing Cartograms with Optimal Complexity},
journal = {CoRR},
volume = {abs/1201.0066},
year = {2012},
url = {http://arxiv.org/abs/1201.0066},
eprinttype = {arXiv},
eprint = {1201.0066},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-0066.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-1209-6506,
author = {Stephen G. Kobourov and
Torsten Ueckerdt and
Kevin Verbeek},
title = {Combinatorial and Geometric Properties of Planar Laman Graphs},
journal = {CoRR},
volume = {abs/1209.6506},
year = {2012},
url = {http://arxiv.org/abs/1209.6506},
eprinttype = {arXiv},
eprint = {1209.6506},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1209-6506.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-2346,
author = {Jean Cardinal and
Kolja B. Knauer and
Piotr Micek and
Torsten Ueckerdt},
title = {Making Triangles Colorful},
journal = {CoRR},
volume = {abs/1212.2346},
year = {2012},
url = {http://arxiv.org/abs/1212.2346},
eprinttype = {arXiv},
eprint = {1212.2346},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-2346.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KnauerMU11,
author = {Kolja B. Knauer and
Piotr Micek and
Torsten Ueckerdt},
title = {How to eat 4/9 of a pizza},
journal = {Discret. Math.},
volume = {311},
number = {16},
pages = {1635--1645},
year = {2011},
url = {https://doi.org/10.1016/j.disc.2011.03.015},
doi = {10.1016/J.DISC.2011.03.015},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KnauerMU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/ApfelbaumBFMPUZ11,
author = {Roel Apfelbaum and
Itay Ben{-}Dan and
Stefan Felsner and
Tillmann Miltzow and
Rom Pinchasi and
Torsten Ueckerdt and
Ran Ziv},
title = {Points with Large Quadrant Depth},
journal = {J. Comput. Geom.},
volume = {2},
number = {1},
pages = {128--143},
year = {2011},
url = {https://doi.org/10.20382/jocg.v2i1a7},
doi = {10.20382/JOCG.V2I1A7},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/ApfelbaumBFMPUZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-3353,
author = {Daniel Heldt and
Kolja B. Knauer and
Torsten Ueckerdt},
title = {On the bend-number of planar and outerplanar graphs},
journal = {CoRR},
volume = {abs/1112.3353},
year = {2011},
url = {http://arxiv.org/abs/1112.3353},
eprinttype = {arXiv},
eprint = {1112.3353},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-3353.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HeldtKU10,
author = {Daniel Heldt and
Kolja Knauer and
Torsten Ueckerdt},
title = {Edge-intersection graphs of grid paths: the bend-number},
journal = {CoRR},
volume = {abs/1009.2861},
year = {2010},
url = {http://arxiv.org/abs/1009.2861},
eprinttype = {arXiv},
eprint = {1009.2861},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HeldtKU10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csr/KavithaLMMRUZ09,
author = {Telikepalli Kavitha and
Christian Liebchen and
Kurt Mehlhorn and
Dimitrios Michail and
Romeo Rizzi and
Torsten Ueckerdt and
Katharina Anna Zweig},
title = {Cycle bases in graphs characterization, algorithms, complexity, and
applications},
journal = {Comput. Sci. Rev.},
volume = {3},
number = {4},
pages = {199--243},
year = {2009},
url = {https://doi.org/10.1016/j.cosrev.2009.08.001},
doi = {10.1016/J.COSREV.2009.08.001},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/csr/KavithaLMMRUZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0812-2870,
author = {Kolja B. Knauer and
Piotr Micek and
Torsten Ueckerdt},
title = {How to eat 4/9 of a pizza},
journal = {CoRR},
volume = {abs/0812.2870},
year = {2008},
url = {http://arxiv.org/abs/0812.2870},
eprinttype = {arXiv},
eprint = {0812.2870},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0812-2870.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-03-30 23:20 CET 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:
