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

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 …

Parameterization and approximation are two popular ways of coping with NP-hard
problems. More recently, the two have also been combined to derive many interesting …

This paper gives an introduction to the new research area of Organic Computing and shows
chances, opportunities and problems currently tackled by researchers. First the visions that …

We introduce a new technique for designing fixed-parameter algorithms for cut problems,
called randomized contractions. We apply our framework to obtain the first fixed-parameter …

Many problems of industrial interest are NP-complete, and quickly exhaust resources of
computational devices with increasing input sizes. Quantum annealers (QA) are physical …

We give a fixed-parameter tractable algorithm that, given a parameter k and two graphs
G_1,G_2, either concludes that one of these graphs has treewidth at least k or determines …

We show a flow-augmentation algorithm in directed graphs: There exists a randomized
polynomial-time algorithm that, given a directed graph G, two integers s, t∈ V (G), and an …

We introduce a new data structure for answering connectivity queries in undirected graphs
subject to batched vertex failures. Precisely, given any graph G and integer k, we can in …

We show an algorithm that, given an n-vertex graph G and a parameter k, in time 2 O (k log
k) n O (1) finds a tree decomposition of G with the following properties:—every adhesion of …