Fixed-Parameter Tractability and Completeness I: Basic Results
- 1 August 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (4), 873-921
- https://doi.org/10.1137/s0097539792228228
Abstract
No abstract availableThis publication has 60 references indexed in Scilit:
- Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analoguesAnnals of Pure and Applied Logic, 1995
- Chapter 8 Algorithmic implications of the graph minor theoremPublished by Elsevier ,1995
- Finite automata, bounded treewidth and well-quasiorderingContemporary Mathematics, 1993
- Structural Complexity IIPublished by Springer Nature ,1990
- On the Complexity of Covering Vertices by Faces in a Planar GraphSIAM Journal on Computing, 1988
- Problems easy for tree-decomposable graphs extended abstractLecture Notes in Computer Science, 1988
- Linear-time computation of optimal subgraphs of decomposable graphsJournal of Algorithms, 1987
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Structure preserving reductions among convex optimization problemsJournal of Computer and System Sciences, 1980