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 …

Exact exponential algorithms Page 1 80 coMMunicATions of ThE AcM | MARCh 2013 | Vol. 56
| No. 3 review articles Exact Exponential Algorithms of non-parameterized instances of intractable …

The field of exact exponential time algorithms for non-deterministic polynomial-time hard
problems has thrived since the mid-2000s. While exhaustive search remains asymptotically …

For more than 40 years, Branch & Reduce exponential-time backtracking algorithms have
been among the most common tools used for finding exact solutions of NP-hard problems …

In parameterized complexity, each problem instance comes with a parameter k, and a
parameterized problem is said to admit a polynomial kernel if there are polynomial time …

We provide an algorithm listing all minimal dominating sets of a graph on n vertices in time O
(1.7159 n). This result can be seen as an algorithmic proof of the fact that the number of …

The measure and conquer approach has proven to be a powerful tool to analyse exact
algorithms for combinatorial problems like Dominating Set and Independent Set. This …

Davis-Putnam-style exponential-time backtracking algorithms are the most common
algorithms used for finding exact solutions of NP-hard problems. The analysis of such …

The minimum dominating set (MDS) of the network is a node subset of smallest size that
every node in the network is either in this subset or is adjacent to one or more nodes of this …