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:37 - 17 self

Active Bibliography

15 A measure & conquer approach for the analysis of exact algorithms – Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch - 2007
3 Computing branchwidth via efficient triangulation and blocks – Fedor V. Fomin, Frederic Mazoit, Ioan Todinca - 2005
21 Measure and Conquer: A Simple O(2^0.288n) Independent Set Algorithm – Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
23 Some new techniques in design and analysis of exact (exponential) algorithms – Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch - 2005
16 Solving Connected Dominating Set Faster than 2^n – Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch - 2006
11 Bounding the number of minimal dominating sets: a measure and conquer approach – Fedor V. Fomin, Fabrizio Grandoni, Artem Pyatkin, Alexey A. Stepanov - 2005
3 Combinatorial bounds via measure and conquer: Boundings minimal dominating sets and applications – Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov - 2006
6 Exact Algorithms for Hard Graph Problems – Fabrizio Grandoni - 2004
92 Exact algorithms for NP-hard problems: A survey – Gerhard J. Woeginger
Algorithms and Constraint Programming – Fabrizio Grandoni, Giuseppe F. Italiano - 2009
23 Exact algorithms for treewidth and minimum fill-in – Fedor V. Fomin, Ioan Todinca, Dieter Kratsch, Yngve Villanger - 2004
2 An Exact Algorithm for the Minimum Dominating Clique Problem – Dieter Kratsch, Mathieu Liedloff
18 On the Complexity of k-SAT – Russell Impagliazzo, Ramamohan Paturi - 2001
Counting Exactly and Efficiently on Small Problems – Ryan Williams - 2002
Aide totale demandée – Document De Soumission B
7 An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover – Henning Fernau, Rolf Niedermeier
7 Algorithms and Resource Requirements for Fundamental Problems – R. Ryan Williams - 2007
15 A new algorithm for optimal 2-constraint satisfaction and its implications – Ryan Williams - 2005
14 Improved exact algorithms for MAX-SAT – Jianer Chen, Iyad A. Kanj - 2002