Fixed-Parameter Tractability, Definability, and Model-Checking
- 1 January 2001
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 31 (1), 113-145
- https://doi.org/10.1137/s0097539799360768
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- On the parameterized complexity of short computation and factorizationArchive for Mathematical Logic, 1997
- On Fixed-Parameter Tractability and Approximability of NP Optimization ProblemsJournal of Computer and System Sciences, 1997
- Linear time computable problems and first-order descriptionsMathematical Structures in Computer Science, 1996
- Fixed-Parameter Tractability and Completeness I: Basic ResultsSIAM Journal on Computing, 1995
- Color-codingJournal of the ACM, 1995
- Approximation Properties of NP Minimization ClassesJournal of Computer and System Sciences, 1995
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995
- Relational queries computable in polynomial timeInformation and Control, 1986