Cubic Augmentation of Planar Graphs. - Tanja Hartmann; Jonathan Rollin; Ignaz Rutter (ISAAC, 2012)

Regular Augmentation of Planar Graphs. - Tanja Hartmann; Jonathan Rollin; Ignaz Rutter (Algorithmica, 2015)

Brooks type results for conflict-free colorings and {a, b}-factors in graphs. - Maria Axenovich; Jonathan Rollin (Discret. Math., 2015)

Playing weighted Tron on trees. - Daniel Hoske; Jonathan Rollin; Torsten Ueckerdt; Stefan Walzer (Discret. Math., 2015)

The chromatic number of ordered graphs with constrained conflict graphs. - Maria Axenovich; Jonathan Rollin; Torsten Ueckerdt (Australas. J Comb., 2017)

Conditions on Ramsey Nonequivalence. - Maria Axenovich; Jonathan Rollin; Torsten Ueckerdt (J. Graph Theory, 2017)

Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs. - Maria Axenovich; Jonathan Rollin; Torsten Ueckerdt (Comb., 2018)

The k-strong induced arboricity of a graph. - Maria Axenovich; Daniel Gonçalves 001; Jonathan Rollin; Torsten Ueckerdt (Eur. J. Comb., 2018)

Recognizing Planar Laman Graphs. - Jonathan Rollin; Lena Schlipf; André Schulz 001 (ESA, 2019)

Induced and weak induced arboricities. - Maria Axenovich; Philip Dörr; Jonathan Rollin; Torsten Ueckerdt (Discret. Math., 2019)

Augmenting Geometric Graphs with Matchings. - Alexander Pilz; Jonathan Rollin; Lena Schlipf; André Schulz 001 (GD, 2020)

Edge-Minimum Saturated k-Planar Drawings. - Steven Chaplick; Jonathan Rollin; Torsten Ueckerdt (CoRR, 2020)

Minimal ordered Ramsey graphs. - Jonathan Rollin (Discret. Math., 2020)

Regular colorings in regular graphs. - Anton Bernshteyn; Omid Khormali; Ryan R. Martin; Jonathan Rollin; Danny Rorabaugh; Songling Shan; Andrew J. Uzzell (Discuss. Math. Graph Theory, 2020)

The interval number of a planar graph is at most three. - Guillaume Guégan; Kolja Knauer; Jonathan Rollin; Torsten Ueckerdt (J. Comb. Theory B, 2021)

On the Geometric Thickness of 2-Degenerate Graphs. - Rahul Jain 015; Marco Ricci 002; Jonathan Rollin; André Schulz 001 (SoCG, 2023)

On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs. - Benedikt Künzel; Jonathan Rollin (WG, 2024)

Edge-minimum saturated k-planar drawings. - Steven Chaplick; Fabian Klute; Irene Parada; Jonathan Rollin; Torsten Ueckerdt (J. Graph Theory, 2024)

Ramsey Equivalence for Asymmetric Pairs of Graphs. - Simona Boyadzhiyska; Dennis Clemens; Pranshu Gupta; Jonathan Rollin (SIAM J. Discret. Math., 2024)

On plane cycles in geometric multipartite graphs. - Marco Ricci 002; Jonathan Rollin; André Schulz 001; Alexandra Weinberger (CoRR, 2025)