Parameterization and approximation are two popular ways of coping with NP-hard
problems. More recently, the two have also been combined to derive many interesting …

In this paper we propose a new framework for analyzing the performance of preprocessing
algorithms. Our framework builds on the notion of kernelization from parameterized …

We address the max min vertex cover problem, which is the maximization version of the well
studied min independent dominating set problem, known to be NP-hard and highly …

The area of parameterized approximation seeks to combine approximation and
parameterized algorithms to obtain, eg,(1+ eps)-approximations in f (k, eps) n^{O (1)} time …

The parameterized complexity of problems is often studied with respect to the size of their
optimal solutions. However, for a maximization problem, the size of the optimal solution can …

We motivate and describe a new parameterized approximation paradigm which studies the
interaction between approximation ratio and running time for any parametrization of a given …

An edge dominating set in a graph G=(V, E) is a subset S of edges such that each edge in
E− S is adjacent to at least one edge in S. The edge dominating set problem, to find an edge …

In this paper we focus on problems inapproximable in polynomial time and explore how
quickly their approximability improves as the allowed running time is gradually increased …

Parameterised approximation is a relatively new but growing field of interest. It merges two
ways of dealing with NP-hard optimisation problems, namely polynomial approximation and …

The composition technique is a popular method for excluding polynomial-size problem
kernels for NP-hard parameterized problems. We present a new technique exploiting …