The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …

The survey is a comprehensive overview of the developing area of parameterized
algorithms for graph modification problems. It describes state of the art in kernelization …

The Chordal Vertex Deletion (ChVD) problem asks to delete a minimum number of vertices
from an input graph to obtain a chordal graph. In this paper we develop a polynomial kernel …

The intrinsic properties of nanomaterials offer promise for technological revolutions in many
fields, including transportation, soft robotics, and energy. Unfortunately, the exploitation of …

We give a kernel with O (k^ 7) O (k 7) vertices for Trivially Perfect Editing, the problem of
adding or removing at most k edges in order to make a given graph trivially perfect. This …

We study the computational complexity of the graph modification problems and, adding and
deleting as few edges as possible to transform the input into a threshold (or chain) graph. In …

Kernelization algorithms for graph modification problems are important ingredients in
parameterized computation theory. In this paper, we survey the kernelization algorithms for …

Let F be a family of graphs. In the F-Completion problem, we are given an n-vertex graph G
and an integer k as input, and asked whether at most k edges can be added to G so that the …

In the Interval Completion problem we are given an n-vertex graph G and an integer k, and
the task is to transform G by making use of at most k edge additions into an interval graph …

The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves the following
problem in linear fixed-parameter time: given a tree decomposition of a graph of (possibly …