Dr. Jonathan Rollin

Foto: FernUniversität in Hagen/Hardy Welsch

E-Mail: jonathan.rollin

Telefon: +49 2331 987-4784

Raum: Informatikzentrum, 3 H 07

:

English version: follow this link

Lebenslauf

Forschungsschwerpunkte

• Graphentheorie, Kombinatorik und diskrete Geometrie:
  Zeichnungen, Struktur und Algorithmen
• Färbungen und Zerlegungen von Graphen:
  Färbungszahlen unter lokalen Einschränkungen, Zerlegungen in induzierte Wälder, extremale Fragestellungen für jegliche Art von Färbung oder Zerlegung
• Ramsey Theorie:
  bezüglich Ramsey Eigenschaften äquivalente Graphen, dünne Ramsey Graphen, Ramsey Theorie für geordnete Graphen

Publikationen

Artikel in Zeitschriften

• Steven Chaplick; Fabian Klute; Irene Parada; Jonathan Rollin; Torsten Ueckerdt: Edge-minimum saturated k-planar drawings, in Journal of Graph Theory, Vol. 106(4), pp. 741-762, 2024
• Simona Boyadzhiyska; Dennis Clemens; Pranshu Gupta; Jonathan Rollin: Ramsey equivalence for asymmetric pairs of graphs, in to appear in SIAM Journal of Discrete Mathematics
• Guillaume Guégan; Kolja Knauer; Jonathan Rollin; Torsten Ueckerdt: The interval number of a planar graph is at most three, in Journal of Combinatorial Theory, Series B, Vol. 146, pp. 61-67, 2021
• Jonathan Rollin: Minimal Ordered Ramsey Graphs, in Discrete Mathematics, Vol. 343, No. 10, pp. tba, 2020
• Maria Axenovich; Philip Doerr; Jonathan Rollin; Torsten Ueckerdt: Induced and weak-induced arboricities, in Discrete Mathematics, Vol. 342, No. 2, pp. 511–519, 2019
• Anton Bernshteyn; Omid Khormali; Ryan R. Martin; Jonathan Rollin; Danny Rorabaugh; Songling Shan; Andrew J. Uzzell: Regular colorings and factors of regular graphs, in Discussiones Mathematicae Graph Theory, Vol. 40, No. 3, pp. 795-806, 2020
• Maria Axenovich; Daniel Goncalves; Jonathan Rollin; Torsten Ueckerdt: The k-strong induced arboricity of a graph, in European Journal of Combinatorics, Vol. 67, pp. 1–20, 2018
• Maria Axenovich; Jonathan Rollin; Torsten Ueckerdt: Chromatic number of ordered graphs with forbidden ordered subgraphs, in Combinatorica, Vol. 38(5), pp 1021–1043, 2018
• Maria Axenovich; Jonathan Rollin; Torsten Ueckerdt: Conditions on Ramsey non-equivalence, in Journal of Graph Theory, Vol. 86, No. 2, pp. 159–192, 2017
• Maria Axenovich; Jonathan Rollin; Torsten Ueckerdt: The chromatic number of ordered graphs with constrained conflict graphs, in Australasian Journal of Combinatorics, Vol. 69, pp. 74–104, 2017
• Maria Axenovich; Jonathan Rollin: Brooks type results for conflict-free colorings and {a, b}-factors in graphs, in Discrete Mathematics, Vol. 338, No. 12, pp. 2295-2301, 2015
• Daniel Hoske; Jonathan Rollin; Torsten Ueckerdt; Stefan Walzer: Playing weighted Tron on trees, in Discrete Mathematics, Vol. 338, No. 12, pp. 2341–2347, 2015
• Tanja Hartmann; Jonathan Rollin; Ignaz Rutter: Regular augmentation of planar graphs, in Algorithmica, Vol. 73, No. 2, pp. 1–65, 2015

Konferenzbandbeiträge

• Benedikt Künzel; Jonathan Rollin: On the complexity of simultaneous geometric embedding for edge-disjoint graphs, in Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024 (to appear)
• Rahul Jain; Marco Ricci; Jonathan Rollin; André Schulz: On the Geometric Thickness of 2-Degenerate Graphs, in 39th International Symposium on Computational Geometry, SoCG 2023
• Steven Chaplick; Fabian Klute; Irene Parada; Jonathan Rollin; Torsten Ueckerdt: Edge-Minimum Saturated k-Planar Drawings, in Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021), Tübingen
• Alexander Pilz; Jonathan Rollin; Lena Schlipf; André Schulz: Augmenting Geometric Graphs with Matchings, in Graph Drawing and Network Visualization, 28th International Symposium, GD 2020, Vancouver, BC, Canada, pp. 490-504, September 16–18, 2020
• Jonathan Rollin; Lena Schlipf; André Schulz: Recognizing Planar Laman Graphs, in Proceedings of the 27th Annual European Symposium on Algorithms (ESA'19), Seiten 79:1--79:12
• Tanja Hartmann; Jonathan Rollin; Ignaz Rutter: Cubic augmentation of planar graphs, in Proceedings of the International Symposium on Algorithms and Computation (ISAAC 2012), pp. 402–412

Workshopbeiträge

• Alexander Pilz; Jonathan Rollin; Lena Schlipf; André Schulz: Augmenting Polygons with Matchings, in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG'20)
• Jonathan Rollin; Lena Schlipf; André Schulz: Recognizing Planar Laman Graphs, in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG’19)

Dissertationen

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

Arbeitspapiere

• Laurin Benz; Jonathan Rollin: Induced arboricity: Regular graphs and NP-completeness, in eingereicht