Measure and conquer: domination -- a case study (2005)

Cached

Download Links

by Fedor V. Fomin , Fabrizio Grandoni , Dieter Kratsch
Venue:PROCEEDINGS OF THE 32ND INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING (ICALP 2005), SPRINGER LNCS
Citations:47 - 20 self

Active Bibliography

30 A measure & conquer approach for the analysis of exact algorithms – Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch - 2007
5 Computing branchwidth via efficient triangulation and blocks – Fedor V. Fomin, Frederic Mazoit, Ioan Todinca - 2005
Measure and Conquer: A Simple O(2 0.288n) Independent Set Algorithm – Oni Dieter Kratsch
28 Measure and Conquer: A Simple O(2^0.288n) Independent Set Algorithm – Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
Computing – unknown authors
30 Some new techniques in design and analysis of exact (exponential) algorithms – Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch - 2005
19 Solving Connected Dominating Set Faster than 2^n – Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch - 2006
14 Bounding the number of minimal dominating sets: a measure and conquer approach – Fedor V. Fomin, Fabrizio Grandoni, Artem Pyatkin, Alexey A. Stepanov - 2005
7 Combinatorial bounds via measure and conquer: Boundings minimal dominating sets and applications – Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov - 2006
7 Exact Algorithms for Hard Graph Problems – Fabrizio Grandoni - 2004
Using Combinatorics to Prune Search Trees: Independent and Dominating Set – Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov - 2006
118 Exact algorithms for NP-hard problems: A survey – Gerhard J. Woeginger
8 An exact 2.9416 n algorithm for the three domatic number problem – Tobias Riege, Jörg Rothe - 2005
Algorithms and Constraint Programming – Fabrizio Grandoni, Giuseppe F. Italiano - 2009
2 3-Coloring in Time – Richard Beigel - 2000
26 Exact algorithms for treewidth and minimum fill-in – Fedor V. Fomin, Ioan Todinca, Dieter Kratsch, Yngve Villanger - 2004
3 An Exact Algorithm for the Minimum Dominating Clique Problem – Dieter Kratsch, Mathieu Liedloff
Counting Exactly and Efficiently on Small Problems – Ryan Williams - 2002
38 On the Complexity of k-SAT – Russell Impagliazzo, Ramamohan Paturi - 2001