Publications

Euclidean Greedy Drawings of Trees.
Discrete and Computational Geometry, 58(3):543–579, 2017.
Joint work with Martin Nöllenburg.

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.
International Journal of Computational Geometry and Applications, 27(1–2):121–158, 2017.
Special issue on selected papers from ISAAC�15.
Joint work with Martin Nöllenburg and Ignaz Rutter.

On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs.
Journal of Computational Geometry, 7(1):47–69, 2016.
Joint work with Martin Nöllenburg and Ignaz Rutter.

Edge-weighted contact representations of planar graphs.
Journal of Graph Algorithms and Applications, 17(4):441–473, 2013.
Special issue of GD 2012.
Joint work with Martin Nöllenburg and Ignaz Rutter.
[ html | pdf ]

Simple Distributed ∆ + 1 Coloring in the SINR Model.
In: Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity, Lecture Notes in Computer Science, pages 149–163. Springer, 2015.
Joint work with Fabian Fuchs.
[ html | pdf ]

Recognizing Weighted Disk Contact Graphs.
In: Proceedings of the 31st European Workshop on Computational Geometry (EuroCG'15), pages 113–116, 2015.
Joint work with Boris Klemz and Martin Nöllenburg.
[ pdf ]

Recognizing Weighted Disk Contact Graphs.
In: Proceedings of the 23rd International Symposium on Graph Drawing (GD'15), Lecture Notes in Computer Science. Springer, 2015.
To appear.
Joint work with Boris Klemz and Martin Nöllenburg.

Generating Random Hyperbolic Graphs in Subquadratic Time.
In: Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC'15), Lecture Notes in Computer Science, pages 467–478. Springer, 2015.
Joint work with Moritz von Looz and Henning Meyerhenke.

GraphMaps: Browsing Large Graphs as Interactive Maps.
In: Proceedings of the 23rd International Symposium on Graph Drawing (GD'15), Lecture Notes in Computer Science. Springer, 2015.
To appear.
Joint work with Lev Nachmanson, Bongshin Lee, Nathalie Henry Riche, Alexander E. Holroyd, and Xiaoji Chen.

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.
In: Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC'15), Lecture Notes in Computer Science, pages 637–649. Springer, 2015.
Joint work with Martin Nöllenburg and Ignaz Rutter.
[ html ]

On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs .
In: Proceedings of the 22nd International Symposium on Graph Drawing (GD'14), volume 8871 of Lecture Notes in Computer Science, pages 476–487. Springer, 2014.
Full version available at http://arxiv.org/abs/1409.0315.
Joint work with Martin Nöllenburg and Ignaz Rutter.
[ html | pdf ]

Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings.
In: Proceedings of the 21st International Symposium on Graph Drawing (GD'13), volume 8242 of Lecture Notes in Computer Science, pages 460–471. Springer, 2013.
Full version available at http://arxiv.org/abs/1308.6778.
Joint work with Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, and Ignaz Rutter.
[ html | pdf ]

Euclidean Greedy Drawings of Trees.
In: Proceedings of the 21st Annual European Symposium on Algorithms (ESA'13), volume 8125 of Lecture Notes in Computer Science, pages 767–778. Springer, 2013.
Full version available at http://arxiv.org/abs/1306.5224.
Joint work with Martin Nöllenburg.
[ html | pdf ]

Edge-weighted Contact Representations of Planar Graphs.
In: Proceedings of the 20th International Symposium on Graph Drawing (GD'12), volume 7704 of Lecture Notes in Computer Science, pages 224–235. Springer, 2013.
Joint work with Martin Nöllenburg and Ignaz Rutter.
[ html | pdf ]

Reflective Shadow Map Clustering for Real-Time Global Illumination.
In: Proceedings of the 33rd Annual Conference of the European Association for Computer Graphics (Eurographics'12), pages 9–12. The Eurographics Association, 2012.
Joint work with Anton Kaplanyan and Carsten Dachsbacher.

Graph Embeddings Motivated by Greedy Routing.
PhD thesis, Karlsruher Institut f�r Technologie (KIT), November 2017.
[ html | pdf ]