|
697
|
Parameterized Complexity
– Rod G. Downey, Michael R. Fellows, Rolf Niedermeier, Peter Rossmanith, Rod G. Downey (wellington, New Zeal, Michael R. Fellows (newcastle, Rolf Niedermeier (tubingen, Peter Rossmanith (tu Munchen
- 1998
|
|
84
|
Algorithms for maximum independent sets
– J M Robson
- 1986
|
|
61
|
U.: A deterministic (2 − 2/(k + 1)) n algorithm for k-SAT based on local search
– E Dantsin, A Goerdt, E A Hirsch, R Kannan, J Kleinberg, C Papadimitriou, P Raghavan, Schöning
- 2002
|
|
8882
|
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H
– M R Garey, D S Johnson
- 1979
|
|
26
|
A new algorithm for optimal constraint satisfaction and its implications
– Ryan Williams
- 2004
|
|
31
|
Small Maximal Independent Sets and Faster Exact Graph Coloring
– David Eppstein
- 2003
|
|
141
|
Vertex Cover: Further Observations and Further Improvements
– Jianer Chen, Iyad A. Kanj, Weijia Jia
- 1999
|
|
94
|
A dynamic programming approach to sequencing problems
– M Held, R M Karp
- 1962
|
|
78
|
Which Problems Have Strongly Exponential Complexity?
– Russell Impagliazzo, Ramamohan Paturi, Francis Zane
- 1998
|
|
23
|
Exact algorithms for treewidth and minimum fill-in
– Fedor V. Fomin, Ioan Todinca, Dieter Kratsch, Yngve Villanger
- 2004
|
|
30
|
Enumerating maximal independent sets with applications to graph colouring
– J M Byskov
|
|
63
|
Finding a maximum independent set
– R E Tarjan, A E Trojanowski
- 1977
|
|
21
|
Exact (exponential) algorithms for the dominating set problem
– Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger
- 2004
|
|
46
|
A note on the complexity of the chromatic number problem
– E L Lawler
- 1976
|
|
22
|
Quasiconvex analysis of backtracking algorithms
– D Eppstein
|
|
25
|
3-coloring in time O(1.3289
– R Beigel, D Eppstein
|
|
37
|
Measure and conquer: domination -- a case study
– Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
- 2005
|
|
320
|
Graph minors II: Algorithmic aspects of tree-width
– N Robertson, P Seymour
- 1986
|
|
81
|
Call routing and the ratcatcher
– P D Seymour, R Thomas
|
