6 citations · 10 across the 3 of their papers we have counts for
3 papers · 1 filter
Finding a largest empty convex subset in space is W[1]-hard
Panos Giannopoulos, Christian Knauer
We consider the following problem: Given a point set in space find a largest subset that is in convex position and whose convex hull is empty. We show that the (decision version of…
Minimum cell connection and separation in line segment arrangements
Helmut Alt, Sergio Cabello, Panos Giannopoulos +1
We study the complexity of the following cell connection and separation problems in segment arrangements. Given a set of straight-line segments in the plane and two points and…
Hardness of discrepancy computation and epsilon-net verification in high dimension
Panos Giannopoulos, Christian Knauer, Magnus Wahlström +1
Discrepancy measures how uniformly distributed a point set is with respect to a given set of ranges. There are two notions of discrepancy, namely continuous discrepancy and combina…