182 citations · 549 across the 43 of their papers we have counts for
3 papers · 2 filters
Small grid embeddings of 3-polytopes
Ares Ribó Mor, Günter Rote, André Schulz
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by $O(2^{7.55n})=O(18…
Fixed-parameter tractability and lower bounds for stabbing problems
Panos Giannopoulos, Christian Knauer, Gunter Rote +1
We study the following general stabbing problem from a parameterized complexity point of view: Given a set of translates of an object in $\Rd$, find a set of l…
The parameterized complexity of some geometric problems in unbounded dimension
Panos Giannopoulos, Christian Knauer, Gunter Rote +1
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension : i) Given points in $\Rd$, compute their minimum enclosi…