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 …

The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …

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 …

In this study, a hybrid approach that employs Hopfield neural network and a genetic
algorithm in doing k-SAT problems was proposed. The Hopfield neural network was used to …

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 Odd Cycle Transversal problem (OCT) asks whether a given undirected graph can be
made bipartite by deleting at most k of its vertices. In a breakthrough result, Reed, Smith, and …

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 an exact algorithm that decides, for every fixed r≥ 2 in time O(m)+2^O(k^2)
whether a given multiset of m clauses of size r admits a truth assignment that satisfies at …

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 …