For a fixed connected graph H, the {H}-M-Deletion problem asks, given a graph G, for the
minimum number of vertices that intersect all minor models of H in G. It is known that this …

Given a graph $ G $ and an integer $ k $, Max Min FVS asks whether there exists a minimal
set of vertices of size at least $ k $ whose deletion destroys all cycles. We present several …

The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedback Vertex
Set (SFVS) both ask for a vertex set of minimum total weight, that for NMC disconnects a …

In this paper, we design a framework to obtain efficient algorithms for several problems with
a global constraint (acyclicity or connectivity) such as Connected Dominating Set, Node …

In the general AntiFactor problem, a graph $ G $ is given with a set $ X_v\subseteq\mathbb
{N} $ of forbidden degrees for every vertex $ v $ and the task is to find a set $ S $ of edges …

The Cut & Count technique and the rank-based approach have lead to single-exponential
FPT algorithms parameterized by treewidth, that is, running in time $2^{O (tw)} n^{O (1)} …

Planar graphs are known to allow subexponential algorithms running in time 2^ O (n) 2 O (n)
or 2^ O (n\log n) 2 O (n log n) for most of the paradigmatic problems, while the brute-force …

Abstract In k-Digraph Coloring we are given a digraph and are asked to partition its vertices
into at most k sets, so that each set induces a DAG. This well-known problem is NP-hard, as …

In this paper we study the problem of finding a small safe set S in a graph G, ie a non-empty
set of vertices such that no connected component of GS is adjacent to a larger component in …

For a finite fixed collection of graphs F, the FM-Deletion problem consists in, given a graph G
and an integer k, decide whether there exists S⊆ V (G) with| S|≤ k such that G∖ S does not …