Torsten Ueckerdt

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 99

Top Venues

CoRR

Graph Drawing

SoCG

Publications

Tim Planken, Torsten Ueckerdt
Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets. SoCG (2024)
Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt, Pawel Zylinski
Primal-Dual Cops and Robber. Comput. Geom. Topol. 3 (2) (2024)
Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt
Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs. CoRR (2024)
Kolja Knauer, Torsten Ueckerdt
Partitioning a Planar Graph into two Triangle-Forests. CoRR (2024)
Torsten Ueckerdt
A Note on Polychromatic Colorings of Shift-Chains. CoRR (2024)
Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Comb. 44 (2) (2024)
Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
Axis-Parallel Right Angle Crossing Graphs. CoRR (2023)
Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt
Cops and Robber - When Capturing is not Surrounding. CoRR (2023)
Therese Biedl, David Eppstein, Torsten Ueckerdt
On the complexity of embedding in graph products. CoRR (2023)
Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt
Cops and Robber - When Capturing Is Not Surrounding. WG (2023)
Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
Axis-Parallel Right Angle Crossing Graphs. ESA (2023)
Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
Tight bound on treedepth in terms of pathwidth and longest path. CoRR (2023)
Kolja Knauer, Torsten Ueckerdt
Clustered independence and bounded treewidth. CoRR (2023)
Tim Planken, Torsten Ueckerdt
Shallow Hitting Edge Sets in Uniform Hypergraphs. CoRR (2023)
Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt
Primal-Dual Cops and Robber. CoRR (2023)
Tim Planken, Torsten Ueckerdt
Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets. CoRR (2023)
Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt
The Density Formula: One Lemma to Bound Them All. CoRR (2023)
Therese Biedl, David Eppstein, Torsten Ueckerdt
On the complexity of embedding in graph products. CCCG (2023)
Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan
Colouring bottomless rectangles and arborescences. Comput. Geom. 115 (2023)
Paul Jungeblut, Laura Merker, Torsten Ueckerdt
A Sublinear Bound on the Page Number of Upward Planar Graphs. SIAM J. Discret. Math. 37 (4) (2023)
Paul Jungeblut, Laura Merker, Torsten Ueckerdt
Directed Acyclic Outerplanar Graphs Have Constant Stack Number. FOCS (2023)
Torsten Ueckerdt, David R. Wood, Wendy Yi
An Improved Planar Graph Product Structure Theorem. Electron. J. Comb. 29 (2) (2022)
Paul Jungeblut, Laura Merker, Torsten Ueckerdt
Directed Acyclic Outerplanar Graphs Have Constant Stack Number. CoRR (2022)
Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky
Weak Coloring Numbers of Intersection Graphs. SoCG (2022)
Michael Kaufmann, Torsten Ueckerdt
The Density of Fan-Planar Graphs. Electron. J. Comb. 29 (1) (2022)
Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. ESA (2022)
Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. CoRR (2022)
Paul Jungeblut, Laura Merker, Torsten Ueckerdt
A Sublinear Bound on the Page Number of Upward Planar Graphs. SODA (2022)
Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
On Comparable Box Dimension. CoRR (2022)
Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
On Comparable Box Dimension. SoCG (2022)
Vera Chekan, Torsten Ueckerdt
Polychromatic Colorings of Unions of Geometric Hypergraphs. WG (2022)
Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr
Linear Layouts of Complete Graphs. CoRR (2021)
Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky
Weak Coloring Numbers of Intersection Graphs. CoRR (2021)
Vera Chekan, Torsten Ueckerdt
Polychromatic Colorings of Unions of Geometric Hypergraphs. CoRR (2021)
Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt
Edge-Minimum Saturated k-Planar Drawings. Graph Drawing (2021)
Torsten Ueckerdt, David R. Wood, Wendy Yi
An improved planar graph product structure theorem. CoRR (2021)
Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr
Linear Layouts of Complete Graphs. Graph Drawing (2021)
Stefan Felsner, Torsten Ueckerdt, Kaja Wille
On the Queue-Number of Partial Orders. CoRR (2021)
Paul Jungeblut, Laura Merker, Torsten Ueckerdt
A Sublinear Bound on the Page Number of Upward Planar Graphs. CoRR (2021)
Guillaume Guégan, Kolja Knauer, Jonathan Rollin, Torsten Ueckerdt
The interval number of a planar graph is at most three. J. Comb. Theory, Ser. B 146 (2021)
Fabian Frank, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, Alexander Wolff
Using the Metro-Map Metaphor for Drawing Hypergraphs. SOFSEM (2021)
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
The number of crossings in multigraphs with no empty lens. J. Graph Algorithms Appl. 25 (1) (2021)
Stefan Felsner, Torsten Ueckerdt, Kaja Wille
On the Queue-Number of Partial Orders. Graph Drawing (2021)
Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. SIAM J. Discret. Math. 35 (2) (2021)
Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
Four Pages Are Indeed Necessary for Planar Graphs. J. Comput. Geom. 11 (1) (2020)
Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
Four Pages Are Indeed Necessary for Planar Graphs. CoRR (2020)
Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. CoRR (2020)
Stefan Felsner, Kolja Knauer, Torsten Ueckerdt
Plattenbauten: Touching Rectangles in Space. WG (2020)
Paul Jungeblut, Torsten Ueckerdt
Guarding Quadrangulations and Stacked Triangulations with Edges. WG (2020)
Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
Planar Graphs Have Bounded Queue-Number. J. ACM 67 (4) (2020)
Stefan Felsner, Kolja Knauer, Torsten Ueckerdt
Plattenbauten: Touching Rectangles in Space. CoRR (2020)
Laura Merker, Torsten Ueckerdt
The Local Queue Number of Graphs with Bounded Treewidth. Graph Drawing (2020)
Laura Merker, Torsten Ueckerdt
The Local Queue Number of Graphs with Bounded Treewidth. CoRR (2020)
Paul Jungeblut, Torsten Ueckerdt
Guarding Quadrangulations and Stacked Triangulations with Edges. CoRR (2020)
Steven Chaplick, Jonathan Rollin, Torsten Ueckerdt
Edge-Minimum Saturated k-Planar Drawings. CoRR (2020)
Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
Planar graphs of bounded degree have bounded queue number. STOC (2019)
Maria Axenovich, Ursula Schade, Carsten Thomassen, Torsten Ueckerdt
Planar Ramsey Graphs. Electron. J. Comb. 26 (4) (2019)
Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf
Engineering Negative Cycle Canceling for Wind Farm Cabling. ESA (2019)
Laura Merker, Torsten Ueckerdt
Local and Union Page Numbers. Graph Drawing (2019)
Maria Axenovich, Philip Dörr, Jonathan Rollin, Torsten Ueckerdt
Induced and weak induced arboricities. Discret. Math. 342 (2) (2019)
Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf
Engineering Negative Cycle Canceling for Wind Farm Cabling. CoRR (2019)
Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
Planar Graphs of Bounded Degree Have Bounded Queue Number. SIAM J. Comput. 48 (5) (2019)
Stefan Felsner, Torsten Ueckerdt
A Note on Covering Young Diagrams with Applications to Local Dimension of Posets. CoRR (2019)
Kolja Knauer, Torsten Ueckerdt
Decomposing 4-connected planar triangulations into two trees and one path. J. Comb. Theory, Ser. B 134 (2019)
Laura Merker, Torsten Ueckerdt
Local and Union Page Numbers. CoRR (2019)
Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
Planar Graphs have Bounded Queue-Number. CoRR (2019)
Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
Planar Graphs have Bounded Queue-Number. FOCS (2019)
Maria Axenovich, Carsten Thomassen, Ursula Schade, Torsten Ueckerdt
Planar Ramsey graphs. CoRR (2018)
Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
On the Maximum Crossing Number. J. Graph Algorithms Appl. 22 (1) (2018)
Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf
Towards negative cycle canceling in wind farm cable layout optimization. Energy Inform. 1 (S1) (2018)
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. ISAAC (2018)
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
The number of crossings in multigraphs with no empty lens. CoRR (2018)
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
The Queue-Number of Posets of Bounded Width or Height. Graph Drawing (2018)
Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt
The k-strong induced arboricity of a graph. Eur. J. Comb. 67 (2018)
Guillaume Guégan, Kolja Knauer, Jonathan Rollin, Torsten Ueckerdt
The interval number of a planar graph is at most three. CoRR (2018)
Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt
Local and union boxicity. Discret. Math. 341 (5) (2018)
Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
Planar Graphs of Bounded Degree have Constant Queue Number. CoRR (2018)
Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf
Publisher Correction: Towards negative cycle canceling in wind farm cable layout optimization. Energy Inform. 1 (1) (2018)
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs. Comb. 38 (5) (2018)
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
The Number of Crossings in Multigraphs with No Empty Lens. Graph Drawing (2018)
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
The queue-number of planar posets. CoRR (2018)
Maria Axenovich, Philip Dörr, Jonathan Rollin, Torsten Ueckerdt
Induced and Weak Induced Arboricities. CoRR (2018)
Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
On the Maximum Crossing Number. CoRR (2017)
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
Beyond-Planarity: Density Results for Bipartite Graphs. CoRR (2017)
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
The chromatic number of ordered graphs with constrained conflict graphs. Australas. J Comb. 69 (2017)
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
Conditions on Ramsey Nonequivalence. J. Graph Theory 86 (2) (2017)
Kolja Knauer, Torsten Ueckerdt
Decomposing 4-connected planar triangulations into two trees and one path. CoRR (2017)
Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
On the Maximum Crossing Number. IWOCA (2017)
Maria Axenovich, Torsten Ueckerdt, Pascal Weiner
Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths. J. Graph Theory 85 (3) (2017)
Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt
The k-strong induced arboricity of a graph. CoRR (2016)
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs. CoRR (2016)
Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt
Intersection graphs of L-shapes and segments in the plane. Discret. Appl. Math. 206 (2016)
Kolja B. Knauer, Torsten Ueckerdt
Three ways to cover a graph. Discret. Math. 339 (2) (2016)
Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt
Local and Union Boxicity. CoRR (2016)
Maria Axenovich, Torsten Ueckerdt
Density of range capturing hypergraphs. J. Comput. Geom. 7 (1) (2016)
Steven Chaplick, Piotr Micek, Torsten Ueckerdt, Veit Wiechert
A Note on Concurrent Graph Sharing Games. Integers 16 (2016)
David Eppstein, Mereke van Garderen, Bettina Speckmann, Torsten Ueckerdt
Convex-Arc Drawings of Pseudolines. CoRR (2016)
Maria Axenovich, Enrica Cherubini, Torsten Ueckerdt
Spectrum of Mixed Bi-uniform Hypergraphs. Graphs Comb. 32 (2) (2016)
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
Chromatic number of ordered graphs with forbidden ordered subgraphs. CoRR (2016)
Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt, Stefan Walzer
Playing weighted Tron on trees. Discret. Math. 338 (12) (2015)

Torsten Ueckerdt.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Torsten Ueckerdt