Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

Parameterized computation theory has developed rapidly over the last two decades. In
theoretical computer science, it has attracted considerable attention for its theoretical value …

The (parameterized) feedback vertex set problem on directed graphs, which we refer to as
the dfvs problem, is defined as follows: given a directed graph G and a parameter k, either …

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 …

Given a graph G=(V, E) G=(V,E) and a subset of its vertices V′⊆ VV^′⊆V, the subgraph
induced by V′ V^′ in G is that with vertex set V′ V^′ and edge set E′ E^′ formed by …

A central problem in parameterized algorithms is to obtain algorithms with running time
f(k)⋅n^O(1) such that f is as slow growing a function of the parameter k as possible. In …

We present a new deterministic algorithm for the Feedback Vertex Set problem
parameterized by the solution size. Our algorithm runs in O⁎((2+ ϕ) k) time, where ϕ< 1.619 …

We present a new parameterized algorithm for the feedback vertex set problem (fvs) on
undirected graphs. We approach the problem by considering a variation of it, the disjoint …

We give a new general approach for designing exact exponential-time algorithms for subset
problems. In a subset problem the input implicitly describes a family of sets over a universe …

In the Feedback Vertex Set (FVS) problem, one is given an undirected graph G and an
integer k, and one needs to determine whether there exists a set of k vertices that intersects …