1 citations · 1 across the 9 of their papers we have counts for
18 papers
On 2-Layer k-Matching-Planar Graphs
Saeed Odak, Jonathan Rollin, Torben Scheele
A graph is -matching-planar if it admits a drawing in the plane such that, for every edge , the edges crossing contain no matching of size greater than . The class of…
On plane cycles in geometric multipartite graphs
Marco Ricci, Jonathan Rollin, André Schulz +1
A geometric graph is a drawing of a graph in the plane where the vertices are drawn as points in general position and the edges as straight-line segments connecting their endpoints…
On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs
Benedikt Künzel, Jonathan Rollin
Simultaneous Geometric Embedding (SGE) asks whether, for a given collection of graphs on the same vertex set V, there is an embedding of V in the plane that admits a crossing-free…
On the geometric thickness of 2-degenerate graphs
Rahul Jain, Marco Ricci, Jonathan Rollin +1
A graph is 2-degenerate if every subgraph contains a vertex of degree at most 2. We show that every 2-degenerate graph can be drawn with straight lines such that the drawing decomp…
Ramsey equivalence for asymmetric pairs of graphs
Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta +1
A graph is Ramsey for a pair of graphs if any red/blue-coloring of the edges of yields a copy of with all edges colored red or a copy of with all edges colo…
Edge-Minimum Saturated k-Planar Drawings
Steven Chaplick, Fabian Klute, Irene Parada +2
For a class of drawings of loopless (multi-)graphs in the plane, a drawing is \emph{saturated} when the addition of any edge to results in $D'…