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 …

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 …

Preprocessing, or data reduction, is a standard technique for simplifying and speeding up
computation. Written by a team of experts in the field, this book introduces a rapidly …

The survey is a comprehensive overview of the develo** area of parameterized
algorithms for graph modification problems. It describes state of the art in kernelization …

Wolfgang Dvorák, Paul E. Dunne abstract. In this chapter we give an overview of the core
computational problems arising in formal argumentation together with a complexity analysis …

We prove that given an undirected graph G on n vertices and an integer k, one can compute,
in polynomial time in n, a graph G′ with at most 4 k 2 vertices and an integer k′ such that …

We consider systems of differential equations which model complex regulatory networks by
a graph structure of dependencies. We show that the concepts of informative nodes …

We study the parameterized complexity of various classic vertex-deletion problems such as
Odd cycle transversal, Vertex planarization, and Chordal vertex deletion under hybrid …

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 …

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 …