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 …

Various centrality indices have been proposed to capture different aspects of structural
importance but relations among them are largely unexplained. The most common strategy …

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 …

In this work, we focus on several completion problems for subclasses of chordal graphs:
Minimum Fill-In, Interval Completion, Proper Interval Completion, Trivially Perfect …

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 …

Abstract We introduce Quasi-Threshold Mover (QTM), an algorithm to solve the quasi-
threshold (also called trivially perfect) graph editing problem with a minimum number of …

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 …

We study two clustering problems, Starforest Editing, the problem of adding and deleting
edges to obtain a disjoint union of stars, and the generalization Bicluster Editing. We show …

In an edge modification problem, we are asked to modify at most $ k $ edges to a given
graph to make the graph satisfy a certain property. Depending on the operations allowed …

We consider the problem of transforming a given graph into a quasithreshold graph using a
minimum number of edge additions and deletions. Building on the previously proposed …