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 …

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 …

For a graph H, the H-free Edge Deletion problem asks whether there exist at most k edges
whose deletion from the input graph G results in a graph without any induced copy of H. H …

We develop a new framework for generalizing approximation algorithms from the structural
graph algorithm literature so that they apply to graphs somewhat close to that class (a …

For a graph H, the H H-free Edge Deletion problem asks whether there exist at most k edges
whose deletion from the input graph G results in a graph without any induced copy of H. H H …

Consider a graph G which belongs to a graph class C. We are interested in connecting a
node w∉ V (G) to G by a single edge uw where u∈ V (G); we call such an edge a tail. As the …

For a graph property Π Π, Subgraph Complementation to Π Π is the problem to find whether
there is a subset SS of vertices of the input graph GG such that modifying GG by …

Graph modification problems are significant problems in computer science that have gained
considerable attention in recent decades. In this thesis, we focus on edge modification …

For a fixed graph H, the H-free Edge Deletion/Completion/Editing problem asks to
delete/add/edit the minimum possible number of edges in G to get a graph that does not …

In a (parameterized) graph edge modification problem, we are given a graph G, an integer k
and a (usually well-structured) class G of graphs, and asked whether it is possible to …