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

In the F-minor-free deletion problem we are given an undirected graph G and the goal is to
find a minimum vertex set that intersects all minor models of graphs from the family F. This …

We investigate a fundamental vertex-deletion problem called (Induced) Subgraph Hitting:
given a graph $ G $ and a set $\mathcal {F} $ of forbidden graphs, the goal is to compute a …

For numerous graph problems in the realm of parameterized algorithms, using the size of a
smallest deletion set (called a modulator) into well-understood graph families as …

In this work, we provide the first practical evaluation of the structural rounding framework for
approximation algorithms. Structural rounding works by first editing to a well-structured …

Many problems are NP-hard and, unless P= NP, do not admit polynomial-time exact
algorithms. The fastest known exact algorithms exactly usually take time exponential in the …

A property Π on a finite set U is monotone if for every X⊆ U satisfying Π, every superset Y⊆
U of X also satisfies Π. Many combinatorial properties can be seen as monotone properties …

Courcelle's theorem and its adaptations to cliquewidth have shaped the field of exact
parameterized algorithms and are widely considered the archetype of algorithmic meta …

Abstract In the Power Vertex Cover (PVC) problem introduced in [1] as a generalization of
the well-known Vertex Cover, we are allowed to specify costs for covering edges in a graph …

A property $\Pi $ on a finite set $ U $ is\emph {monotone} if for every $ X\subseteq U $
satisfying $\Pi $, every superset $ Y\subseteq U $ of $ X $ also satisfies $\Pi $. Many …