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 idea for this book was conceived over the second bottle of Villa Maria's Caber net
Medot'89, at the dinner of the Australasian Combinatorics Conference held at Palmerston …

Classical complexity theory analyzes and classifies problems by the amount of a resource,
usually time or space, that is required by algorithms solving them. It was a fundamental idea …

For several NP-complete problems, there have been a progression of better but still
exponential algorithms. In this paper, we address the relative likelihood of sub-exponential …

We discuss fast exponential time solutions for NP-complete problems. We survey known
results and approaches, we provide pointers to the literature, and we discuss several open …

For many fixed-parameter problems that are trivially soluable in polynomial time, such as (k-)
DOMINATING SET, essentially no better algorithm is presently known than the one which …

For many fixed-parameter problems that are trivially solvable in polynomial-time, such as k-
DOMINATING SET, essentially no better algorithm is presently known than the one which …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

We give a complexity theoretic classification of homomorphism problems for graphs and,
more generally, relational structures obtained by restricting the left hand side structure in a …

We develop a parameterized complexity theory for counting problems. As the basis of this
theory, we introduce a hierarchy of parameterized counting complexity classes# W t, for t≥1 …