Approximation algorithms and parameterized complexity are usually considered to be two
separate ways of dealing with hard algorithmic problems. In this paper, our aim is to …

Research on parameterized algorithmics for NP-hard problems has steadily grown over the
last years. We survey and discuss how parameterized complexity analysis naturally …

This paper surveys parameterized complexity results for hard geometric algorithmic
problems. It includes fixed-parameter tractable problems in graph drawing, geometric …

Given n axis-parallel boxes in a fixed dimension d≥ 3, how efficiently can we compute the
volume of the union? This standard problem in computational geometry, commonly referred …

We are studying d-dimensional geometric problems that have algorithms with 1− 1/d
appearing in the exponent of the running time, for example, in the form of 2n1− 1/d or nk1 …

We study several canonical decision problems arising from some well-known theorems from
combinatorial geometry. Among others, we show that computing the minimum size of …

We study the following general stabbing problem from a parameterized complexity point of
view: Given a set S of n translates of an object in Rd, find a set of k lines with the property …

We present a (combinatorial) algorithm with running time close to O (n^ d) for computing the
minimum directed L_∞ Hausdorff distance between two sets of n points under translations …

In this paper, we consider the problem (denoted as EMDRT) of minimizing the earth mover's
distance between two sets of weighted points A and B in R^ d R d under rigid transformation …

We present an embedding and search reduction which allow us to build the first data
structure for the nearest neighbor search among small point sets with respect to the directed …