Dr. Jonathan Rollin

Jonathan Rollin Photo: private

Email: jonathan.rollin

Phone: +49 2331 987-4784

Fax: +49 2331 987-339

Room: Informatikzentrum, 3 H 07

Short CV

since April 2018 Postdoctoral researcher, LG Theoretical Computer Science, FernUniversität in Hagen
May 2017 PhD in Mathematics, supervisor Maria Axenovich, Karlsruhe Institute for Technology
Oct 2013 -- March 2018 Research assistant, AG Discrete Mathematics, Karlsruhe Institute for Technology
Oct 2013 Diploma in Mathematics, Karlsruhe Institute for Technology
Oct 2013 Diploma in Computer Science, Karlsruhe Institute for Technology

Research Focus

  • Planar and Beyond Planar Graphs, Geometric Graphs:
    drawings, structure, algorithms
  • Graph Colorings and Decompositions:
    chromatic number under local constraints, induced arboricity, extremal questions for all sorts of colorings or decompostions
  • Ramsey Theory:
    Ramsey equivalence, sparse Ramsey graphs, Ramsey theory for ordered graphs


  • On the geometric thickness of 2-degenerate graphs
    with Rahul Jain; Marco Ricci; André Schulz, SoCG 2023
  • Ramsey equivalence for asymmetric pairs of graphs
    with Simona Boyadzhiyska; Dennis Clemens; Pranshu Gupta, in SIAM Journal on Discrete Mathematics, to appear
  • Edge-minimum saturated k-planar drawings
    with Steven Chaplick; Fabian Klute; Irene Parada; Torsten Ueckerdt, Graph Drawing 2021
  • Induced arboricity: Regular graphs and NP-completeness
    with Laurin Benz, submitted
  • Augmenting polygons with matchings
    with Alexander Pilz; Lena Schlipf; André Schulz, Graph Drawing 2020
  • Recognizing planar Laman graphs
    with Lena Schlipf; André Schulz, ESA 2019
  • The interval number of a planar graph is at most three
    with Guillaume Guégan; Kolja Knauer; Torsten Ueckerdt, in Journal of Combinatorial Theory, Series B, 2021
  • Minimal ordered Ramsey graphs
    in Discrete Mathematics, 2020
  • Regular colorings and factors of regular graphs
    with Anton Bernshteyn; Omid Khormali; Ryan R. Martin; Danny Rorabaugh; Songling Shan; Andrew J. Uzzell, in Discussiones Mathematicae Graph Theory, 2020
  • Induced and weak-induced arboricities
    with Maria Axenovich; Philip Doerr; Torsten Ueckerdt, in Discrete Mathematics, 2019
  • The k-strong induced arboricity of a graph
    with Maria Axenovich; Daniel Goncalves; Torsten Ueckerdt, in European Journal of Combinatorics, 2018
  • The chromatic number of ordered graphs with constrained conflict graphs
    with Maria Axenovich; Torsten Ueckerdt, in Australasian Journal of Combinatorics, 2017
  • Chromatic number of ordered graphs with forbidden ordered subgraphs
    with Maria Axenovich; Torsten Ueckerdt, in Combinatorica 2017
  • Conditions on Ramsey non-equivalence
    with Maria Axenovich; Torsten Ueckerdt, in Journal of Graph Theory, 2017
  • Brooks type results for conflict-free colorings and {a, b}-factors in graphs
    with Maria Axenovich, in Discrete Mathematics, 2015
  • Playing weighted Tron on trees
    with Daniel Hoske; Torsten Ueckerdt; Stefan Walzer, in Discrete Mathematics, 2015
  • Regular augmentation of planar graphs
    with Tanja Hartmann; Ignaz Rutter, in Algorithmica, 2015



Christoph Doppelbauer | 10.05.2024