8 citations · 10 across the 8 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.CG2018
Extending the centerpoint theorem to multiple points
Alexander Pilz, Patrick Schnider
The centerpoint theorem is a well-known and widely used result in discrete geometry. It states that for any point set of points in , there is a point , not…
cs.CG2018
The Partition Spanning Forest Problem
Philipp Kindermann, Boris Klemz, Ignaz Rutter +2
Given a set of colored points in the plane, we ask if there exists a crossing-free straight-line drawing of a spanning forest, such that every tree in the forest contains exactly t…
cs.DM2018
Even flying cops should think ahead
Anders Martinsson, Florian Meier, Patrick Schnider +1
We study the entanglement game, which is a version of cops and robbers, on sparse graphs. While the minimum degree of a graph G is a lower bound for the number of cops needed to ca…