Dr. Jonathan Rollin

Photo: FernUniversität in Hagen/Hardy Welsch

Email: jonathan.rollin

Phone: +49 2331 987-4784

Room: Informatikzentrum, 3 H 07

Short CV

Research Focus

• Graph Theory, Combinatorics, and discrete Geometry:
  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

Publications

• On alternating plane cycles in colored point sets
  with Marco Ricci; André Schulz; Alexandra Weinberger, submitted, 2024.
• On the complexity of simultaneous geometric embedding for edge-disjoint graphs
  with Benedikt Künzel. WG 2024, to appear.
• Edge-minimum saturated k-planar drawings
  with Steven Chaplick; Fabian Klute; Irene Parada; Torsten Ueckerdt, in Journal of Graph Theory, 2024
• Ramsey equivalence for asymmetric pairs of graphs
  with Simona Boyadzhiyska; Dennis Clemens; Pranshu Gupta, in SIAM Journal on Discrete Mathematics 2024
• On the geometric thickness of 2-degenerate graphs
  with Rahul Jain; Marco Ricci; André Schulz, SoCG 2023
• Induced arboricity: Regular graphs and NP-completeness
  with Laurin Benz, preprint, 2022
• Edge-minimum saturated k-planar drawings
  with Steven Chaplick; Fabian Klute; Irene Parada; Torsten Ueckerdt, Graph Drawing 2021
• 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
• Augmenting polygons with matchings
  with Alexander Pilz; Lena Schlipf; André Schulz, Graph Drawing 2020
• 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
• Recognizing planar Laman graphs
  with Lena Schlipf; André Schulz, ESA 2019
• 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
• Regular augmentation of planar graphs
  with Tanja Hartmann; Ignaz Rutter, in Algorithmica, 2015
• Playing weighted Tron on trees
  with Daniel Hoske; Torsten Ueckerdt; Stefan Walzer, in Discrete Mathematics, 2015
• Cubic augmentation of planar graphs
  with Tanja Hartmann; Ignaz Rutter, ISAAC 2012

Dissertation

• Extremal and Ramsey type questions for graphs and ordered graphs
  Karlsruher Institut für Technologie (KIT), 2017