|
469
|
Parameterized Complexity
– Downey, Fellows
- 1999
|
|
188
|
Efficient algorithms for combinatorial problems on graphs with bounded decomposability
– Arnborg
- 1985
|
|
120
|
Vertex cover: further observations and further improvements
– Chen, Kanj, et al.
- 2001
|
|
79
|
Fixed-parameter tractability and completeness I: Basic theory
– Downey, Fellows
- 1995
|
|
58
|
Nondeterminism within P
– Buss, Goldsmith
- 1993
|
|
55
|
Upper bounds for vertex cover further improved
– Niedermeier, Rossmanith
- 1999
|
|
44
|
Parameterizing above guaranteed values: MaxSat and MaxCut
– Mahajan, Raman
- 1999
|
|
40
|
Nonconstructive tools for proving polynomial-time decidability
– Fellows, Langston
- 1988
|
|
38
|
The node-deletion problem for hereditary properties is NP-complete
– Lewis, Yannakakis
- 1980
|
|
36
|
On the Agreement of Many Trees
– Farach, Przytycka, et al.
- 1995
|
|
34
|
Quickly excluding a forest
– Bienstock, Robertson, et al.
- 1991
|
|
32
|
Tractability of parameterized completion problems on chordal and interval graphs: Minimum fill-in and physical mapping
– Kaplan, Shamir, et al.
- 1994
|
|
19
|
Graph Algorithms and NP-Completeness, volume 2 of Data Structures and Algorithms
– Mehlhorn
- 1984
|
|
16
|
Advice classes of parameterized tractability
– Cai, Chen, et al.
- 1997
|
|
12
|
On search, decision, and the eciency of polynomial-time algorithms
– Fellows, Langston
- 1994
|
|
9
|
Computational tractability: the view from Mars
– Downey, Fellows, et al.
- 1999
|
|
7
|
An improved algorithm for vertex cover
– Stege, Fellows
- 1998
|
|
7
|
Bounded Combinatorial Width and Forbidden Substructures
– Dinneen
- 1995
|
|
6
|
The metamathematics of the graph minor theorem, Contemporary Mathematics 65
– Friedman, Robertson, et al.
- 1987
|
|
5
|
An upper bound on the size of an obstruction
– Lagergren
- 1993
|
|
4
|
Too many minor order obstructions (for parametrized lower ideals
– Dinneen
- 1997
|
|
3
|
Fixed-parameter tractability of graph modi problems for hereditary properties
– Cai
- 1996
|
|
3
|
Upper bounds on the size of obstructions and intertwines
– Lagergren
- 1998
|
|
3
|
On algorithmic applications of the immersion order. An overview of ongoing work presented at
– Langston, Plaut
- 1998
|
|
3
|
Some prospects for ecient parameter algorithms
– Niedermeier
- 1998
|
