Jonathan Rollin

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 23

Top Topics

Multivalued Dependencies

Graph Theoretical

Top Venues

Publications

Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta, Jonathan Rollin
Ramsey Equivalence for Asymmetric Pairs of Graphs. SIAM J. Discret. Math. 38 (1) (2024)
Benedikt Künzel, Jonathan Rollin
On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs. CoRR (2023)
Rahul Jain, Marco Ricci, Jonathan Rollin, André Schulz
On the Geometric Thickness of 2-Degenerate Graphs. SoCG (2023)
Rahul Jain, Marco Ricci, Jonathan Rollin, André Schulz
On the geometric thickness of 2-degenerate graphs. CoRR (2023)
Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt
Edge-Minimum Saturated k-Planar Drawings. Graph Drawing (2021)
Guillaume Guégan, Kolja Knauer, Jonathan Rollin, Torsten Ueckerdt
The interval number of a planar graph is at most three. J. Comb. Theory, Ser. B 146 (2021)
Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz
Augmenting Geometric Graphs with Matchings. CoRR (2020)
Jonathan Rollin
Minimal ordered Ramsey graphs. Discret. Math. 343 (10) (2020)
Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz
Augmenting Geometric Graphs with Matchings. Graph Drawing (2020)
Anton Bernshteyn, Omid Khormali, Ryan R. Martin, Jonathan Rollin, Danny Rorabaugh, Songling Shan, Andrew J. Uzzell
Regular colorings in regular graphs. Discuss. Math. Graph Theory 40 (3) (2020)
Steven Chaplick, Jonathan Rollin, Torsten Ueckerdt
Edge-Minimum Saturated k-Planar Drawings. CoRR (2020)
Jonathan Rollin, Lena Schlipf, André Schulz
Recognizing Planar Laman Graphs. ESA (2019)
Maria Axenovich, Philip Dörr, Jonathan Rollin, Torsten Ueckerdt
Induced and weak induced arboricities. Discret. Math. 342 (2) (2019)
Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt
The k-strong induced arboricity of a graph. Eur. J. Comb. 67 (2018)
Guillaume Guégan, Kolja Knauer, Jonathan Rollin, Torsten Ueckerdt
The interval number of a planar graph is at most three. CoRR (2018)
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs. Comb. 38 (5) (2018)
Maria Axenovich, Philip Dörr, Jonathan Rollin, Torsten Ueckerdt
Induced and Weak Induced Arboricities. CoRR (2018)
Jonathan Rollin
Minimal Ordered Ramsey Graphs. CoRR (2017)
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
The chromatic number of ordered graphs with constrained conflict graphs. Australas. J Comb. 69 (2017)
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
Conditions on Ramsey Nonequivalence. J. Graph Theory 86 (2) (2017)
Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt
The k-strong induced arboricity of a graph. CoRR (2016)
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs. CoRR (2016)
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
Chromatic number of ordered graphs with forbidden ordered subgraphs. CoRR (2016)
Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt, Stefan Walzer
Playing weighted Tron on trees. Discret. Math. 338 (12) (2015)
Maria Axenovich, Jonathan Rollin
Brooks type results for conflict-free colorings and {a, b}-factors in graphs. Discret. Math. 338 (12) (2015)
Tanja Hartmann, Jonathan Rollin, Ignaz Rutter
Regular Augmentation of Planar Graphs. Algorithmica 73 (2) (2015)
Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt, Stefan Walzer
Playing weighted Tron on Trees. CoRR (2014)
Tanja Hartmann, Jonathan Rollin, Ignaz Rutter
Cubic Augmentation of Planar Graphs CoRR (2012)
Tanja Hartmann, Jonathan Rollin, Ignaz Rutter
Cubic Augmentation of Planar Graphs. ISAAC (2012)