default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan Rollin
Person information
- affiliation: FernUniversität in Hagen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c7]Marco Ricci
, Jonathan Rollin, André Schulz, Alexandra Weinberger:
On Plane Cycles in Geometric Multipartite Graphs. WG 2025: 431-444- [i13]Marco Ricci, Jonathan Rollin, André Schulz, Alexandra Weinberger:
On plane cycles in geometric multipartite graphs. CoRR abs/2506.20421 (2025) - 2024
- [j14]Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt:
Edge-minimum saturated k-planar drawings. J. Graph Theory 106(4): 741-762 (2024) - [j13]Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta, Jonathan Rollin:
Ramsey Equivalence for Asymmetric Pairs of Graphs. SIAM J. Discret. Math. 38(1): 55-74 (2024) - [c6]Benedikt Künzel, Jonathan Rollin:
On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs. WG 2024: 400-414 - 2023
- [j12]Rahul Jain, Marco Ricci, Jonathan Rollin, André Schulz:
On the geometric thickness of 2-degenerate graphs. J. Comput. Geom. 15(2): 94-123 (2023) - [c5]Rahul Jain, Marco Ricci, Jonathan Rollin, André Schulz:
On the Geometric Thickness of 2-Degenerate Graphs. SoCG 2023: 44:1-44:15 - [i12]Rahul Jain, Marco Ricci, Jonathan Rollin, André Schulz:
On the geometric thickness of 2-degenerate graphs. CoRR abs/2302.14721 (2023) - [i11]Benedikt Künzel, Jonathan Rollin:
On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs. CoRR abs/2312.09025 (2023) - 2021
- [j11]Guillaume Guégan, Kolja Knauer, Jonathan Rollin, Torsten Ueckerdt:
The interval number of a planar graph is at most three. J. Comb. Theory B 146: 61-67 (2021) - [c4]Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt:
Edge-Minimum Saturated k-Planar Drawings. GD 2021: 3-17 - 2020
- [j10]Jonathan Rollin:
Minimal ordered Ramsey graphs. Discret. Math. 343(10): 112023 (2020) - [j9]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): 795-806 (2020) - [c3]Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz:
Augmenting Geometric Graphs with Matchings. GD 2020: 490-504 - [i10]Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz:
Augmenting Geometric Graphs with Matchings. CoRR abs/2008.08413 (2020) - [i9]Steven Chaplick, Jonathan Rollin, Torsten Ueckerdt:
Edge-Minimum Saturated k-Planar Drawings. CoRR abs/2012.08631 (2020)
2010 – 2019
- 2019
- [j8]Maria Axenovich, Philip Dörr, Jonathan Rollin, Torsten Ueckerdt:
Induced and weak induced arboricities. Discret. Math. 342(2): 511-519 (2019) - [c2]Jonathan Rollin, Lena Schlipf, André Schulz:
Recognizing Planar Laman Graphs. ESA 2019: 79:1-79:12 - 2018
- [j7]Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs. Comb. 38(5): 1021-1043 (2018) - [j6]Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt:
The k-strong induced arboricity of a graph. Eur. J. Comb. 67: 1-20 (2018) - [i8]Maria Axenovich, Philip Dörr, Jonathan Rollin, Torsten Ueckerdt:
Induced and Weak Induced Arboricities. CoRR abs/1803.02152 (2018) - [i7]Guillaume Guégan, Kolja Knauer, Jonathan Rollin, Torsten Ueckerdt:
The interval number of a planar graph is at most three. CoRR abs/1805.02947 (2018) - 2017
- [j5]Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
The chromatic number of ordered graphs with constrained conflict graphs. Australas. J Comb. 69: 74-104 (2017) - [j4]Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
Conditions on Ramsey Nonequivalence. J. Graph Theory 86(2): 159-192 (2017) - [i6]Jonathan Rollin:
Minimal Ordered Ramsey Graphs. CoRR abs/1712.09034 (2017) - 2016
- [i5]Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
Chromatic number of ordered graphs with forbidden ordered subgraphs. CoRR abs/1603.00312 (2016) - [i4]Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt:
The k-strong induced arboricity of a graph. CoRR abs/1607.07174 (2016) - [i3]Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs. CoRR abs/1610.01111 (2016) - 2015
- [j3]Tanja Hartmann, Jonathan Rollin, Ignaz Rutter:
Regular Augmentation of Planar Graphs. Algorithmica 73(2): 306-370 (2015) - [j2]Maria Axenovich, Jonathan Rollin:
Brooks type results for conflict-free colorings and {a, b}-factors in graphs. Discret. Math. 338(12): 2295-2301 (2015) - [j1]Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt, Stefan Walzer:
Playing weighted Tron on trees. Discret. Math. 338(12): 2341-2347 (2015) - 2014
- [i2]Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt, Stefan Walzer:
Playing weighted Tron on Trees. CoRR abs/1412.4100 (2014) - 2012
- [c1]Tanja Hartmann, Jonathan Rollin, Ignaz Rutter:
Cubic Augmentation of Planar Graphs. ISAAC 2012: 402-412 - [i1]Tanja Hartmann, Jonathan Rollin, Ignaz Rutter:
Cubic Augmentation of Planar Graphs. CoRR abs/1209.3865 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-02-03 23:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
