Dr. Jonathan Rollin

Deutsch

Foto: Hardy Welsch

Kontakt

E-Mail: jonathan.rollin

Telefon: +49 2331 987-4784

Raum: H307, Gebäude 3 (Informatikzentrum)

• 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

  • Graph Theory, Combinatorics, and computational 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

  Preprints

  • On plane cycles in geometric multipartite graphs
    with Marco Ricci; André Schulz; Alexandra Weinberger, submitted, extended abstract accpeted to EuroCG 2025
  • On spectrum from convexity to connected r-gather
    with Thomas C. van Dijk; Wolf Kißler; Lukas Plätz; Marena Richter, preprint, extended abstract accpeted to EuroCG 2025
  • Induced arboricity: Regular graphs and NP-completeness
    with Laurin Benz, preprint, 2022

  Articles in Journals (with Peer-Review)

  • On the geometric thickness of 2-degenerate graphs
    with Rahul Jain, Marco Ricci; A. Schulz; in Journal of Computational Geometry, 2024
  • 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
  • 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
  • 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

  Articles in Conference Proceedings (with Peer-Review)

  • On the complexity of simultaneous geometric embedding for edge-disjoint graphs
    with Benedikt Künzel, WG 2024
  • On the geometric thickness of 2-degenerate graphs
    with Rahul Jain; Marco Ricci; André Schulz, SoCG 2023
  • Edge-minimum saturated k-planar drawings
    with Steven Chaplick; Fabian Klute; Irene Parada; Torsten Ueckerdt, Graph Drawing 2021
  • 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
  • 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