Let F be a finite set of graphs. In the F-DELETION problem, we are given an n-vertex graph
G and an integer k as input, and asked whether at most k vertices can be deleted from G …

Parameterization and approximation are two popular ways of coping with NP-hard
problems. More recently, the two have also been combined to derive many interesting …

We study the problem of deleting the smallest set S of vertices (resp. edges) from a given
graph G such that the induced subgraph (resp. subgraph) G\S belongs to some class ℋ. We …

We study a general class of problems called F-Deletion problems. In an F-Deletion problem,
we are asked whether a subset of at most k vertices can be deleted from a graph G such that …

In the Weighted Treewidth-$\eta $ Deletion problem we are given a node-weighted graph $
G $ and we look for a vertex subset $ X $ of minimum weight such that the treewidth of $ GX …

We consider a decision version of the problem of finding the minimum number of vertices
whose deletion results in a graph without even cycles. While this problem is a natural …

We study a general class of problems called F-deletion problems. In an F-deletion problem,
we are asked whether a subset of at most $ k $ vertices can be deleted from a graph $ G …

The c-pumpkin is the graph with two vertices linked by c≧1 parallel edges. A c-pumpkin-
model in a graph G is a pair {A,B\} of disjoint subsets of vertices of G, each inducing a …

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 …

Given two graphs G and H, we define v-cover _ H (G) v-cover H (G)(resp. e-cover _ H (G) e-
cover H (G)) as the minimum number of vertices (resp. edges) whose removal from G …