30 citations · 208 across the 26 of their papers we have counts for
5 papers · 1 filter
Drawings of Complete Multipartite Graphs Up to Triangle Flips
Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang +5
For a drawing of a labeled graph, the rotation of a vertex or crossing is the cyclic order of its incident edges, represented by the labels of their other endpoints. The extended r…
On Crossing-Families in Planar Point Sets
Oswin Aichholzer, Jan Kynčl, Manfred Scheucher +2
A -crossing family in a point set in general position is a set of segments spanned by points of such that all segments mutually cross. In this short note we pres…
Hanani-Tutte for approximating maps of graphs
Radoslav Fulek, Jan Kynčl
We resolve in the affirmative conjectures of Repovs and A. Skopenkov (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating…
Peeling potatoes near-optimally in near-linear time
Sergio Cabello, Josef Cibulka, Jan Kynčl +2
We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon with vertices. We give a randomized near…
Clustered planarity testing revisited
Radoslav Fulek, Jan Kynčl, Igor Malinović +1
The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every p…