R.G. owney, M.R. Fellows. "Fixed-parameter tractability and completeness." Congressus Num" antium , Vol.87, 161--187, 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
FPT Algorithm - For The Undirected Self-citation (Fellows) (Correct)
No context found.
R. Downey and M. Fellows. Fixed-parameter tractability and completeness. Congressus Numerantium 87 (1992), 161--187.
An O(2^O(k) n³) FPT Algorithm for the.. - Dehne, Fellows.. (2005) Self-citation (Fellows) (Correct)
No context found.
R. Downey and M. Fellows. Fixed-parameter tractability and completeness. Congressus Numerantium 87 (1992), 161--187.
An O(2^O(k) n³) FPT Algorithm for the.. - Dehne, Fellows.. (2005) Self-citation (Fellows) (Correct)
No context found.
R. Downey and M. Fellows. Fixed-parameter tractability and completeness. Congressus Numerantium 87 (1992), 161--187.
Fixed-Parameter Tractability and Completeness II: On.. - Downey, Fellows (1994) (145 citations) Self-citation (Downey Fellows) (Correct)
No context found.
R. G. Downey and M. R. Fellows, "Fixed-Parameter Tractability and Completeness III: Some Structural Aspects of the W -Hierarchy," in Complexity Theory, (ed. K. AmbosSpies, S. Homer, and U. Sch"/oing), Cambridge University Press, (1993) 166-191.
Fixed-Parameter Tractability and Completeness II: On.. - Downey, Fellows (1994) (145 citations) Self-citation (Downey Fellows) (Correct)
No context found.
R. G. Downey and M. R. Fellows, "Fixed-Parameter Tractability and Completeness I: Basic Results," to appear SIAM J. of Comput.
Fixed-Parameter Tractability and Completeness II: On.. - Downey, Fellows (1994) (145 citations) Self-citation (Downey Fellows) (Correct)
No context found.
R. G. Downey and M. R. Fellows, "Fixed-Parameter Tractability and Completeness, Cong. Numer. 87 (1992) 161-187.
Fixed-Parameter Tractability and Completeness II: On.. - Downey, Fellows (1994) (145 citations) Self-citation (Downey Fellows) (Correct)
No context found.
K. A. Abrahamson, R. G. Downey, and M. R. Fellows, "Fixed-Parameter Tractability and Completeness IV: On Completeness for W [P ] and PSPACE Analogues", to appear, Annals of Pure and Applied Logic.
Fixed-Parameter Tractability and Completeness I: Basic Results - Downey, Fellows (1995) (145 citations) Self-citation (Downey Fellows) (Correct)
No context found.
R. Downey and M. Fellows, "Fixed Parameter Tractability and Completeness III: Density and Other Structural Aspects" in Complexity Theory (Ed. K. Ambos-Spies, S. Homer, and U. Schoning) Cambridge University Press (1993) 166-191.
Fixed-Parameter Tractability and Completeness I: Basic Results - Downey, Fellows (1995) (145 citations) Self-citation (Downey Fellows) (Correct)
No context found.
R. Downey and M. Fellows, "Fixed Parameter Tractability and Completeness II: On Completeness for W[1]," to appear Theoretical Computer Science.
Fixed-Parameter Tractability and Completeness I: Basic Results - Downey, Fellows (1995) (145 citations) Self-citation (Downey Fellows) (Correct)
No context found.
R. Downey and M. Fellows, " Fixed-Parameter Tractability and Completeness," Congressus Numerantium, Vol 87 (1992) 161-187.
Fixed-Parameter Tractability and Completeness I: Basic Results - Downey, Fellows (1995) (145 citations) Self-citation (Downey Fellows) (Correct)
No context found.
K.Abrahamson, R.Downey, and M.Fellows, Fixed Parameter Tractability and Completeness IV: on Completeness for W[P] and PSPACE Analogues, to appear Annals of Pure and Applied Logic.
Cutting Up Is Hard To Do: the Parameterized.. - Estivill-Castro.. (2002) Self-citation (Downey Fellows Prieto-rodriguez Rosamond) (Correct)
No context found.
R. Downey, M. Fellows, E. Prieto-Rodriguez and F. Rosamond. Fixed-parameter tractability and completeness V: parametric miniatures. Manuscript in preparation, 2002. 9
Cutting Up Is Hard To Do: the Parameterized.. - Estivill-Castro.. (2002) Self-citation (Downey Fellows) (Correct)
No context found.
R. Downey and M. Fellows. Fixed-parameter tractability and completeness II: completeness for W [1]. Theoretical Computer Science A 141 (1995), 109-131.
Cutting Up Is Hard To Do: the Parameterized.. - Estivill-Castro.. (2002) Self-citation (Downey Fellows) (Correct)
No context found.
R. G. Downey and M. R. Fellows, Fixed-parameter tractability and completeness I: basic theory. SIAM Journal of Computing 24 (1995), 873-921.
Polynomial-Time Data Reduction for DOMINATING SET - Alber, Fellows, Niedermeier (2004) Self-citation (Fellows) (Correct)
No context found.
R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness. Congressus Numerantium, 87:161--187, 1992.
Derivation of Algorithms for Cutwidth and Related.. - Bodlaender, Fellows.. (2002) (1 citation) Self-citation (Fellows) (Correct)
No context found.
Downey, R. G., and Fellows, M. R. Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput. 24 (1995), 873--921.
A Parallel FPT - Appli Ko For (Correct)
No context found.
R.G. owney, M.R. Fellows. "Fixed-parameter tractability and completeness." Congressus Num" antium , Vol.87, 161--187, 1992.
A Parallel FPT - Appli Ko For (Correct)
No context found.
R.G. owney, M.R. Fellows. "Fixed Parameter Tractability and Completeness II: Completeness for W [1]". Theoretical ComKR er Science A, Vol.141, 109--131, 1995.
A Parallel FPT - Appli Ko For (Correct)
No context found.
R.G. owney, M.R. Fellows."Fixed Parameter Tractability and Completeness I:B asic Theory". SIAM Journal of Com puting, Vol.24, 873--921, 1995.
Isomorphism for Graphs of Bounded Distance Width - Koichi Yamazaki Hans (1997) (Correct)
No context found.
R. G. Downey and M. R. Fellows, Fixed-parameter tractability and completeness II: On completeness for W [1], Theor. Comput. Sci. 141 (1995), pp. 109--131.
Isomorphism for Graphs of Bounded Distance Width - Koichi Yamazaki Hans (1997) (Correct)
No context found.
R. G. Downey and M. R. Fellows, Fixed-parameter tractability and Completeness I: Basic Results, SIAM J. Comput., 24 (1995), pp. 873--921.
Fixed Parameter Algorithms for - Planar Dominating Set (2000) (Correct)
No context found.
R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness. Congr. Num. 87:161--187, 1992.
Parameterized Power Domination Complexity - Kneis, Mölle, Richter, Rossmanith (2004) (Correct)
No context found.
R. G. Downey and M. R. Fellows. Fixed parameter tractability and completeness III. In K. Ambos-Spies, S. Homer, and U. Schoning, editors, Complexity Theory: Current Research, pages 191--225. Cambridge University Press, 1993.
Parameterized Power Domination Complexity - Kneis, Mölle, Richter, Rossmanith (2004) (Correct)
No context found.
K. A. Abrahamson, R. G. Downey, and M. R. Fellows. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues. Annals of Pure and Applied Logic, 73:235--276, 1995.
A Parallel FPT - Appli Ko For (Correct)
No context found.
R.G. owney, M.R. Fellows. "Fixed-parameter tractability and completeness." Congressus Num" antium , Vol.87, 161--187, 1992.
A Parallel FPT - Appli Ko For (Correct)
No context found.
R.G. owney, M.R. Fellows. "Fixed Parameter Tractability and Completeness II: Completeness for W [1]". Theoretical ComKR er Science A, Vol.141, 109--131, 1995.
A Parallel FPT - Appli Ko For (Correct)
No context found.
R.G. owney, M.R. Fellows."Fixed Parameter Tractability and Completeness I:B asic Theory". SIAM Journal of Com puting, Vol.24, 873--921, 1995.
Maximum Exact Satisfiability: NP-completeness Proofs and.. - Madsen, Rossmanith (2004) (Correct)
No context found.
R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness II: on completeness for W[1]. Theoretical Comput. Sci., 141(12) :109--131, 1995.
A Parallel FPT Application for Clusters - Cheetham, Dehne, al. (Correct)
No context found.
R.G. owney, M.R. Fellows. "Fixed-parameter tractability and completeness." Congressus Num" antium , Vol.87, 161--187, 1992.
A Parallel FPT Application for Clusters - Cheetham, Dehne, al. (Correct)
No context found.
R.G. owney, M.R. Fellows. "Fixed Parameter Tractability and Completeness II: Completeness for W [1]". Theoretical ComKR er Science A, Vol.141, 109--131, 1995.
A Parallel FPT Application for Clusters - Cheetham, Dehne, al. (Correct)
No context found.
R.G. owney, M.R. Fellows."Fixed Parameter Tractability and Completeness I:B asic Theory". SIAM Journal of Com puting, Vol.24, 873--921, 1995.
Parameterized Power Domination Complexity - Kneis, Mölle, Richter, Rossmanith (2004) (Correct)
No context found.
R. G. Downey and M. R. Fellows. Fixed parameter tractability and completeness III. In Complexity Theory: Current Research, Edited by K. Ambos-Spies, S. Homer, and U. Schoning, Cambridge University Press, pages 191--225. 1993.
Parameterized Power Domination Complexity - Kneis, Mölle, Richter, Rossmanith (2004) (Correct)
No context found.
K. A. Abrahamson, R. G. Downey, and M. R. Fellows. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues. Annals of Pure and Applied Logic, 73:235--276, 1995.
The Complexity of Maximum Matroid-Greedoid Intersection.. - Mielikäinen, Ukkonen (2004) (Correct)
No context found.
R. G. Downey, and M. R. Fellows. Fixed-parameter tractability and completeness I: basic results. SIAM Journal on Computing 24 (1995) 873--921.
Two Algorithms for General List Matrix Partitions - Feder, Hell, al. (2004) (Correct)
No context found.
R. G. Downey, M. R. Fellows, Fixed-parameter tractability and completeness III: Some structural aspects of the W hierarchy, in: Complexity Theory: Current Research, Cambridge University Press (1993) 191-226.
Two Algorithms for General List Matrix Partitions - Feder, Hell, al. (2004) (Correct)
No context found.
R. G. Downey, M. R. Fellows, Fixed-parameter tractability and completeness II: On completeness for W [1], Theoretical Computer Science 141 (1995) 109-131.
Two Algorithms for General List Matrix Partitions - Feder, Hell, Kral, Sgall (Correct)
No context found.
R. G. Downey, M. R. Fellows, Fixed-parameter tractability and completeness III: Some structural aspects of the W hierarchy, in: Complexity Theory: Current Research, Cambridge University Press (1993) 191-226.
Two Algorithms for General List Matrix Partitions - Feder, Hell, Kral, Sgall (Correct)
No context found.
R. G. Downey, M. R. Fellows, Fixed-parameter tractability and completeness II: On completeness for W [1], Theoretical Computer Science 141 (1995) 109-131.
Embeddings of k-Connected Graphs of Pathwidth k - Gupta, Nishimura.. (2000) (Correct)
No context found.
R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness. I. Basic results. SIAM Journal on Computing, 24(4):873-921, August 1995.
Geometric Separation and Exact Solutions for the Parameterized .. - Alber, Fiala (2002) (4 citations) (Correct)
No context found.
R. G. Downey and M. R. Fellows. Fixed Parameter Tractability and Completeness II: On completeness for W[1]. Theoret. Comp. Sci., 189:109-131, 1995.
The Complexity of Maximum Matroid-Greedoid Intersection.. - Mielikäinen, Ukkonen (2004) (Correct)
No context found.
R. G. Downey, and M. R. Fellows. Fixed-parameter tractability and completeness I: basic results. SIAM Journal on Computing 24 (1995) 873--921.
The k-Feature Set Problem is W [2]-complete - Cotta, Moscato (2003) (Correct)
No context found.
R. Downey and M. Fellows. Fixed parameter tractability and completeness I: Basic theory. SIAM Journal of Computing, 24:873--921, 1995.
Ubiquitous Parameterization - Invitation to Fixed-Parameter.. - Niedermeier (2004) (Correct)
No context found.
R. G. Downey, M. R. Fellows, E. Prieto-Rodriguez, and F. A. Rosamond. Fixedparameter tractability and completeness V: parametric miniatures. Manuscript, 2003. 16
Parameterized Parallel Complexity - Cesati, Di Ianni (1997) (4 citations) (Correct)
No context found.
Rodney G. Downey and Michael R. Fellows. Fixed-parameter tractability and completeness II: On completeness for W [1]. Theoretical Computer Science, 141, 109--131, 1995.
Parameterized Parallel Complexity - Cesati, Di Ianni (1997) (4 citations) (Correct)
No context found.
Rodney G. Downey and Michael R. Fellows. Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput., 873--921, 1995.
Parameterized Parallel Complexity - Cesati, Di Ianni (1997) (4 citations) (Correct)
No context found.
Rodney G. Downey and Michael R. Fellows. Fixed-parameter tractability and completeness. Congressus Numerantium, 87, 161--178, 1992.
On the Algorithmic Tractability of Single Nucleotide.. - Wernicke (2003) (Correct)
No context found.
K. A. Abrahamson, R. G. Downey, and M. R. Fellows. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogs. Annals of Pure and Applied Logic, 73:235-276, 1995
A Tractability Result for Reasoning with Incomplete.. - Department Of Computer (Correct)
No context found.
R.G. Downey and M.R. Fellows. Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing, 24(4):873--921, 1995.
A Tractability Result for Reasoning with Incomplete.. - Department Of Computer (Correct)
No context found.
R.G. Downey and M.R. Fellows. Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing, 24(4):873--921, 1995.
Fast Fixed-Parameter Tractable Algorithms for.. - Nishimura, Ragde.. (2003) (2 citations) (Correct)
No context found.
Rodney G. Downey and Michael R. Fellows. Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput., 24:873--921, 1995.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC