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 …

We first propose a method, called “bottom-up method” that, informally,“propagates”
improvement of the worst-case complexity for “sparse” instances to “denser” ones and we …

What lies before you is the result of a four year period of PhD research. It is the product of
creative ideas, hard labour, and many discussions and collaborations with other researchers …

Inclusion/exclusion and measure and conquer are two central techniques from the field of
exact exponential-time algorithms that recently received a lot of attention. In this paper, we …

In this paper, we present an O∗(2.147 9 k)-time algorithm to decide whether a graph of
maximum degree 3 has an edge dominating set of size at most k or not, which is based on …

The maximum independent set problem is one of the most important problems in theoretical
analysis on time and space complexities of exact algorithms. Theoretical improvement on …

arXiv:1308.1351v3 [cs.DS] 12 Apr 2015 Page 1 An O ∗ (1.0821n)-Time Algorithm for
Computing Maximum Independent Set in Graphs with Bounded Degree 3 Davis Issaca, Ragesh …

Given a graph G=(V, E), the edge dominating set problem is to find a minimum set M⊆ E
such that each edge in E–M has at least one common endpoint with an edge in M. The edge …

In this paper, we present an improved algorithm to decide whether a graph of maximum
degree 3 has an edge dominating set of size at most k or not, which is based on …

We study in this paper the problem of finding in a graph a subset of k edges whose deletion
causes the largest increase in the weight of a minimum spanning tree. We propose for this …