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 …

We study the parameterized complexity of various classic vertex-deletion problems such as
Odd cycle transversal, Vertex planarization, and Chordal vertex deletion under hybrid …

We investigate for temporal graphs the computational complexity of separating two distinct
vertices s and z by vertex deletion. In a temporal graph, the vertex set is fixed but the edges …

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

A backdoor set is a set of variables of a propositional formula such that fixing the truth values
of the variables in the backdoor set moves the formula into some polynomial-time decidable …

Computational Social Choice is an interdisciplinary research area involving Economics,
Political Science, and Social Science on the one side, and Mathematics and Computer …

We study the design of fixed-parameter algorithms for problems already known to be
solvable in polynomial time. The main motivation is to get more efficient algorithms for …

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

The optimization problem of measuring all nodes in an electrical network by placing as few
measurement units (PMUs) as possible is known as Power Dominating Set. Nodes can be …

Parameterized Algorithmics: A Graph-Theoretic Approach Page 1 Parameterized Algorithmics:
A Graph-Theoretic Approach Henning Fernau Universität Tübingen, WSI für Informatik, Sand …