Cycle bases in graphs characterization, algorithms, complexity, and applications. - Telikepalli Kavitha; Christian Liebchen; Kurt Mehlhorn; Dimitrios Michail 001; Romeo Rizzi; Torsten Ueckerdt; Katharina Anna Zweig (Comput. Sci. Rev., 2009)

How to eat 4/9 of a pizza. - Kolja B. Knauer; Piotr Micek; Torsten Ueckerdt (Discret. Math., 2011)

Points with Large Quadrant Depth. - Roel Apfelbaum; Itay Ben-Dan; Stefan Felsner; Tillmann Miltzow; Rom Pinchasi; Torsten Ueckerdt; Ran Ziv (J. Comput. Geom., 2011)

Combinatorial and Geometric Properties of Planar Laman Graphs. - Stephen G. Kobourov; Torsten Ueckerdt; Kevin Verbeek (SODA, 2013)

Non-crossing Connectors in the Plane. - Jan Kratochvíl; Torsten Ueckerdt (TAMC, 2013)

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. - Andrei Asinowski; Jean Cardinal; Nathann Cohen; Sébastien Collette; Thomas Hackl; Michael Hoffmann 001; Kolja B. Knauer; Stefan Langerman; Michal Lason; Piotr Micek; Günter Rote; Torsten Ueckerdt (WADS, 2013)

Equilateral L-Contact Graphs. - Steven Chaplick; Stephen G. Kobourov; Torsten Ueckerdt (WG, 2013)

On Semantic Word Cloud Representation - Lukas Barth; Stephen G. Kobourov; Sergey Pupyrev; Torsten Ueckerdt (CoRR, 2013)

Computing Cartograms with Optimal Complexity. - Md. Jawaherul Alam; Therese Biedl; Stefan Felsner; Michael Kaufmann 001; Stephen G. Kobourov; Torsten Ueckerdt (Discret. Comput. Geom., 2013)

Planar Graphs as VPG-Graphs. - Steven Chaplick; Torsten Ueckerdt (J. Graph Algorithms Appl., 2013)

Making Triangles Colorful. - Jean Cardinal; Kolja B. Knauer; Piotr Micek; Torsten Ueckerdt (J. Comput. Geom., 2013)

Semantic Word Cloud Representations: Hardness and Approximation Algorithms. - Lukas Barth; Sara Irina Fabrikant; Stephen G. Kobourov; Anna Lubiw; Martin Nöllenburg; Yoshio Okamoto; Sergey Pupyrev; Claudio Squarcella; Torsten Ueckerdt; Alexander Wolff 001 (LATIN, 2014)

Packing polyominoes clumsily. - Stefan Walzer; Maria Axenovich; Torsten Ueckerdt (Comput. Geom., 2014)

Edge-intersection graphs of grid paths: The bend-number. - Daniel Heldt; Kolja B. Knauer; Torsten Ueckerdt (Discret. Appl. Math., 2014)

On the bend-number of planar and outerplanar graphs. - Daniel Heldt; Kolja B. Knauer; Torsten Ueckerdt (Discret. Appl. Math., 2014)

Twins in graphs. - Maria Axenovich; Ryan R. Martin; Torsten Ueckerdt (Eur. J. Comb., 2014)

Making Octants Colorful and Related Covering Decomposition Problems. - Jean Cardinal; Kolja B. Knauer; Piotr Micek; Torsten Ueckerdt (SIAM J. Discret. Math., 2014)

On-line Coloring between Two Lines. - Stefan Felsner; Piotr Micek; Torsten Ueckerdt (SoCG, 2015)

Pixel and Voxel Representations of Graphs. - Md. Jawaherul Alam; Thomas Bläsius; Ignaz Rutter; Torsten Ueckerdt; Alexander Wolff 001 (GD, 2015)

Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. - Jonathan Klawitter; Martin Nöllenburg; Torsten Ueckerdt (GD, 2015)

Contact Graphs of Circular Arcs. - Md. Jawaherul Alam; David Eppstein; Michael Kaufmann 001; Stephen G. Kobourov; Sergey Pupyrev; André Schulz 001; Torsten Ueckerdt (WADS, 2015)

Contact Representations of Graphs in 3D. - Md. Jawaherul Alam; William S. Evans; Stephen G. Kobourov; Sergey Pupyrev; Jackson Toeniskoetter; Torsten Ueckerdt (WADS, 2015)

Contact Representations of Sparse Planar Graphs. - Md. Jawaherul Alam; David Eppstein; Michael Kaufmann 001; Stephen G. Kobourov; Sergey Pupyrev; André Schulz 001; Torsten Ueckerdt (CoRR, 2015)

Primal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs. - Md. Jawaherul Alam; William S. Evans; Stephen G. Kobourov; Sergey Pupyrev; Jackson Toeniskoetter; Torsten Ueckerdt (CoRR, 2015)

Playing weighted Tron on trees. - Daniel Hoske; Jonathan Rollin; Torsten Ueckerdt; Stefan Walzer (Discret. Math., 2015)

Convex-Arc Drawings of Pseudolines. - David Eppstein; Mereke van Garderen; Bettina Speckmann; Torsten Ueckerdt (CoRR, 2016)

Intersection graphs of L-shapes and segments in the plane. - Stefan Felsner; Kolja B. Knauer; George B. Mertzios; Torsten Ueckerdt (Discret. Appl. Math., 2016)

Three ways to cover a graph. - Kolja B. Knauer; Torsten Ueckerdt (Discret. Math., 2016)

Spectrum of Mixed Bi-uniform Hypergraphs. - Maria Axenovich; Enrica Cherubini; Torsten Ueckerdt (Graphs Comb., 2016)

A Note on Concurrent Graph Sharing Games. - Steven Chaplick; Piotr Micek; Torsten Ueckerdt; Veit Wiechert (Integers, 2016)

Density of range capturing hypergraphs. - Maria Axenovich; Torsten Ueckerdt (J. Comput. Geom., 2016)

The chromatic number of ordered graphs with constrained conflict graphs. - Maria Axenovich; Jonathan Rollin; Torsten Ueckerdt (Australas. J Comb., 2017)

Beyond-Planarity: Density Results for Bipartite Graphs. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Maximilian Pfister 002; Torsten Ueckerdt (CoRR, 2017)

Conditions on Ramsey Nonequivalence. - Maria Axenovich; Jonathan Rollin; Torsten Ueckerdt (J. Graph Theory, 2017)

Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths. - Maria Axenovich; Torsten Ueckerdt; Pascal Weiner (J. Graph Theory, 2017)

The Queue-Number of Posets of Bounded Width or Height. - Kolja Knauer; Piotr Micek; Torsten Ueckerdt (GD, 2018)

Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Maximilian Pfister 002; Torsten Ueckerdt (ISAAC, 2018)

Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs. - Maria Axenovich; Jonathan Rollin; Torsten Ueckerdt (Comb., 2018)

The queue-number of planar posets. - Kolja Knauer; Piotr Micek; Torsten Ueckerdt (CoRR, 2018)

Planar Graphs of Bounded Degree have Constant Queue Number. - Michael A. Bekos; Henry Förster; Martin Gronemann; Tamara Mchedlidze; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Torsten Ueckerdt (CoRR, 2018)

Local and union boxicity. - Thomas Bläsius; Peter Stumpf; Torsten Ueckerdt (Discret. Math., 2018)

The k-strong induced arboricity of a graph. - Maria Axenovich; Daniel Gonçalves 001; Jonathan Rollin; Torsten Ueckerdt (Eur. J. Comb., 2018)

Publisher Correction: Towards negative cycle canceling in wind farm cable layout optimization. - Sascha Gritzbach; Torsten Ueckerdt; Dorothea Wagner; Franziska Wegner; Matthias Wolf 004 (Energy Inform., 2018)

Towards negative cycle canceling in wind farm cable layout optimization. - Sascha Gritzbach; Torsten Ueckerdt; Dorothea Wagner; Franziska Wegner; Matthias Wolf 004 (Energy Inform., 2018)

On the Maximum Crossing Number. - Markus Chimani; Stefan Felsner; Stephen G. Kobourov; Torsten Ueckerdt; Pavel Valtr 001; Alexander Wolff 001 (J. Graph Algorithms Appl., 2018)

Engineering Negative Cycle Canceling for Wind Farm Cabling. - Sascha Gritzbach; Torsten Ueckerdt; Dorothea Wagner; Franziska Wegner; Matthias Wolf 004 (ESA, 2019)

Local and Union Page Numbers. - Laura Merker; Torsten Ueckerdt (GD, 2019)

Planar Ramsey Graphs. - Maria Axenovich; Ursula Schade; Carsten Thomassen; Torsten Ueckerdt (Electron. J. Comb., 2019)

A Note on Covering Young Diagrams with Applications to Local Dimension of Posets. - Stefan Felsner; Torsten Ueckerdt (CoRR, 2019)

Induced and weak induced arboricities. - Maria Axenovich; Philip Dörr; Jonathan Rollin; Torsten Ueckerdt (Discret. Math., 2019)

Decomposing 4-connected planar triangulations into two trees and one path. - Kolja Knauer; Torsten Ueckerdt (J. Comb. Theory B, 2019)

Planar Graphs of Bounded Degree Have Bounded Queue Number. - Michael A. Bekos; Henry Förster; Martin Gronemann; Tamara Mchedlidze; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Torsten Ueckerdt (SIAM J. Comput., 2019)

The Local Queue Number of Graphs with Bounded Treewidth. - Laura Merker; Torsten Ueckerdt (GD, 2020)

Guarding Quadrangulations and Stacked Triangulations with Edges. - Paul Jungeblut; Torsten Ueckerdt (WG, 2020)

Edge-Minimum Saturated k-Planar Drawings. - Steven Chaplick; Jonathan Rollin; Torsten Ueckerdt (CoRR, 2020)

Planar Graphs Have Bounded Queue-Number. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin; Torsten Ueckerdt; David R. Wood (J. ACM, 2020)

Four Pages Are Indeed Necessary for Planar Graphs. - Michael A. Bekos; Michael Kaufmann 001; Fabian Klute; Sergey Pupyrev; Chrysanthi N. Raftopoulou; Torsten Ueckerdt (J. Comput. Geom., 2020)

Linear Layouts of Complete Graphs. - Stefan Felsner; Laura Merker; Torsten Ueckerdt; Pavel Valtr 001 (GD, 2021)

On the Queue-Number of Partial Orders. - Stefan Felsner; Torsten Ueckerdt; Kaja Wille (GD, 2021)

Using the Metro-Map Metaphor for Drawing Hypergraphs. - Fabian Frank; Michael Kaufmann 001; Stephen G. Kobourov; Tamara Mchedlidze; Sergey Pupyrev; Torsten Ueckerdt; Alexander Wolff 001 (SOFSEM, 2021)

The interval number of a planar graph is at most three. - Guillaume Guégan; Kolja Knauer; Jonathan Rollin; Torsten Ueckerdt (J. Comb. Theory B, 2021)

The number of crossings in multigraphs with no empty lens. - Michael Kaufmann 001; János Pach; Géza Tóth 001; Torsten Ueckerdt (J. Graph Algorithms Appl., 2021)

On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. - Gábor Damásdi; Stefan Felsner; António Girão; Balázs Keszegh; David Lewis; Dániel T. Nagy; Torsten Ueckerdt (SIAM J. Discret. Math., 2021)

On Comparable Box Dimension. - Zdenek Dvorák 001; Daniel Gonçalves 001; Abhiruk Lahiri; Jane Tan; Torsten Ueckerdt (SoCG, 2022)

Weak Coloring Numbers of Intersection Graphs. - Zdenek Dvorák 001; Jakub Pekárek; Torsten Ueckerdt; Yelena Yuditsky (SoCG, 2022)

Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. - Miriam Goetze; Paul Jungeblut; Torsten Ueckerdt (ESA, 2022)

Polychromatic Colorings of Unions of Geometric Hypergraphs. - Vera Chekan; Torsten Ueckerdt (WG, 2022)

The Density of Fan-Planar Graphs. - Michael Kaufmann 001; Torsten Ueckerdt (Electron. J. Comb., 2022)

An Improved Planar Graph Product Structure Theorem. - Torsten Ueckerdt; David R. Wood; Wendy Yi (Electron. J. Comb., 2022)

On the complexity of embedding in graph products. - Therese Biedl; David Eppstein; Torsten Ueckerdt (CCCG, 2023)

Axis-Parallel Right Angle Crossing Graphs. - Patrizio Angelini; Michael A. Bekos; Julia Katheder; Michael Kaufmann 001; Maximilian Pfister 002; Torsten Ueckerdt (ESA, 2023)

Directed Acyclic Outerplanar Graphs Have Constant Stack Number. - Paul Jungeblut; Laura Merker; Torsten Ueckerdt (FOCS, 2023)

Cops and Robber - When Capturing Is Not Surrounding. - Paul Jungeblut; Samuel Schneider; Torsten Ueckerdt (WG, 2023)

Clustered independence and bounded treewidth. - Kolja Knauer; Torsten Ueckerdt (CoRR, 2023)

Shallow Hitting Edge Sets in Uniform Hypergraphs. - Tim Planken; Torsten Ueckerdt (CoRR, 2023)

Colouring bottomless rectangles and arborescences. - Jean Cardinal; Kolja Knauer; Piotr Micek; Dömötör Pálvölgyi; Torsten Ueckerdt; Narmada Varadarajan (Comput. Geom., 2023)

A Sublinear Bound on the Page Number of Upward Planar Graphs. - Paul Jungeblut; Laura Merker; Torsten Ueckerdt (SIAM J. Discret. Math., 2023)

Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets. - Tim Planken; Torsten Ueckerdt (SoCG, 2024)

The Density Formula: One Lemma to Bound Them All. - Michael Kaufmann 001; Boris Klemz; Kristin Knorr; Meghana M. Reddy; Felix Schröder; Torsten Ueckerdt (GD, 2024)

Intersection Graphs with and Without Product Structure. - Laura Merker; Lena Scherzer; Samuel Schneider; Torsten Ueckerdt (GD, 2024)

Primal-Dual Cops and Robber. - Minh Tuan Ha; Paul Jungeblut; Torsten Ueckerdt; Pawel Zylinski (Comput. Geom. Topol., 2024)

Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs. - Miriam Goetze; Paul Jungeblut; Torsten Ueckerdt (CoRR, 2024)

Partitioning a Planar Graph into two Triangle-Forests. - Kolja Knauer; Torsten Ueckerdt (CoRR, 2024)

A Note on Polychromatic Colorings of Shift-Chains. - Torsten Ueckerdt (CoRR, 2024)

Edge-minimum saturated k-planar drawings. - Steven Chaplick; Fabian Klute; Irene Parada; Jonathan Rollin; Torsten Ueckerdt (J. Graph Theory, 2024)

Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. - Meike Hatzel; Gwenaël Joret; Piotr Micek; Marcin Pilipczuk; Torsten Ueckerdt; Bartosz Walczak (Comb., 2024)

Flipping Non-Crossing Spanning Trees. - Håvard Bakke Bjerkevik; Linda Kleist; Torsten Ueckerdt; Birgit Vogtenhuber (SODA, 2025)

Transforming Stacks into Queues: Mixed and Separated Layouts of Graphs. - Julia Katheder; Michael Kaufmann 001; Sergey Pupyrev; Torsten Ueckerdt (STACS, 2025)

Linear Layouts of Graphs with Priority Queues. - Emilio Di Giacomo; Walter Didimo; Henry Förster; Torsten Ueckerdt; Johannes Zink 001 (WADS, 2025)

Plattenbauten: Touching Rectangles in Space. - Stefan Felsner; Kolja Knauer; Torsten Ueckerdt (SIAM J. Discret. Math., 2025)

Crossing Number of 3-Plane Drawings. - Miriam Goetze; Michael Hoffmann 001; Ignaz Rutter; Torsten Ueckerdt (CoRR, 2025)

Boundedness and Separation in the Graph Covering Number Framework. - Miriam Goetze; Peter Stumpf; Torsten Ueckerdt (CoRR, 2025)

Odd coloring graphs with linear neighborhood complexity. - James Davies; Meike Hatzel; Kolja Knauer; Rose McCarty; Torsten Ueckerdt (CoRR, 2025)

The r-dynamic chromatic number is bounded in the strong 2-coloring number. - Miriam Goetze; Torsten Ueckerdt (Discret. Math., 2026)