Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTorsten Ueckerdt
Person information
- affiliation: Karlsruhe Institute of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[i58]Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt:
Primal-Dual Cops and Robber. CoRR abs/2301.05514 (2023)- [i57]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 abs/2302.02995 (2023) - [i56]Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt:
Cops and Robber - When Capturing is not Surrounding. CoRR abs/2302.10577 (2023) - 2022
- [j37]Michael Kaufmann, Torsten Ueckerdt:
The Density of Fan-Planar Graphs. Electron. J. Comb. 29(1) (2022) - [j36]Torsten Ueckerdt, David R. Wood, Wendy Yi:
An Improved Planar Graph Product Structure Theorem. Electron. J. Comb. 29(2) (2022) - [c35]Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt:
On Comparable Box Dimension. SoCG 2022: 38:1-38:14 - [c34]Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky:
Weak Coloring Numbers of Intersection Graphs. SoCG 2022: 39:1-39:15 - [c33]Miriam Goetze, Paul Jungeblut
, Torsten Ueckerdt:
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. ESA 2022: 62:1-62:14 - [c32]Paul Jungeblut, Laura Merker, Torsten Ueckerdt:
A Sublinear Bound on the Page Number of Upward Planar Graphs. SODA 2022: 963-978 - [c31]Vera Chekan, Torsten Ueckerdt:
Polychromatic Colorings of Unions of Geometric Hypergraphs. WG 2022: 144-157 - [i55]Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt:
On Comparable Box Dimension. CoRR abs/2203.07686 (2022) - [i54]Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt:
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. CoRR abs/2204.11750 (2022) - [i53]Paul Jungeblut, Laura Merker, Torsten Ueckerdt:
Directed Acyclic Outerplanar Graphs Have Constant Stack Number. CoRR abs/2211.04732 (2022) - 2021
- [j35]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: 61-67 (2021) - [j34]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): 383-396 (2021) - [j33]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): 915-927 (2021) - [c30]Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt:
Edge-Minimum Saturated k-Planar Drawings. GD 2021: 3-17 - [c29]Stefan Felsner, Torsten Ueckerdt, Kaja Wille:
On the Queue-Number of Partial Orders. GD 2021: 231-241 - [c28]Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr:
Linear Layouts of Complete Graphs. GD 2021: 257-270 - [c27]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: 361-372 - [i52]Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky:
Weak Coloring Numbers of Intersection Graphs. CoRR abs/2103.17094 (2021) - [i51]Paul Jungeblut, Laura Merker, Torsten Ueckerdt:
A Sublinear Bound on the Page Number of Upward Planar Graphs. CoRR abs/2107.05227 (2021) - [i50]Torsten Ueckerdt, David R. Wood, Wendy Yi:
An improved planar graph product structure theorem. CoRR abs/2108.00198 (2021) - [i49]Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr:
Linear Layouts of Complete Graphs. CoRR abs/2108.05112 (2021) - [i48]Stefan Felsner, Torsten Ueckerdt, Kaja Wille:
On the Queue-Number of Partial Orders. CoRR abs/2108.09994 (2021) - [i47]Vera Chekan, Torsten Ueckerdt:
Polychromatic Colorings of Unions of Geometric Hypergraphs. CoRR abs/2112.02894 (2021) - 2020
- [j32]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs Have Bounded Queue-Number. J. ACM 67(4): 22:1-22:38 (2020) - [j31]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): 332-353 (2020) - [c26]Laura Merker, Torsten Ueckerdt:
The Local Queue Number of Graphs with Bounded Treewidth. GD 2020: 26-39 - [c25]Paul Jungeblut, Torsten Ueckerdt:
Guarding Quadrangulations and Stacked Triangulations with Edges. WG 2020: 14-26 - [c24]Stefan Felsner, Kolja Knauer, Torsten Ueckerdt:
Plattenbauten: Touching Rectangles in Space. WG 2020: 161-173 - [i46]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 abs/2001.06367 (2020) - [i45]Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Four Pages Are Indeed Necessary for Planar Graphs. CoRR abs/2004.07630 (2020) - [i44]Paul Jungeblut, Torsten Ueckerdt:
Guarding Quadrangulations and Stacked Triangulations with Edges. CoRR abs/2006.13722 (2020) - [i43]Stefan Felsner, Kolja Knauer, Torsten Ueckerdt:
Plattenbauten: Touching Rectangles in Space. CoRR abs/2007.07806 (2020) - [i42]Laura Merker, Torsten Ueckerdt:
The Local Queue Number of Graphs with Bounded Treewidth. CoRR abs/2008.05392 (2020) - [i41]Steven Chaplick, Jonathan Rollin, Torsten Ueckerdt:
Edge-Minimum Saturated k-Planar Drawings. CoRR abs/2012.08631 (2020)
2010 – 2019
- 2019
- [j30]Maria Axenovich, Ursula Schade, Carsten Thomassen, Torsten Ueckerdt:
Planar Ramsey Graphs. Electron. J. Comb. 26(4): 4 (2019) - [j29]Maria Axenovich, Philip Dörr, Jonathan Rollin, Torsten Ueckerdt:
Induced and weak induced arboricities. Discret. Math. 342(2): 511-519 (2019) - [j28]Kolja Knauer, Torsten Ueckerdt:
Decomposing 4-connected planar triangulations into two trees and one path. J. Comb. Theory, Ser. B 134: 88-109 (2019) - [j27]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): 1487-1502 (2019) - [c23]Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf:
Engineering Negative Cycle Canceling for Wind Farm Cabling. ESA 2019: 55:1-55:16 - [c22]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs have Bounded Queue-Number. FOCS 2019: 862-875 - [c21]Laura Merker, Torsten Ueckerdt:
Local and Union Page Numbers. GD 2019: 447-459 - [c20]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: 176-184 - [i40]Stefan Felsner, Torsten Ueckerdt:
A Note on Covering Young Diagrams with Applications to Local Dimension of Posets. CoRR abs/1902.08223 (2019) - [i39]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs have Bounded Queue-Number. CoRR abs/1904.04791 (2019) - [i38]Laura Merker, Torsten Ueckerdt:
Local and Union Page Numbers. CoRR abs/1907.09994 (2019) - [i37]Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf:
Engineering Negative Cycle Canceling for Wind Farm Cabling. CoRR abs/1908.02129 (2019) - 2018
- [j26]Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs. Comb. 38(5): 1021-1043 (2018) - [j25]Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt:
Local and union boxicity. Discret. Math. 341(5): 1307-1315 (2018) - [j24]Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt:
The k-strong induced arboricity of a graph. Eur. J. Comb. 67: 1-20 (2018) - [j23]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) - [j22]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) - [j21]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. J. Graph Algorithms Appl. 22(1): 67-87 (2018) - [c19]Kolja Knauer, Piotr Micek, Torsten Ueckerdt:
The Queue-Number of Posets of Bounded Width or Height. GD 2018: 200-212 - [c18]Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt:
The Number of Crossings in Multigraphs with No Empty Lens. GD 2018: 242-254 - [c17]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. ISAAC 2018: 28:1-28:13 - [i36]Maria Axenovich, Philip Dörr, Jonathan Rollin, Torsten Ueckerdt:
Induced and Weak Induced Arboricities. CoRR abs/1803.02152 (2018) - [i35]Guillaume Guégan, Kolja Knauer, Jonathan Rollin, Torsten Ueckerdt:
The interval number of a planar graph is at most three. CoRR abs/1805.02947 (2018) - [i34]Kolja Knauer, Piotr Micek, Torsten Ueckerdt:
The queue-number of planar posets. CoRR abs/1806.04489 (2018) - [i33]Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt:
The number of crossings in multigraphs with no empty lens. CoRR abs/1808.10480 (2018) - [i32]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 abs/1811.00816 (2018) - [i31]Maria Axenovich, Carsten Thomassen, Ursula Schade, Torsten Ueckerdt:
Planar Ramsey graphs. CoRR abs/1812.00832 (2018) - 2017
- [j20]Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
The chromatic number of ordered graphs with constrained conflict graphs. Australas. J Comb. 69: 74-104 (2017) - [j19]Maria Axenovich, Torsten Ueckerdt, Pascal Weiner:
Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths. J. Graph Theory 85(3): 601-618 (2017) - [j18]Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
Conditions on Ramsey Nonequivalence. J. Graph Theory 86(2): 159-192 (2017) - [c16]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. IWOCA 2017: 61-74 - [i30]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. CoRR abs/1705.05176 (2017) - [i29]Kolja Knauer, Torsten Ueckerdt:
Decomposing 4-connected planar triangulations into two trees and one path. CoRR abs/1710.02411 (2017) - [i28]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Beyond-Planarity: Density Results for Bipartite Graphs. CoRR abs/1712.09855 (2017) - 2016
- [j17]Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt:
Intersection graphs of L-shapes and segments in the plane. Discret. Appl. Math. 206: 48-55 (2016) - [j16]Kolja B. Knauer, Torsten Ueckerdt:
Three ways to cover a graph. Discret. Math. 339(2): 745-758 (2016) - [j15]Maria Axenovich, Enrica Cherubini, Torsten Ueckerdt:
Spectrum of Mixed Bi-uniform Hypergraphs. Graphs Comb. 32(2): 453-461 (2016) - [j14]Steven Chaplick, Piotr Micek, Torsten Ueckerdt, Veit Wiechert:
A Note on Concurrent Graph Sharing Games. Integers 16: G1 (2016) - [j13]Maria Axenovich, Torsten Ueckerdt:
Density of range capturing hypergraphs. J. Comput. Geom. 7(1): 1-21 (2016) - [i27]David Eppstein, Mereke van Garderen, Bettina Speckmann, Torsten Ueckerdt:
Convex-Arc Drawings of Pseudolines. CoRR abs/1601.06865 (2016) - [i26]Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
Chromatic number of ordered graphs with forbidden ordered subgraphs. CoRR abs/1603.00312 (2016) - [i25]Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt:
The k-strong induced arboricity of a graph. CoRR abs/1607.07174 (2016) - [i24]Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt:
Local and Union Boxicity. CoRR abs/1609.09447 (2016) - [i23]Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs. CoRR abs/1610.01111 (2016) - 2015
- [j12]Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt, Stefan Walzer:
Playing weighted Tron on trees. Discret. Math. 338(12): 2341-2347 (2015) - [c15]Stefan Felsner, Piotr Micek, Torsten Ueckerdt:
On-line Coloring between Two Lines. SoCG 2015: 630-641 - [c14]Jonathan Klawitter, Martin Nöllenburg, Torsten Ueckerdt:
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. GD 2015: 231-244 - [c13]Md. Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff:
Pixel and Voxel Representations of Graphs. GD 2015: 472-486 - [c12]Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt:
Contact Graphs of Circular Arcs. WADS 2015: 1-13 - [c11]Md. Jawaherul Alam, William S. Evans, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt:
Contact Representations of Graphs in 3D. WADS 2015: 14-27 - [i22]Md. Jawaherul Alam, William S. Evans, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt:
Primal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs. CoRR abs/1501.00304 (2015) - [i21]Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt:
Contact Representations of Sparse Planar Graphs. CoRR abs/1501.00318 (2015) - [i20]Muhammad Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff:
Pixel and Voxel Representations of Graphs. CoRR abs/1507.01450 (2015) - [i19]Maria Axenovich, Torsten Ueckerdt, Pascal Weiner:
Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths. CoRR abs/1507.02815 (2015) - [i18]Jonathan Klawitter, Martin Nöllenburg, Torsten Ueckerdt:
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. CoRR abs/1509.00835 (2015) - 2014
- [j11]Stefan Walzer, Maria Axenovich, Torsten Ueckerdt:
Packing polyominoes clumsily. Comput. Geom. 47(1): 52-60 (2014) - [j10]Daniel Heldt, Kolja B. Knauer, Torsten Ueckerdt:
Edge-intersection graphs of grid paths: The bend-number. Discret. Appl. Math. 167: 144-162 (2014) - [j9]Daniel Heldt, Kolja B. Knauer, Torsten Ueckerdt:
On the bend-number of planar and outerplanar graphs. Discret. Appl. Math. 179: 109-119 (2014) - [j8]Maria Axenovich, Ryan R. Martin, Torsten Ueckerdt:
Twins in graphs. Eur. J. Comb. 39: 188-197 (2014) - [j7]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Octants Colorful and Related Covering Decomposition Problems. SIAM J. Discret. Math. 28(4): 1948-1959 (2014) - [c10]Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff:
Semantic Word Cloud Representations: Hardness and Approximation Algorithms. LATIN 2014: 514-525 - [c9]Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt:
Intersection Graphs of L-Shapes and Segments in the Plane. MFCS (2) 2014: 299-310 - [c8]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Octants Colorful and Related Covering Decomposition Problems. SODA 2014: 1424-1432 - [i17]Michael Kaufmann, Torsten Ueckerdt:
The Density of Fan-Planar Graphs. CoRR abs/1403.6184 (2014) - [i16]Maria Axenovich, Torsten Ueckerdt:
Density of range capturing hypergraphs. CoRR abs/1404.1298 (2014) - [i15]Maria Axenovich, Enrica Cherubini, Torsten Ueckerdt:
Spectrum of mixed bi-uniform hypergraphs. CoRR abs/1407.1422 (2014) - [i14]Stefan Felsner, Piotr Micek, Torsten Ueckerdt:
On-line coloring between two lines. CoRR abs/1411.0402 (2014) - [i13]Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt, Stefan Walzer:
Playing weighted Tron on Trees. CoRR abs/1412.4100 (2014) - 2013
- [j6]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
Computing Cartograms with Optimal Complexity. Discret. Comput. Geom. 50(3): 784-810 (2013) - [j5]Steven Chaplick, Torsten Ueckerdt:
Planar Graphs as VPG-Graphs. J. Graph Algorithms Appl. 17(4): 475-494 (2013) - [j4]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Triangles Colorful. J. Comput. Geom. 4(1): 240-246 (2013) - [c7]Stephen G. Kobourov, Torsten Ueckerdt, Kevin Verbeek:
Combinatorial and Geometric Properties of Planar Laman Graphs. SODA 2013: 1668-1678 - [c6]Jan Kratochvíl, Torsten Ueckerdt:
Non-crossing Connectors in the Plane. TAMC 2013: 108-120 - [c5]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:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS 2013: 73-84 - [c4]Steven Chaplick, Stephen G. Kobourov, Torsten Ueckerdt:
Equilateral L-Contact Graphs. WG 2013: 139-151 - [i12]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:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. CoRR abs/1302.2426 (2013) - [i11]Steven Chaplick, Stephen G. Kobourov, Torsten Ueckerdt:
Equilateral L-Contact Graphs. CoRR abs/1303.1279 (2013) - [i10]Lukas Barth, Stephen G. Kobourov, Sergey Pupyrev, Torsten Ueckerdt:
On Semantic Word Cloud Representation. CoRR abs/1304.8016 (2013) - [i9]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Octants Colorful and Related Covering Decomposition Problems. CoRR abs/1307.2705 (2013) - [i8]Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff:
Semantic Word Cloud Representations: Hardness and Approximation Algorithms. CoRR abs/1311.4778 (2013) - 2012
- [c3]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
Computing cartograms with optimal complexity. SCG 2012: 21-30 - [c2]Steven Chaplick, Torsten Ueckerdt:
Planar Graphs as VPG-Graphs. GD 2012: 174-186 - [c1]Daniel Heldt, Kolja B. Knauer, Torsten Ueckerdt:
On the Bend-Number of Planar and Outerplanar Graphs. LATIN 2012: 458-469 - [i7]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
Computing Cartograms with Optimal Complexity. CoRR abs/1201.0066 (2012) - [i6]Jan Kratochvíl, Torsten Ueckerdt:
Non-crossing Connectors in the Plane. CoRR abs/1201.0917 (2012) - [i5]