Torsten Ueckerdt
Karlsruher Institut für Technologie
H-index: 20
Europe-Germany
Top articles of Torsten Ueckerdt
Title | Journal | Author(s) | Publication Date |
---|---|---|---|
The Density Formula: One Lemma to Bound Them All | arXiv preprint arXiv:2311.06193 | Michael Kaufmann Boris Klemz Kristin Knorr Meghana M Reddy Felix Schröder | 2023/11/10 |
Partitioning a Planar Graph into two Triangle-Forests | arXiv preprint arXiv:2401.15394 | Kolja Knauer Torsten Ueckerdt | 2024/1/27 |
Recognition Complexity of Subgraphs of 2-and 3-Connected Planar Cubic Graphs | Miriam Goetze Paul Jungeblut Torsten Ueckerdt | 2024 | |
Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets | arXiv preprint arXiv:2310.19982 | Tim Planken Torsten Ueckerdt | 2023/10/30 |
Clustered independence and bounded treewidth | arXiv preprint arXiv:2303.13655 | Kolja Knauer Torsten Ueckerdt | 2023/3/23 |
A sublinear bound on the page number of upward planar graphs | SIAM Journal on Discrete Mathematics | Paul Jungeblut Laura Merker Torsten Ueckerdt | 2023/12/31 |
Shallow Hitting Edge Sets in Uniform Hypergraphs | arXiv preprint arXiv:2307.05757 | Tim Planken Torsten Ueckerdt | 2023/7/7 |
Primal-dual cops and robber | Computing in Geometry and Topology | Minh Tuan Ha Paul Jungeblut Torsten Ueckerdt Paweł Żyliński | 2024/1 |
Tight bound on treedepth in terms of pathwidth and longest path | Combinatorica | Meike Hatzel Gwenaël Joret Piotr Micek Marcin Pilipczuk Torsten Ueckerdt | 2023/12/19 |
Axis-parallel right angle crossing graphs | arXiv preprint arXiv:2306.17073 | Patrizio Angelini Michael A Bekos Julia Katheder Michael Kaufmann Maximilian Pfister | 2023/6/29 |
Colouring bottomless rectangles and arborescences | Computational Geometry | Jean Cardinal Kolja Knauer Piotr Micek Dömötör Pálvölgyi Torsten Ueckerdt | 2023/12/1 |
Cops and Robber-When Capturing Is Not Surrounding | Paul Jungeblut Samuel Schneider Torsten Ueckerdt | 2023/6/28 | |
Directed acyclic outerplanar graphs have constant stack number | Paul Jungeblut Laura Merker Torsten Ueckerdt | 2023 | |
On the complexity of embedding in graph products | arXiv preprint arXiv:2303.17028 | Therese Biedl David Eppstein Torsten Ueckerdt | 2023/3/29 |
On comparable box dimension | arXiv preprint arXiv:2203.07686 | Zdenek Dvorák Daniel Gonçalves Abhiruk Lahiri Jane Tan Torsten Ueckerdt | 2022/3/15 |
Polychromatic colorings of unions of geometric hypergraphs | Vera Chekan Torsten Ueckerdt | 2022/6/22 | |
An improved planar graph product structure theorem | Electronic J. Combinatorics | Torsten Ueckerdt Wendy Yi David R. Wood | 2022 |
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs | Miriam Goetze Paul Jungeblut Torsten Ueckerdt | 2022/9/1 | |
On the queue-number of partial orders | Stefan Felsner Torsten Ueckerdt Kaja Wille | 2021 | |
An Evaluation of Graph Algorithms for the Wind Farm Cable Layout Problem under Electrical Aspects | Sascha Gritzbach Hüseyin Çakmak Pascal Mehnert Torsten Ueckerdt Veit Hagenmeyer | 2021/8/31 |