Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 468

The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.

Fixed-Parameter Tractability and Completeness I: Basic Results

Downey, Rod G., Fellows, Michael R.·1995·SIAM Journal on Computing

Abstract

For many fixed-parameter problems that are trivially soluable in polynomial time, such as $(k\text{-})$ DOMINATING SET, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as $(k\text{-})$ FEEDBACK VERTEX SET, exhibit fixed-parameter tractability: for each fixed k the problem is soluable in time bounded by a polynomial of degree c, where c is a constant independent of k. We establish the main results of a completeness program which addresses the apparent fixed-parameter intractability of many parameterized problems. In particular, we define a hierarchy of classes of parameterized problems $FPT \subseteq W[1] \subseteq W[2] \subseteq \cdots \subseteq W[SAT] \subseteq W [P]$ and identify natural complete problems for $W[t]$ for $t \geq 2$. (In other papers we have shown many problems complete for $W[1]$.) DOMINATING SET is shown to be complete for $W[2]$, and thus is not fixed-parameter tractable unless INDEPENDENT SET, CLIQUE, IRREDUNDANT SET, and many other natural problems in $W[2]$ are also fixed-parameter tractable. We also give a compendium of currently known hardness results as an appendix.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/s0097539792228228

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 26 references

Metadata

Authors
Downey, R. G., & Fellows, M. R.
Venue
SIAM Journal on Computing
Published
1995-08
Volume
24
Issue
4
Pages
873-921
ISSN
  • 0097-5397 (ISSN-L)
  • 1095-7111
OpenAlex
W2022841964
Cited by
468
References
26
FWCI
17.85
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Fixed-Parameter Tractability and Completeness I: Basic Results. https://app.cochat.ai/papers/10.1137/s0097539792228228
The paper
Downey, R. G., & Fellows, M. R. (1995). Fixed-Parameter Tractability and Completeness I: Basic Results. SIAM Journal on Computing. https://doi.org/10.1137/s0097539792228228

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.