A central problem in parameterized algorithms is to obtain algorithms with running time
f(k)⋅n^O(1) such that f is as slow growing a function of the parameter k as possible. In …

A central problem in parameterized algorithms is to obtain algorithms with running time f (k)·
n O (1) such that f is as slow growing function of the parameter k as possible. In particular …

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

We study the General Position Subset Selection problem: Given a set of points in the plane,
find a maximum-cardinality subset of points in general position. We prove that General …

The input to the NP-hard point line cover problem (PLC) consists of a set P of n points on the
plane and a positive integer k; the question is whether there exists a set of at most k lines …

Fixed-parameter algorithms and kernelization are two powerful methods to solve NP-hard
problems. Yet so far those algorithms have been largely restricted to static inputs. In this …

Parameterized Algorithms and Complexity is a natural way to cope with problems that are
considered intractable according to the classical P versus NP dichotomy. In practice, large …

We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid
certain sub-structures. In particular, we characterize the classical and parameterized …

We consider the minimum line covering problem: given a set S of n points in the plane, we
want to find the smallest number l of straight lines needed to cover all n points in S. We show …

The availability of big data sets in research, industry and society in general has opened up
many possibilities of how to use this data. In many applications, however, it is not the data …