Vertex-deletion problems have been at the heart of parameterized complexity throughout its
history. Here, the aim is to determine the minimum size (denoted by mod ℋ) of a modulator …

Vertex deletion problems have been at the heart of numerous major advances in Algorithms
and Combinatorial Optimization, and especially so in the area of Parameterized Complexity …

In parameterized complexity, it is well-known that a parameterized problem is fixed-
parameter tractable if and only if it has a kernel—an instance equivalent to the input …

The celebrated notion of important separators bounds the number of small (S, T)-separators
in a graph which are 'farthest from S'in a technical sense. In this paper, we introduce a …

The problem of deletion of vertices to a hereditary graph class is a well-studied problem in
parameterized complexity. Recently, a natural extension of the problem was initiated where …

Let\varPi Π be a hereditary graph class. The problem of deletion to\varPi Π, takes as input a
graph G and asks for a minimum number (or a fixed integer k) of vertices to be deleted from …

Graphs form a central object in discrete mathematics as they model many practical networks
including electrical, road and social networks. There are a number of special graph classes …