Although the field of "parameterized complexity " has been around for several years and has generated a large and varied literature, the field is still unknown to a large segment of the theory community, and it is misunderstood by many who have only a vague notion of the field. The article below is not only entertaining and highly readable, but it also explains how the field of parameterized complexity complements other e#orts in theoretical computer science, in combining practical approaches and theoretical tools to attack the fundamental problems in complexity and algorithm design.
|
7716
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
1258
|
Randomized Algorithms
– Motwani, Raghavan
- 1995
|
|
469
|
Parameterized Complexity
– Downey, Fellows
- 1999
|
|
468
|
Where the really hard problems are
– Cheeseman, Kanefsky, et al.
- 1991
|
|
272
|
Probabilistic construction of deterministic algorithms: approximating packing integer programs
– Raghavan
- 1988
|
|
230
|
Approximation algorithms for NP-complete problems on planar graphs
– Baker
- 1994
|
|
216
|
The Traveling Salesman Problem: A Case Study in Local Optimization
– Johnson, McGeoch
- 1997
|
|
174
|
A linear time algorithm for finding tree-decompositions of small treewidth
– Bodlaender
- 1996
|
|
153
|
On the complexity of local search
– Papadimitriou, Schaffer, et al.
- 1990
|
|
153
|
Average case complete problems
– Levin
- 1986
|
|
72
|
Graph minors --- a survey
– Robertson, Seymour
- 1985
|
|
62
|
Parameterized Complexity: A Framework for Systematically Confronting
– Downey, Fellows, et al.
- 1999
|
|
60
|
On limited nondeterminism and the complexity of the V-C dimension
– Papadimitriou, Yannakakis
- 1996
|
|
55
|
Upper bounds for vertex cover further improved
– Niedermeier, Rossmanith
- 1999
|
|
37
|
Derandomizing semidefinite programming based approximation algorithms
– Mahajan, Ramesh
- 1995
|
|
36
|
On fixed-parameter tractability and approximability of NP optimization problems
– Cai, Chen
- 1997
|
|
36
|
On the Agreement of Many Trees
– Farach, Przytycka, et al.
- 1995
|
|
36
|
Structured programs have small tree-width and good register allocation
– Thorup
- 1998
|
|
32
|
Average-case computational complexity theory
– Wang
- 1997
|
|
31
|
On the parameterized complexity of short computation and factorization
– Cai, Chen, et al.
- 1997
|
|
30
|
Fixed parameter tractability and completeness I: basic theory
– Downey, Fellows
- 1995
|
|
27
|
Parameterized complexity analysis
– Bodlaender, Downey, et al.
- 1995
|
|
25
|
The Parameterized Complexity of Some Problems in Logic and Linguistics
– Downey, Fellows, et al.
- 1994
|
|
21
|
An Improved Fixed-Parameter Algorithm for Vertex
– Balasubramanian, Fellows, et al.
- 1998
|
|
21
|
On the efficiency of polynomial time approximation schemes
– CESATI, TREVISAN
- 1997
|
|
20
|
Perspectives on database theory
– Yannakakis
- 1995
|
|
17
|
personal communication
– Bryant
- 1992
|
|
17
|
Complexity and Randomness
– Karp, Combinatorics
- 1986
|
|
15
|
Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs
– Alon, Yuster, et al.
- 1995
|
|
14
|
Fixed Parameter Tractability and Completeness IV: On Completeness for W [P
– Abrahamson, Downey, et al.
- 1995
|
|
14
|
Computing the Future: A Broader Agenda for
– Hartmanis, Lin
- 1992
|
|
14
|
An improved fixed-parameter-tractable algorithm for vertex cover
– Stege, Fellows
- 1999
|
|
13
|
Sch'emas d'approximation et complexit'e param'etr'ee," Rapport de stage de DEA d'Informatique `a Orsay
– BAZGAN
- 1995
|
|
13
|
Building trees, hunting for trees, and comparing trees
– Bryant
- 1997
|
|
13
|
Parameterized Learning Complexity
– Downey, Evans, et al.
- 1993
|
|
13
|
personal communication
– Felsenstein
- 1996
|
|
13
|
Fixed-parameter complexity and cryptography
– Fellows, Koblitz
- 1993
|
|
10
|
An Algorithm for the Class of Pure Implicational Formulas
– Franco, Goldsmith, et al.
- 1996
|
|
8
|
Structural Aspects of Parameterized Complexity
– Cesati
- 1995
|
|
7
|
Proof Verification and Intractability of Approximation Algorithms
– Arora, Lund, et al.
- 1992
|
|
7
|
Vertex cover revisited: A hybrid algorithm of theory and heuristic
– Hallett, Gonnet, et al.
- 1998
|
|
7
|
On Finding and Verifying Locally Optimal Solutions
– Krentel
- 1990
|
|
6
|
The Ultraintuitionistic Criticism and the Antitraditional Program for Foundations of Mathematics," in: Intuitionism and Proof Theory
– Yessenin-Volpin
- 1968
|
|
5
|
Advice Classes of Parameterized Tractability," Annals of Pure and Applied Logic 84
– Cai, Chen, et al.
- 1997
|
|
5
|
Theory and Practice in Planning
– Dean, Kirman, et al.
- 1996
|
|
4
|
The Future of Computational Complexity Theory: Part II
– Allender, Feigenbaum, et al.
- 1996
|
|
4
|
On the Parameterized Complexity of MAST and 3-Hitting Sets," manuscript
– Bryant, Fellows, et al.
- 1998
|
|
4
|
Average-case intractable NP problems
– Wang
- 1997
|
|
3
|
Critical Behavior in the Satisfiability of Boolean Formulae," Science 264
– Kirkpatrick, Selman
- 1994
|
|
3
|
Dense Layouts for Series-Parallel Graphs
– Langston, Ramachandramurthi
- 1991
|
