Torsten Ueckerdt

Veröffentlichungen

Artikel in Zeitschriften

  1. Conditions on Ramsey Nonequivalence.
    Journal of Graph Theory, 86(2):159-192, October 2017.
    Joint work with Maria Axenovich and Jonathan Rollin.
    [ html ]
  2. Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths.
    Journal of Graph Theory, 85(3):601-618, July 2017.
    Joint work with Maria Axenovich and Pascal Weiner.
    [ html ]
  3. Chromatic number of ordered graphs with forbidden ordered subgraphs.
    Combinatorica, 2017.
    Joint work with Maria Axenovich and Jonathan Rollin.
    [ html ]
  4. Spectrum of Mixed Bi-uniform Hypergraphs.
    Graphs and Combinatorics, 32(2):453-461, March 2016.
    Joint work with Maria Axenovich and Enrica Cherubini.
    [ html ]
  5. Three ways to cover a graph.
    Discrete Mathematics, 339(2):745-758, February 2016.
    Joint work with Kolja Knauer.
    [ html ]
  6. Density of range capturing hypergraphs.
    Journal of Computational Geometry, 7(1), 2016.
    Joint work with Maria Axenovich.
    [ html ]
  7. A Note on Concurrent Graph Sharing Games.
    Integers, 16, 2016.
    Joint work with Steven Chaplick, Piotr Micek, and Veit Wiechert.
    [ html | pdf ]
  8. Playing weighted Tron on trees.
    Discrete Mathematics, 338(12):2341-2347, December 2015.
    Joint work with Daniel Hoske, Jonathan Rollin, and Stefan Walzer.
    [ html ]
  9. On the bend-number of planar and outerplanar graphs.
    Discrete Applied Mathematics, 179:109-119, December 2014.
    Joint work with Daniel Heldt and Kolja Knauer.
    [ html ]
  10. Twins in graphs.
    European Journal of Combinatorics, 39:188-197, July 2014.
    Joint work with Maria Axenovich and Ryan Martin.
    [ html ]
  11. Edge-intersection graphs of grid paths: The bend-number.
    Discrete Applied Mathematics, 167:144-162, April 2014.
    Joint work with Daniel Heldt and Kolja Knauer.
    [ html ]
  12. Online and size anti-Ramsey numbers.
    Journal of Combinatorics, 5(1):87-114, 2014.
    Joint work with Maria Axenovich, Kolja Knauer, and Judith Stumpp.
    [ html ]
  13. Packing polyominoes clumsily.
    Computational Geometry, 47(1):52-60, January 2014.
    Joint work with Maria Axenovich and Stefan Walzer.
    [ html ]
  14. Making Octants Colorful and Related Covering Decomposition Problems.
    SIAM Journal on Discrete Mathematics, 28(4):1948-1959, 2014.
    Joint work with Jean Cardinal, Kolja Knauer, and Piotr Micek.
    [ html ]
  15. Computing Cartograms with Optimal Complexity.
    Discrete and Computational Geometry, 50(3):784-810, October 2013.
    Joint work with Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, and Stephen G. Kobourov.
    [ html ]
  16. Making triangles colorful.
    Journal of Computational Geometry, 4(1), 2013.
    Joint work with Jean Cardinal, Kolja Knauer, and Piotr Micek.
    [ html ]
  17. Planar Graphs as VPG-Graphs.
    Journal of Graph Algorithms and Applications, 17(4):475-494, 2013.
    Joint work with Steven Chaplick.
    [ html ]
  18. How to eat 4/9 of a pizza.
    Discrete Mathematics, 311(16):1635-1645, August 2011.
    Joint work with Kolja Knauer and Piotr Micek.
    [ html ]
  19. Points with large quadrant depth.
    Journal of Computational Geometry, 2(1), 2011.
    Joint work with Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, and Ran Ziv.
    [ html ]
  20. Cycle bases in graphs characterization, algorithms, complexity, and applications.
    Computer Science Review, 3(4):199-243, November 2009.
    Joint work with Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, and Katharina A. Zweig.
    [ html ]

Artikel in Tagungsbänden

  1. Pixel and Voxel Representations of Graphs.
    In: Proceedings of the 23rd International Symposium on Graph Drawing (GD'15), Lecture Notes in Computer Science, pages 472-486. Springer, 2015.
    To appear.
    Joint work with Md. Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, and Alexander Wolff.
    [ html ]
  2. Contact Graphs of Circular Arcs.
    In: Algorithms and Data Structures, 14th International Symposium (WADS'15), Lecture Notes in Computer Science, pages 1-13. Springer, 2015.
    Joint work with Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, and André Schulz.
    [ html ]
  3. Contact Representations of Graphs in 3D.
    In: Algorithms and Data Structures, 14th International Symposium (WADS'15), Lecture Notes in Computer Science, pages 14-27. Springer, 2015.
    Joint work with Md. Jawaherul Alam, William Evans, Stephen G. Kobourov, Sergey Pupyrev, and Jackson Toeniskoetter.
    [ html ]
  4. On-line Coloring between Two Lines.
    In: Proceedings of the 31st International Symposium on Computational Geometry (SoCG 2015), Leibniz International Proceedings in Informatics, pages 630-641, 2015.
    Joint work with Stefan Felsner and Piotr Micek.
    [ html ]
  5. Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem.
    In: Proceedings of the 23rd International Symposium on Graph Drawing (GD'15), Lecture Notes in Computer Science. Springer, 2015.
    To appear.
    Joint work with Jonathan Klawitter and Martin Nöllenburg.
  6. Graphs admitting d-realizers: spanning-tree-decompositions and box-representations.
    In: Proceedings of the 30th European Workshop on Computational Geometry (EuroCG'14), March 2014.
    Joint work with William Evans, Stefan Felsner, and Stephen G. Kobourov.
    [ pdf ]
  7. Semantic Word Cloud Representations: Hardness and Approximation Algorithms.
    In: Proceedings of the 11th Latin American Symposium on Theoretical Informatics (LATIN'14), volume 8392 of Lecture Notes in Computer Science, pages 514-525. Springer, 2014.
    Full version available at http://arxiv.org/abs/1311.4778.
    Joint work with Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, and Alexander Wolff.
    [ html | pdf ]
  8. Making Octants Colorful and Related Covering Decomposition Problems Making Octants Colorful and Related Covering Decomposition Problems.
    In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'14), pages 1424-1432. SIAM, 2014.
    Joint work with Jean Cardinal, Kolja Knauer, and Piotr Micek.
    [ html ]
  9. Intersection Graphs of L-Shapes and Segments in the Plane.
    In: Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS'14), Lecture Notes in Computer Science, pages 299-310. Springer, 2014.
    Joint work with Stefan Felsner, Kolja Knauer, and George B. Mertzios.
    [ html ]
  10. Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.
    In: Algorithms and Data Structures, 13th International Symposium (WADS'13), volume 8037 of Lecture Notes in Computer Science, pages 73-84. Springer, 2013.
    Joint work with Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja Knauer, Stefan Langerman, Michal Lason, Piotr Micek, and Günter Rote.
    [ html ]
  11. Equilateral L-Contact Graphs.
    In: Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), Lecture Notes in Computer Science, pages 139-151. Springer, 2013.
    Joint work with Steven Chaplick and Stephen G. Kobourov.
    [ html ]
  12. Planar Graphs as VPG-Graphs.
    In: Proceedings of the 20th International Symposium on Graph Drawing (GD'12), volume 7704 of Lecture Notes in Computer Science, pages 174-186. Springer, 2013.
    Joint work with Steven Chaplick.
    [ html ]
  13. Convex-Arc Drawings of Pseudolines.
    In: Proceedings of the 21st International Symposium on Graph Drawing (GD'13), volume 8242 of Lecture Notes in Computer Science, pages 522-523. Springer, 2013.
    Poster presentation.
    Joint work with David Eppstein, Mereke van Garderen, and Bettina Speckmann.
    [ pdf ]
  14. Non-crossing Connectors in the Plane.
    In: Proceedings of the 10th annual conference on Theory and applications of models of computation, Lecture Notes in Computer Science, pages 108-120. Springer, 2013.
    Joint work with Jan Kratochvíl.
    [ html ]
  15. Combinatorial and Geometric Properties of Planar Laman Graphs Combinatorial and Geometric Properties of Planar Laman Graphs.
    In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'13), pages 1668-1678. SIAM, 2013.
    Joint work with Stephen G. Kobourov and Kevin Verbeek.
    [ html ]
  16. Computing cartograms with optimal complexity.
    In: Proceedings of the 28th Annual ACM Symposium on Computational Geometry (SoCG'12), pages 21-30. ACM Press, 2012.
    Joint work with Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, and Stephen G. Kobourov.
    [ html ]
  17. On the Bend-Number of Planar and Outerplanar Graphs.
    In: Proceedings of the 10th Latin American Symposium on Theoretical Informatics (LATIN'12), Lecture Notes in Computer Science, pages 458-469, 2012.
    Joint work with Daniel Heldt and Kolja Knauer.
    [ html ]
  18. Points with large quadrant-depth.
    In: Proceedings of the 26th Annual ACM Symposium on Computational Geometry (SoCG'10), pages 358-364. ACM Press, 2010.
    Joint work with Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom Pinchasi, Tillmann Miltzow, and Ran Ziv.
    [ html ]