In networks, not all nodes have the same importance, and some are more important than
others. The issue of finding the most important nodes in networks has been addressed …

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 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 …

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 …

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 …

For problems intractable on graphs of bounded treewidth, two graph parameters treedepth
and vertex cover number have been used to obtain fine-grained algorithmic and complexity …

Given a graph G=(V, E) and an integer k∊ ℕ, we study k-Vertex Separator (resp. k-Edge
Separator), where the goal is to remove the minimum number of vertices (resp. edges) such …

Over the past decade, many results have focused on the design of parameterized
approximation algorithms for W [1]-hard problems. However, there are fundamental …

We consider the problem of solving integer programs of the form $\min\{\, c^\intercal
x\\colon\Ax= b, x\geq 0\} $, where $ A $ is a multistage stochastic matrix in the following …

The QSAT problem, which asks to evaluate a quantified Boolean formula (QBF), is of
fundamental interest in approximation, counting, decision, and probabilistic complexity and …