19 citations · 21 across the 11 of their papers we have counts for
17 papers
Disjoint Compatibility via Graph Classes
Oswin Aichholzer, Julia Obmann, Pavel Paták +3
Two plane drawings of graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. Let be a convex point set…
Blocking Delaunay Triangulations from the Exterior
Oswin Aichholzer, Thomas Hackl, Maarten Löffler +4
Given two distinct point sets and in the plane, we say that \emph{blocks} if no two points of are adjacent in any Delaunay triangulation of . Aichholze…
No Selection Lemma for Empty Triangles
Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Daniel Perz +1
Let be a set of points in general position in the plane. The Second Selection Lemma states that for any family of triangles spanned by , there exists a point of…
Coloring circle arrangements: New -chromatic planar graphs
Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher +3
Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement graphs of simple great-circle arrangements have chromatic number at most . Motivated by this conjecture, we…
Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs
Oswin Aichholzer, Alfredo García, Javier Tejel +2
Simple drawings are drawings of graphs in which the edges are Jordan arcs and each pair of edges share at most one point (a proper crossing or a common endpoint). We introduce a sp…
Crossing-Optimal Extension of Simple Drawings
Robert Ganian, Thekla Hamm, Fabian Klute +2
In extension problems of partial graph drawings one is given an incomplete drawing of an input graph and is asked to complete the drawing while maintaining certain properties.…