Inclusion/exclusion and measure and conquer are two of the most important recent new developments in the field of exact exponential time algorithms. Algorithms that combine both techniques have been found very recently, but thus far always use exponential space. In this paper, we try to obtain fast exponential time algorithms for graph domination problems using only polynomial space. Using a no...

Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing problem the sets are required to be pairwise disjoint and their union contained in the universe. When the size of the family is exponential in n, the fastest known algorithms for these problems use inclusion–exclusion and fast zet...

NP-complete problems cannot have efficient algorithms unless P = NP. Due to their importance in practice, however, it is useful to improve the known exponential-time algorithms for NP-complete problems. We survey some of the recent results on such improved exponential-time algorithms for the NP-complete problems satisfiability, graph colorability, and the domatic number problem. The determinist...