Jonathan Rollin

Orcid: 0000-0002-6769-7098

According to our database1, Jonathan Rollin authored at least 19 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Ramsey Equivalence for Asymmetric Pairs of Graphs.
SIAM J. Discret. Math., March, 2024

2023
On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs.
CoRR, 2023

On the Geometric Thickness of 2-Degenerate Graphs.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2021
The interval number of a planar graph is at most three.
J. Comb. Theory B, 2021

Edge-Minimum Saturated k-Planar Drawings.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020
Regular colorings in regular graphs.
Discuss. Math. Graph Theory, 2020

Minimal ordered Ramsey graphs.
Discret. Math., 2020

Edge-Minimum Saturated k-Planar Drawings.
CoRR, 2020

Augmenting Geometric Graphs with Matchings.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019
Induced and weak induced arboricities.
Discret. Math., 2019

Recognizing Planar Laman Graphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
The k-strong induced arboricity of a graph.
Eur. J. Comb., 2018

Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs.
Comb., 2018

2017
Conditions on Ramsey Nonequivalence.
J. Graph Theory, 2017

The chromatic number of ordered graphs with constrained conflict graphs.
Australas. J Comb., 2017

2015
Playing weighted Tron on trees.
Discret. Math., 2015

Brooks type results for conflict-free colorings and {a, b}-factors in graphs.
Discret. Math., 2015

Regular Augmentation of Planar Graphs.
Algorithmica, 2015

2012
Cubic Augmentation of Planar Graphs.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012


  Loading...