We investigate the parameterized complexity of Vertex Cover parameterized by the
difference between the size of the optimal solution and the value of the linear programming …

Given an undirected graph G, a collection (s1, t1),...,(sl, tl) of pairs of vertices, and an integer
p, the Edge Multicut problem ask if there is a set S of at most p edges such that the removal …

The aim of this article is to motivate and describe the parameter ecology program, which
studies how different parameters contribute to the difficulty of classical problems. We call for …

The existence of a polynomial kernel for Odd Cycle Transversal was a notorious open
problem in parameterized complexity. Recently, this was settled by the present authors …

We present a method for reducing the treewidth of a graph while preserving all of its minimal
st separators up to a certain fixed size k. This technique allows us to solve st Cut and …

We introduce a concept of parameterizing a problem above the optimum solution of its
natural linear programming relaxation and prove that the node multiway cut problem is fixed …

The classical Feedback Vertex Set problem asks, for a given undirected graph G and an
integer k, to find a set of at most k vertices that hits all the cycles in the graph G. Feedback …

Given a directed graph G, a set of k terminals, and an integer p, the Directed Vertex Multiway
Cut problem asks whether there is a set S of at most p (nonterminal) vertices whose removal …

In the area of parameterized complexity, to cope with NP-Hard problems, we introduce a
parameter k besides the input size n, and we aim to design algorithms (called FPT …

The standard parameterization of the Vertex Cover problem (Given an undirected graph G
and k∊ ℕ as input, does G have a vertex cover of size at most k?) has the solution size k as …