Torsten Ueckerdt

174 papers A* 11A 19B 13C 2Journal 126Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds. CoRR Håvard Bakke Bjerkevik, Joseph Dorfer, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber
2026	J	`jnl`	Recognition Complexity of Subgraphs of bf k-Connected Planar Cubic Graphs. Algorithmica Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt
2026	J	`jnl`	The r-dynamic chromatic number is bounded in the strong 2-coloring number. Discret. Math. Miriam Goetze, Torsten Ueckerdt
2025	J	`jnl`	Boundedness and Separation in the Graph Covering Number Framework. CoRR Miriam Goetze, Peter Stumpf, Torsten Ueckerdt
2025	J	`jnl`	Cops and Robber - When Capturing is not Surrounding. Electron. J. Comb. Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt
2025	J	`jnl`	Crossing Number of 3-Plane Drawings. CoRR Miriam Goetze, Michael Hoffmann, Ignaz Rutter, Torsten Ueckerdt
2025	A	`conf`	Crossing Number of Simple 3-Plane Drawings. GD Miriam Goetze, Michael Hoffmann, Ignaz Rutter, Torsten Ueckerdt
2025	J	`jnl`	Directed Acyclic Outerplanar Graphs Have Constant Stack Number. TheoretiCS Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2025	A	`conf`	Edge Densities of Drawings of Graphs with One Forbidden Cell. GD Benedikt Hahn, Torsten Ueckerdt, Birgit Vogtenhuber
2025	J	`jnl`	Edge densities of drawings of graphs with one forbidden cell. CoRR Benedikt Hahn, Torsten Ueckerdt, Birgit Vogtenhuber
2025	A*	`conf`	Flipping Non-Crossing Spanning Trees. SODA Håvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber
2025	B	`conf`	Linear Layouts of Graphs with Priority Queues. WADS Emilio Di Giacomo, Walter Didimo, Henry Förster, Torsten Ueckerdt, Johannes Zink
2025	J	`jnl`	Linear Layouts of Graphs with Priority Queues. CoRR Emilio Di Giacomo, Walter Didimo, Henry Förster, Torsten Ueckerdt, Johannes Zink
2025	J	`jnl`	Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods. CoRR Samuel Schneider, Torsten Ueckerdt
2025	J	`jnl`	Odd coloring graphs with linear neighborhood complexity. CoRR James Davies, Meike Hatzel, Kolja Knauer, Rose McCarty, Torsten Ueckerdt
2025	J	`jnl`	On the Complexity of Embedding in Graph Products. Comput. Geom. Topol. Therese Biedl, David Eppstein, Torsten Ueckerdt
2025	J	`jnl`	Plattenbauten: Touching Rectangles in Space. SIAM J. Discret. Math. Stefan Felsner, Kolja Knauer, Torsten Ueckerdt
2025	A	`conf`	The Price of Connectivity Augmentation on Planar Graphs. GD Hugo A. Akitaya, Justin Dallant, Erik D. Demaine, Michael Kaufmann, Linda Kleist, Frederick Stock, Csaba D. Tóth, Torsten Ueckerdt
2025	J	`jnl`	The Price of Connectivity Augmentation on Planar Graphs. CoRR Hugo A. Akitaya, Justin Dallant, Erik D. Demaine, Michael Kaufmann, Linda Kleist, Frederick Stock, Csaba D. Tóth, Torsten Ueckerdt
2025	J	`jnl`	The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number. CoRR Miriam Goetze, Torsten Ueckerdt
2025	A	`conf`	Transforming Stacks into Queues: Mixed and Separated Layouts of Graphs. STACS Julia Katheder, Michael Kaufmann, Sergey Pupyrev, Torsten Ueckerdt
2024	J	`jnl`	A Note on Polychromatic Colorings of Shift-Chains. CoRR Torsten Ueckerdt
2024	J	`jnl`	Edge-minimum saturated k-planar drawings. J. Graph Theory Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt
2024	J	`jnl`	Flipping Non-Crossing Spanning Trees. CoRR Håvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber
2024	A	`conf`	Intersection Graphs with and Without Product Structure. GD Laura Merker, Lena Scherzer, Samuel Schneider, Torsten Ueckerdt
2024	J	`jnl`	Intersection Graphs with and without Product Structure. CoRR Laura Merker, Lena Scherzer, Samuel Schneider, Torsten Ueckerdt
2024	J	`jnl`	Partitioning a Planar Graph into two Triangle-Forests. CoRR Kolja Knauer, Torsten Ueckerdt
2024	A*	`conf`	Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets. SoCG Tim Planken, Torsten Ueckerdt
2024	J	`jnl`	Primal-Dual Cops and Robber. Comput. Geom. Topol. Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt, Pawel Zylinski
2024	J	`jnl`	Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs. CoRR Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt
2024	A	`conf`	The Density Formula: One Lemma to Bound Them All. GD Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt
2024	J	`jnl`	Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Comb. Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
2023	J	`jnl`	A Sublinear Bound on the Page Number of Upward Planar Graphs. SIAM J. Discret. Math. Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2023	A	`conf`	Axis-Parallel Right Angle Crossing Graphs. ESA Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
2023	J	`jnl`	Axis-Parallel Right Angle Crossing Graphs. CoRR Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
2023	J	`jnl`	Clustered independence and bounded treewidth. CoRR Kolja Knauer, Torsten Ueckerdt
2023	J	`jnl`	Colouring bottomless rectangles and arborescences. Comput. Geom. Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan
2023	B	`conf`	Cops and Robber - When Capturing Is Not Surrounding. WG Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt
2023	J	`jnl`	Cops and Robber - When Capturing is not Surrounding. CoRR Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt
2023	A*	`conf`	Directed Acyclic Outerplanar Graphs Have Constant Stack Number. FOCS Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2023	—	`conf`	On the complexity of embedding in graph products. CCCG Therese Biedl, David Eppstein, Torsten Ueckerdt
2023	J	`jnl`	On the complexity of embedding in graph products. CoRR Therese Biedl, David Eppstein, Torsten Ueckerdt
2023	J	`jnl`	Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets. CoRR Tim Planken, Torsten Ueckerdt
2023	J	`jnl`	Primal-Dual Cops and Robber. CoRR Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt, Pawel Zylinski
2023	J	`jnl`	Shallow Hitting Edge Sets in Uniform Hypergraphs. CoRR Tim Planken, Torsten Ueckerdt
2023	J	`jnl`	The Density Formula: One Lemma to Bound Them All. CoRR Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt
2023	J	`jnl`	Tight bound on treedepth in terms of pathwidth and longest path. CoRR Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
2022	A*	`conf`	A Sublinear Bound on the Page Number of Upward Planar Graphs. SODA Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2022	J	`jnl`	An Improved Planar Graph Product Structure Theorem. Electron. J. Comb. Torsten Ueckerdt, David R. Wood, Wendy Yi
2022	J	`jnl`	Directed Acyclic Outerplanar Graphs Have Constant Stack Number. CoRR Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2022	A	`conf`	Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. ESA Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt
2022	J	`jnl`	Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. CoRR Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt
2022	A*	`conf`	On Comparable Box Dimension. SoCG Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
2022	J	`jnl`	On Comparable Box Dimension. CoRR Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
2022	B	`conf`	Polychromatic Colorings of Unions of Geometric Hypergraphs. WG Vera Chekan, Torsten Ueckerdt
2022	J	`jnl`	The Density of Fan-Planar Graphs. Electron. J. Comb. Michael Kaufmann, Torsten Ueckerdt
2022	A*	`conf`	Weak Coloring Numbers of Intersection Graphs. SoCG Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky
2021	J	`jnl`	A Sublinear Bound on the Page Number of Upward Planar Graphs. CoRR Paul Jungeblut, Laura Merker, Torsten Ueckerdt
2021	J	`jnl`	An improved planar graph product structure theorem. CoRR Torsten Ueckerdt, David R. Wood, Wendy Yi
2021	A	`conf`	Edge-Minimum Saturated k-Planar Drawings. GD Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt
2021	A	`conf`	Linear Layouts of Complete Graphs. GD Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr
2021	J	`jnl`	Linear Layouts of Complete Graphs. CoRR Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr
2021	J	`jnl`	On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. SIAM J. Discret. Math. Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt
2021	A	`conf`	On the Queue-Number of Partial Orders. GD Stefan Felsner, Torsten Ueckerdt, Kaja Wille
2021	J	`jnl`	On the Queue-Number of Partial Orders. CoRR Stefan Felsner, Torsten Ueckerdt, Kaja Wille
2021	J	`jnl`	Polychromatic Colorings of Unions of Geometric Hypergraphs. CoRR Vera Chekan, Torsten Ueckerdt
2021	J	`jnl`	The interval number of a planar graph is at most three. J. Comb. Theory B Guillaume Guégan, Kolja Knauer, Jonathan Rollin, Torsten Ueckerdt
2021	J	`jnl`	The number of crossings in multigraphs with no empty lens. J. Graph Algorithms Appl. Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
2021	B	`conf`	Using the Metro-Map Metaphor for Drawing Hypergraphs. SOFSEM Fabian Frank, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, Alexander Wolff
2021	J	`jnl`	Weak Coloring Numbers of Intersection Graphs. CoRR Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky
2020	J	`jnl`	Edge-Minimum Saturated k-Planar Drawings. CoRR Steven Chaplick, Jonathan Rollin, Torsten Ueckerdt
2020	J	`jnl`	Four Pages Are Indeed Necessary for Planar Graphs. CoRR Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2020	J	`jnl`	Four Pages Are Indeed Necessary for Planar Graphs. J. Comput. Geom. Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2020	B	`conf`	Guarding Quadrangulations and Stacked Triangulations with Edges. WG Paul Jungeblut, Torsten Ueckerdt
2020	J	`jnl`	Guarding Quadrangulations and Stacked Triangulations with Edges. CoRR Paul Jungeblut, Torsten Ueckerdt
2020	J	`jnl`	On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. CoRR Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt
2020	J	`jnl`	Planar Graphs Have Bounded Queue-Number. J. ACM Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
2020	B	`conf`	Plattenbauten: Touching Rectangles in Space. WG Stefan Felsner, Kolja Knauer, Torsten Ueckerdt
2020	J	`jnl`	Plattenbauten: Touching Rectangles in Space. CoRR Stefan Felsner, Kolja Knauer, Torsten Ueckerdt
2020	A	`conf`	The Local Queue Number of Graphs with Bounded Treewidth. GD Laura Merker, Torsten Ueckerdt
2020	J	`jnl`	The Local Queue Number of Graphs with Bounded Treewidth. CoRR Laura Merker, Torsten Ueckerdt
2019	J	`jnl`	A Note on Covering Young Diagrams with Applications to Local Dimension of Posets. CoRR Stefan Felsner, Torsten Ueckerdt
2019	J	`jnl`	Decomposing 4-connected planar triangulations into two trees and one path. J. Comb. Theory B Kolja Knauer, Torsten Ueckerdt
2019	A	`conf`	Engineering Negative Cycle Canceling for Wind Farm Cabling. ESA Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf
2019	J	`jnl`	Engineering Negative Cycle Canceling for Wind Farm Cabling. CoRR Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf
2019	J	`jnl`	Induced and weak induced arboricities. Discret. Math. Maria Axenovich, Philip Dörr, Jonathan Rollin, Torsten Ueckerdt
2019	A	`conf`	Local and Union Page Numbers. GD Laura Merker, Torsten Ueckerdt
2019	J	`jnl`	Local and Union Page Numbers. CoRR Laura Merker, Torsten Ueckerdt
2019	A*	`conf`	Planar Graphs have Bounded Queue-Number. FOCS Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
2019	J	`jnl`	Planar Graphs have Bounded Queue-Number. CoRR Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
2019	J	`jnl`	Planar Graphs of Bounded Degree Have Bounded Queue Number. SIAM J. Comput. Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2019	J	`jnl`	Planar Ramsey Graphs. Electron. J. Comb. Maria Axenovich, Ursula Schade, Carsten Thomassen, Torsten Ueckerdt
2019	A*	`conf`	Planar graphs of bounded degree have bounded queue number. STOC Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2018	B	`conf`	Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. ISAAC Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
2018	J	`jnl`	Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs. Comb. Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
2018	J	`jnl`	Induced and Weak Induced Arboricities. CoRR Maria Axenovich, Philip Dörr, Jonathan Rollin, Torsten Ueckerdt
2018	J	`jnl`	Local and union boxicity. Discret. Math. Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt
2018	J	`jnl`	On the Maximum Crossing Number. J. Graph Algorithms Appl. Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
2018	J	`jnl`	Planar Graphs of Bounded Degree have Constant Queue Number. CoRR Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2018	J	`jnl`	Planar Ramsey graphs. CoRR Maria Axenovich, Carsten Thomassen, Ursula Schade, Torsten Ueckerdt
2018	J	`jnl`	Publisher Correction: Towards negative cycle canceling in wind farm cable layout optimization. Energy Inform. Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf
2018	A	`conf`	The Number of Crossings in Multigraphs with No Empty Lens. GD Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
2018	A	`conf`	The Queue-Number of Posets of Bounded Width or Height. GD Kolja Knauer, Piotr Micek, Torsten Ueckerdt
2018	J	`jnl`	The interval number of a planar graph is at most three. CoRR Guillaume Guégan, Kolja Knauer, Jonathan Rollin, Torsten Ueckerdt
2018	J	`jnl`	The k-strong induced arboricity of a graph. Eur. J. Comb. Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt
2018	J	`jnl`	The number of crossings in multigraphs with no empty lens. CoRR Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
2018	J	`jnl`	The queue-number of planar posets. CoRR Kolja Knauer, Piotr Micek, Torsten Ueckerdt
2018	J	`jnl`	Towards negative cycle canceling in wind farm cable layout optimization. Energy Inform. Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf
2017	J	`jnl`	Beyond-Planarity: Density Results for Bipartite Graphs. CoRR Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
2017	J	`jnl`	Conditions on Ramsey Nonequivalence. J. Graph Theory Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
2017	J	`jnl`	Decomposing 4-connected planar triangulations into two trees and one path. CoRR Kolja Knauer, Torsten Ueckerdt
2017	C	`conf`	On the Maximum Crossing Number. IWOCA Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
2017	J	`jnl`	On the Maximum Crossing Number. CoRR Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
2017	J	`jnl`	Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths. J. Graph Theory Maria Axenovich, Torsten Ueckerdt, Pascal Weiner
2017	J	`jnl`	The chromatic number of ordered graphs with constrained conflict graphs. Australas. J Comb. Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
2016	J	`jnl`	A Note on Concurrent Graph Sharing Games. Integers Steven Chaplick, Piotr Micek, Torsten Ueckerdt, Veit Wiechert
2016	J	`jnl`	Chromatic number of ordered graphs with forbidden ordered subgraphs. CoRR Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
2016	J	`jnl`	Convex-Arc Drawings of Pseudolines. CoRR David Eppstein, Mereke van Garderen, Bettina Speckmann, Torsten Ueckerdt
2016	J	`jnl`	Density of range capturing hypergraphs. J. Comput. Geom. Maria Axenovich, Torsten Ueckerdt
2016	J	`jnl`	Intersection graphs of L-shapes and segments in the plane. Discret. Appl. Math. Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt
2016	J	`jnl`	Local and Union Boxicity. CoRR Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt
2016	J	`jnl`	Spectrum of Mixed Bi-uniform Hypergraphs. Graphs Comb. Maria Axenovich, Enrica Cherubini, Torsten Ueckerdt
2016	J	`jnl`	The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs. CoRR Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
2016	J	`jnl`	The k-strong induced arboricity of a graph. CoRR Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt
2016	J	`jnl`	Three ways to cover a graph. Discret. Math. Kolja B. Knauer, Torsten Ueckerdt
2015	A	`conf`	Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. GD Jonathan Klawitter, Martin Nöllenburg, Torsten Ueckerdt
2015	J	`jnl`	Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. CoRR Jonathan Klawitter, Martin Nöllenburg, Torsten Ueckerdt
2015	B	`conf`	Contact Graphs of Circular Arcs. WADS Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt
2015	B	`conf`	Contact Representations of Graphs in 3D. WADS Md. Jawaherul Alam, William S. Evans, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt
2015	J	`jnl`	Contact Representations of Sparse Planar Graphs. CoRR Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt
2015	A*	`conf`	On-line Coloring between Two Lines. SoCG Stefan Felsner, Piotr Micek, Torsten Ueckerdt
2015	A	`conf`	Pixel and Voxel Representations of Graphs. GD Md. Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff
2015	J	`jnl`	Pixel and Voxel Representations of Graphs. CoRR Muhammad Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff
2015	J	`jnl`	Playing weighted Tron on trees. Discret. Math. Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt, Stefan Walzer
2015	J	`jnl`	Primal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs. CoRR Md. Jawaherul Alam, William S. Evans, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt
2015	J	`jnl`	Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths. CoRR Maria Axenovich, Torsten Ueckerdt, Pascal Weiner
2014	J	`jnl`	Density of range capturing hypergraphs. CoRR Maria Axenovich, Torsten Ueckerdt
2014	J	`jnl`	Edge-intersection graphs of grid paths: The bend-number. Discret. Appl. Math. Daniel Heldt, Kolja B. Knauer, Torsten Ueckerdt
2014	—	`conf`	Intersection Graphs of L-Shapes and Segments in the Plane. MFCS (2) Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt
2014	A*	`conf`	Making Octants Colorful and Related Covering Decomposition Problems. SODA Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2014	J	`jnl`	Making Octants Colorful and Related Covering Decomposition Problems. SIAM J. Discret. Math. Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2014	J	`jnl`	On the bend-number of planar and outerplanar graphs. Discret. Appl. Math. Daniel Heldt, Kolja B. Knauer, Torsten Ueckerdt
2014	J	`jnl`	On-line coloring between two lines. CoRR Stefan Felsner, Piotr Micek, Torsten Ueckerdt
2014	J	`jnl`	Packing polyominoes clumsily. Comput. Geom. Stefan Walzer, Maria Axenovich, Torsten Ueckerdt
2014	J	`jnl`	Playing weighted Tron on Trees. CoRR Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt, Stefan Walzer
2014	B	`conf`	Semantic Word Cloud Representations: Hardness and Approximation Algorithms. LATIN Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff
2014	J	`jnl`	Spectrum of mixed bi-uniform hypergraphs. CoRR Maria Axenovich, Enrica Cherubini, Torsten Ueckerdt
2014	J	`jnl`	The Density of Fan-Planar Graphs. CoRR Michael Kaufmann, Torsten Ueckerdt
2014	J	`jnl`	Twins in graphs. Eur. J. Comb. Maria Axenovich, Ryan R. Martin, Torsten Ueckerdt
2013	J	`jnl`	Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles CoRR Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt
2013	B	`conf`	Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt
2013	A*	`conf`	Combinatorial and Geometric Properties of Planar Laman Graphs. SODA Stephen G. Kobourov, Torsten Ueckerdt, Kevin Verbeek
2013	J	`jnl`	Computing Cartograms with Optimal Complexity. Discret. Comput. Geom. Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt
2013	J	`jnl`	Equilateral L-Contact Graphs CoRR Steven Chaplick, Stephen G. Kobourov, Torsten Ueckerdt
2013	B	`conf`	Equilateral L-Contact Graphs. WG Steven Chaplick, Stephen G. Kobourov, Torsten Ueckerdt
2013	J	`jnl`	Making Octants Colorful and Related Covering Decomposition Problems. CoRR Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2013	J	`jnl`	Making Triangles Colorful. J. Comput. Geom. Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2013	C	`conf`	Non-crossing Connectors in the Plane. TAMC Jan Kratochvíl, Torsten Ueckerdt
2013	J	`jnl`	On Semantic Word Cloud Representation CoRR Lukas Barth, Stephen G. Kobourov, Sergey Pupyrev, Torsten Ueckerdt
2013	J	`jnl`	Planar Graphs as VPG-Graphs. J. Graph Algorithms Appl. Steven Chaplick, Torsten Ueckerdt
2013	J	`jnl`	Semantic Word Cloud Representations: Hardness and Approximation Algorithms. CoRR Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff
2012	J	`jnl`	Combinatorial and Geometric Properties of Planar Laman Graphs CoRR Stephen G. Kobourov, Torsten Ueckerdt, Kevin Verbeek
2012	J	`jnl`	Computing Cartograms with Optimal Complexity CoRR Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt
2012	—	`conf`	Computing cartograms with optimal complexity. SCG Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt
2012	J	`jnl`	Making Triangles Colorful CoRR Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2012	J	`jnl`	Non-crossing Connectors in the Plane CoRR Jan Kratochvíl, Torsten Ueckerdt
2012	B	`conf`	On the Bend-Number of Planar and Outerplanar Graphs. LATIN Daniel Heldt, Kolja B. Knauer, Torsten Ueckerdt
2012	A	`conf`	Planar Graphs as VPG-Graphs. GD Steven Chaplick, Torsten Ueckerdt
2011	J	`jnl`	How to eat 4/9 of a pizza. Discret. Math. Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2011	J	`jnl`	On the bend-number of planar and outerplanar graphs CoRR Daniel Heldt, Kolja B. Knauer, Torsten Ueckerdt
2011	J	`jnl`	Points with Large Quadrant Depth. J. Comput. Geom. Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, Torsten Ueckerdt, Ran Ziv
2010	J	`jnl`	Edge-intersection graphs of grid paths: the bend-number. CoRR Daniel Heldt, Kolja Knauer, Torsten Ueckerdt
2009	J	`jnl`	Cycle bases in graphs characterization, algorithms, complexity, and applications. Comput. Sci. Rev. Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina A. Zweig
2008	J	`jnl`	How to eat 4/9 of a pizza CoRR Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt