Home | deutsch | Impressum | Sitemap | Intranet | KIT
Research Group on Discrete Mathematics

Secretariat
Kollegiengebäude Mathematik (20.30)
Room 1.044

Address
Institut für Algebra und Geometrie
Englerstr. 2
D-76131 Karlsruhe

Office hours:
Tu, Th, F 8:30-12:00

Tel.: +49 721 608 47412

Fax.: +49 721 608 46968

Photo of Torsten Ueckerdt Torsten Ueckerdt

Office hour for students: Mondays 2pm-3pm
Room: 1.045 Kollegiengebäude Mathematik (20.30)
Tel.: +49 721 608 42074
Email: torsten.ueckerdt@kit.edu

I am interested in discrete mathematics and theoretical computer science. In particular I have been working in graph theory, game theory, combinatorics, and computational geometry. I consider mostly combinatorial problems within a geometric setting, such as planar graphs, intersections models of graph, or point sets in the plane.

I was born in Berlin, where I also did my studies. I did my Ph.D. with my advisor Stefan Felsner at the Department of Mathematics at the Technische Universität Berlin. Afterwards I moved into the group of Jan Kratochvil in the Department of Applied Mathematics at the Charles University in Prague. Since September 2012 I am working in the Discrete Mathematics group at KIT.





Semester Titel Typ
Winter Semester 2016/17
Seminar
Summer Semester 2016
Seminar
Proseminar
Winter Semester 2015/16
Seminar
Seminar
Proseminar
Summer Semester 2015
Seminar
Winter Semester 2014/15 Seminar
Seminar
Summer Semester 2014 Seminar
Seminar
Winter Semester 2013/14
Seminar
Summer Semester 2013
Seminar
Winter Semester 2012/13 Seminar
Seminar


Publications


Accepted Papers

31. "Convex-Arc Drawings of Pseudolines" {arxiv}
D. Eppstein, M. van Garderen, B. Speckmann, and Torsten Ueckerdt.
accepted at Ars Mathematica Contemporanea.


Published Papers

30. "A Note on Concurrent Graph Sharing Games" {arxiv}
S. Chaplick, P. Micek, T. Ueckerdt, and Veit Wiechert.
Integers - Electronic Journal of Combinatorial Number Theory, vol. 16 (2016), #G1. {url}

29. "Density of Range Capturing Hypergraphs" {arxiv}
M. Axenovich, and T. Ueckerdt.
Journal of Computational Geometry 7, no. 1 (2016), pp. 1-21. {url}

28. "Three Ways to Cover a Graph" {arxiv}
K. Knauer, and T. Ueckerdt.
Discrete Mathematics 339 (2016), pp. 745-758. {doi}

27. "Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem" {arxiv}
J. Klawitter, M. Nöllenburg and T. Ueckerdt.
In Proceedings of 23rd International Symposium on Graph Drawing & Network Visualization (GD 2015), pp. 231-244. {doi}

26. "Pixel and Voxel Representations of Graphs" {arxiv}
J. Md. Alam, T. Bläsius, I. Rutter, T. Ueckerdt, and A. Wolff.
In Proceedings of 23rd International Symposium on Graph Drawing & Network Visualization (GD 2015), pp. 472-486. {doi}

25. "On-line Coloring Between Two Lines" {arxiv}
S. Felsner, P. Micek, and T. Ueckerdt.
In Proceedings of 31st Symposium on Computational Geometry (SoCG 2015), pp. 630-641. {doi}

24. "Contact Representations of Graphs in 3D" {arxiv}
J. Md. Alam, W. Evans, S. G. Kobourov, S. Pupyrev, J. Toeniskoetter, and T. Ueckerdt.
In Proceedings of 14th International Symposium on Algorithms and Data Structures (WADS 2015), pp. 14-27. {doi}

23. "Contact Graphs of Circular Arcs" {arxiv}
J. Md. Alam, D. Eppstein, M. Kaufmann, S. G. Kobourov, S. Pupyrev, A. Schulz, and T. Ueckerdt.
In Proceedings of 14th International Symposium on Algorithms and Data Structures (WADS 2015), pp. 1-13. {doi}

22. "Playing Weighted Tron on Trees" {arxiv}
D. Hoske, J. Rollin, T. Ueckerdt, and S. Walzer.
Discrete Mathematics 338 (2015), pp. 2341–2347. {doi}

21. "Spectrum of Mixed Bi-Uniform Hypergraphs" {arxiv}
M. Axenovich, E. Cherubini, and T. Ueckerdt.
Graphs and Combinatorics 32(2) (2016), pp. 453-461. {doi}

20. "Intersection Graphs of L-Shapes and Segments in the Plane" {arxiv}
S. Felsner, K. Knauer, G. B. Mertzios, and T. Ueckerdt.
In Proceedings of 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), pp. 299-310. {doi}

19. "Twins in Graphs" {arxiv}
M. Axenovich, R. Martin, and T. Ueckerdt.
European Journal of Combinatorics 39 (2014), pp. 188-197. {doi}

18. "Semantic Word Cloud Representations: Hardness and Approximation Algorithms" {arxiv}
L. Barth, S. I. Fabrikant, S. G. Kobourov, A. Lubiw, M. Nöllenburg, Y. Okamoto, S. Pupyrev, C. Squarcella, T. Ueckerdt, and A. Wolff.
In LATIN 2014: Theoretical Informatics (LATIN 2014), pp. 514-525. {doi}

17. "On the Bend-Number of Planar and Outerplanar Graphs" {arxiv}
D. Heldt, K. Knauer, and T. Ueckerdt.
Discrete Applied Mathematics 179 (2014), pp. 109-119. {doi}
Preliminary version:
In Proceedings of 10th Latin American Symposium on Theoretical Informatics (LATIN 2012), pp. 458-469. {doi}

16. "Making Octants Colorful and Related Covering Decomposition Problems" {arxiv}
J. Cardinal, K. Knauer, P. Micek, and T. Ueckerdt.
SIAM Journal on Discrete Mathematics 28, no. 4 (2014), pp. 1948-1959. {doi}
Preliminary version:
In Proceedings of 25th ACM-SIAM Symposium on Discrete Algorithms (SODA 2014). {doi}

15. "Online and Size Anti-Ramsey Numbers" {arxiv}
M. Axenovich, K. Knauer, J. Stumpp, and T. Ueckerdt.
Journal of Combinatorics 5, no. 1 (2014). {doi}

14. "Edge-Intersection Graphs of Grid Paths: the Bend-Number" {arxiv}
D. Heldt, K. Knauer, and T. Ueckerdt.
Discrete Applied Mathematics 167 (2014), pp. 144-162. {doi}

13. "Packing Polyominoes Clumsily"
M. Axenovich, T. Ueckerdt, and S. Walzer.
Computational Geometry 47, no. 1 (2014), pp. 52-60. {doi}

12. "Graphs Admitting d-Realizers: Spanning-Tree-Decompositions and Box-Representations" {pdf}
W. Evans, S. Felsner, S. G. Kobourov, and T. Ueckerdt.
In Proceedings of 30th European Workshop on Computational Geometry (EuroCG 2014).

11. "Combinatorial and Geometric Properties of Planar Laman Graphs" {arxiv}
S. G. Kobourov, T. Ueckerdt and K. Verbeek.
In Proceedings of 24th ACM-SIAM Symposium on Discrete Algorithms (SODA 2013). {doi}

10. "Making Triangles Colorful" {arxiv}
J. Cardinal, K. Knauer, P. Micek, and T. Ueckerdt.
Journal of Computational Geometry 4, no. 1 (2013), pp. 240-246. {url}

9. "Planar Graphs as VPG-Graphs"
S. Chaplick and T. Ueckerdt.
Journal of Graph Algorithms and Applications 14, no. 4 (2013), pp. 475-494. {doi}
Preliminary version:
In Proceedings of 20th International Symposium on Graph Drawing (GD 2012), pp. 174-186. {doi}

8. "Equilateral L-Contact Graphs" {arxiv}
S. Chaplick, S. G. Kobourov, and T. Ueckerdt.
In Graph-Theoretic Concepts in Computer Science -- Proceedings of 39th International Workshop (WG 2013), pp. 139-151. {doi}

7. "Coloring Hypergraphs induced by Dynamic Point Sets and Bottomless Rectangles" {arxiv}
A. Asinowski, J. Cardinal, N. Cohen, S. Collette, T. Hackl, M. Hoffmann, K. Knauer, S. Langerman, M. Lasoń, P. Micek, G. Rote, and T. Ueckerdt.
In Algorithms and Data Structures -- Proceedings of 13th International Symposium (WADS 2013), pp. 73-84. {doi}

6. "Non-Crossing Connectors in the Plane" {arxiv}
J. Kratochvil and T. Ueckerdt.
In Proceedings of 10th annual conference on Theory and Applications of Models of Computation (TAMC 2013), pp. 108-120. {doi}

5. "Convexarc Drawings of Pseudolines" {pdf}
D. Eppstein, M. Van Garderen, B. Speckmann, and T. Ueckerdt.
In Proceedings of 21st International Symposium on Graph Drawing (GD 2013), pp. 522-523.

4. "Computing Cartograms with Optimal Complexity" {arxiv}
J. Md. Alam, T. Biedl, S. Felsner, M. Kaufmann, S. G. Kobourov, and T. Ueckerdt.
Discrete & Computational Geometry 50.3 (2013), pp. 784-810. {doi}
Preliminary version:
In Proceedings of 28th Symposium on Computational Geometry (SoCG 2012), pp. 21-30. {doi}

3. "How to Eat 4/9 of a Pizza" {arxiv}
K. Knauer, P. Micek, and T. Ueckerdt.
Discrete Mathematics 311 (2011), pp. 1635-1645. {doi}

2. "Points with Large Quadrant Depth"
R. Apfelbaum, I. Ben-Dan, S. Felsner, T. Miltzow, R. Pinchasi, T. Ueckerdt, and R. Ziv.
Journal of Computational Geometry, Vol 2 Issue 1 (2011), pp. 128-143. {url}
Preliminary version:
In Proceedings of 27th Symposium on Computational Geometry (SoCG 2010), pp. 358-364. {doi}

1. "Cycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications"
T. Kavitha, Ch. Liebchen, K. Mehlhorn, D. Michail, R. Rizzi, T. Ueckerdt, and K. Zweig.
Computer Science Review 3 (2009), pp. 199-243. {doi}


Unpublished Manuscripts

"Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs" {arxiv}
M. Axenovich, J. Rollin, and T. Ueckerdt. (2016)

"Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths" {arxiv}
M. Axenovich, T. Ueckerdt, and P. Weiner. (2015)

"Conditions on Ramsey Non-Equivalence" {arxiv}
M. Axenovich, J. Rollin, and T. Ueckerdt. (2015)

"The Density of Fan-Planar Graphs" {arxiv}
M. Kaufmann, and T. Ueckerdt. (2014)


PhD Thesis

"Geometric Representations of Graphs with Low Polygonal Complexity" {pdf}.
T. Ueckerdt. (2011)


Last Update: May 2016