Graph theory, a fundamental branch of mathematics, centers on the study of networks
composed of vertices (nodes) and edges, examining their paths, structures, and properties …

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 the vast majority of local problems on graphs of small tree width (where by local we
mean that a solution can be verified by checking separately the neighbourhood of each …

It is well known that many local graph problems, like Vertex Cover and Dominating Set, can
be solved in time 2 O (tw)| V| O (1) for graphs G=(V, E) with a given tree decomposition of …

Parameterized computation theory has developed rapidly over the last two decades. In
theoretical computer science, it has attracted considerable attention for its theoretical value …

For an even integer t≥ 2, the Matching Connectivity matrix H t is a matrix that has rows and
columns both labeled by all perfect matchings of the complete graph on t vertices; an entry H …

We obtain a number of lower bounds on the running time of algorithms solving problems on
graphs of bounded treewidth. We prove the results under the Strong Exponential Time …

We obtain a number of lower bounds on the running time of algorithms solving problems on
graphs of bounded treewidth. We prove the results under the Strong Exponential Time …

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 …

We introduce a variant of modal logic, named Existential Counting Modal Logic (ECML),
which captures a good number of problems known to be tractable in single exponential time …