1 citations · 3 across the 10 of their papers we have counts for
7 papers · 1 filter
Garment numbers of bi-colored point sets in the plane
Oswin Aichholzer, Helena Bergold, Simon D. Fink +3
We consider colored variants of a class of geometric-combinatorial questions on -gons and empty -gons that have been started around 1935 by Erdős and Szekeres. In our setting…
Investigating Simple Drawings of using SAT
Helena Bergold, Manfred Scheucher
We present a SAT framework which allows to investigate properties of simple drawings of the complete graph using the power of AI. In contrast to classic imperative programmin…
On Triangular Separation of Bichromatic Point Sets
Helena Bergold, Arun Kumar Das, Robert Lauff +3
We address the problem of computing the minimum number of triangles to separate a set of blue points from a set of red points in . A set of triangles is a \emph{separ…
Holes in Convex and Simple Drawings
Helena Bergold, Joachim Orthaber, Manfred Scheucher +1
Gons and holes in point sets have been extensively studied in the literature. For simple drawings of the complete graph a generalization of the Erdős--Szekeres theorem is known and…
Plane Hamiltonian Cycles in Convex Drawings
Helena Bergold, Stefan Felsner, Meghana M. Reddy +2
A conjecture by Rafla from 1988 asserts that every simple drawing of the complete graph admits a plane Hamiltonian cycle. It turned out that already the existence of much sim…
Using SAT to study plane Hamiltonian substructures in simple drawings
Helena Bergold, Stefan Felsner, Meghana M. Reddy +1
In 1988 Rafla conjectured that every simple drawing of a complete graph contains a plane, i.e., non-crossing, Hamiltonian cycle. The conjecture is far from being resolved. Th…