Preprocessing, or data reduction, is a standard technique for simplifying and speeding up
computation. Written by a team of experts in the field, this book introduces a rapidly …

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

Given a graph G and integers k 1, k 2, and k 3, the unit interval editing problem asks whether
G can be transformed into a unit interval graph by at most k 1 vertex deletions, k 2 edge …

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 …

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

Edge deletion problems ask for a minimum set of edges whose deletion makes a graph
have a certain property. When this property can be characterized by a finite set of forbidden …

In the Trivially Perfect Editing problem one is given an undirected graph $ G=(V, E) $ and an
integer $ k $ and seeks to add or delete at most $ k $ edges in $ G $ to obtain a trivially …

In the Proper Interval Completion problem we are given a graph G and an integer k, and the
task is to turn G using at most k edge additions into a proper interval graph, ie, a graph …

Given a class of graphs GG and a graph G=(V, E) G=(V, E), the aim of the G G-completion
problem is to find a set of at most k non-edges whose addition in G results in a graph that …

Abstract In the Proper Interval Completion problem we are given a graph G and an integer k,
and the task is to turn G using at most k edge additions into a proper interval graph, ie, a …