Institute of Theoretical Informatics, Algorithmics

Publications

Journal articles

  1. The r-dynamic chromatic number is bounded in the strong 2-coloring number.
    In: Discrete Mathematics, 2026.
    Joint work with Torsten Ueckerdt.
    [ html | pdf ]

Conference articles

  1. Crossing Number of Simple 3-Plane Drawings.
    In: Proceedings of the 33th International Symposium on Graph Drawing and Network Visualization (GD 2025), 2025.
    Joint work with Michael Hoffmann, Ignaz Rutter and Torsten Ueckerdt.
    [ html | pdf ]
  2. Strong Odd Coloring in Minor-Closed Classes.
    In: Proceedings of the 13th European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2025), 2025.
    Joint work with Fabian Klute Kolja Knauer Irene Parada Juan Pablo Peña and Torsten Ueckerdt
    [ html | pdf ]
  3. Saturated Drawings of Geometric Thickness k.
    In: Proceedings of the 41st European Workshop on Computational Geometry (EuroCG 2025), 2025.
    Joint work with Patricia Bachmann, Anna Brötzner, Philipp Kindermann, Matthias Pfretzschner and Soeren Terziadis.
    [ html | pdf ]
  4. Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs.
    In: Proceedings of the 40th European Workshop on Computational Geometry (EuroCG 2024), 2024.
    Joint work with Paul Jungeblut and Torsten Ueckerdt.
    [ html | pdf ]
  5. Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs.
    In: Proceedings of the 30th Annual European Symposium on Algorithms (ESA 2022), volume 244 of Leibniz International Proceedings in Informatics, pages 62:1–62:15, 2022.
    Joint work with Paul Jungeblut and Torsten Ueckerdt.
    [ html | pdf ]

Master's Thesis

  1. Dimension and Linear Layouts of Posets.
    Master's thesis, May 2023.
    Advisor: Torsten Ueckerdt.
    [ pdf ]
  2. P_n-free colorings of planar graphs.
    Bachelor's thesis, September 2020.
    Advisor: Torsten Ueckerdt.
    [ pdf ]