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 …

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 …

Potential maximal cliques and minimal separators are combinatorial objects which were
introduced and studied in the realm of minimal triangulations problems including Minimum …

This book studies exponential time algorithms for NP-hard problems. In this modern area,
the aim is to design algorithms for combinatorially hard problems that execute provably …

We show that for a fixed r, the number of maximal r-regular induced subgraphs in any graph
with n vertices is upper bounded by O(c^n), where c is a positive constant strictly less than 2 …

Finding maximum regular induced subgraphs is a family of algorithmic graph problems
containing several important representatives such as maximum independent set, maximum …

In this paper we study the problem of finding a maximum induced d-degenerate subgraph in
a given n-vertex graph from the point of view of exact algorithms. We show that for any fixed …

We study combinatorial and algorithmic questions around minimal feedback vertex sets
(FVS) in tournament graphs. On the combinatorial side, we derive upper and lower bounds …

We investigate the complexity of finding Nash equilibria in which the strategy of each player
is uniform on its support set. We show that, even for a restricted class of win–lose bimatrix …

We study combinatorial and algorithmic questions around minimal feedback vertex sets in
tournament graphs. On the combinatorial side, we derive strong upper and lower bounds on …