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 …

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 …

Given a set N with n elements and a family F of subsets, we show how to partition N into k
such subsets in 2^nn^O(1) time. We also consider variations of this problem where the …

Cloud computing has gained popularity in recent times. As a cloud must provide services to
many users at the same time and different users have different QoS requirements, the …

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 …

Quantum annealing has the potential to find low energy solutions of NP-hard problems that
can be expressed as quadratic unconstrained binary optimization problems. However, the …

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 topic of exact, exponential-time algorithms for NP-hard problems has received a lot of
attention, particularly with the focus of producing algorithms with stronger theoretical …

We present a time O(1.7548^n) algorithm finding a minimum feedback vertex set in an
undirected graph on n vertices. We also prove that a graph on n vertices can contain at most …

The Set Cover problem belongs to a group of hard problems which are neither
approximable in polynomial time (at least with a constant factor) nor fixed parameter …