The DOI matches its Crossref record.
Parameterized Complexity
Open accessAbstract
Min Cut Linear Arrangement, Independet Set, Vertex Cover and Dominating Set.The last two problems are de ned
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.
Integrity signals
Registry
Cites
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.
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
Cited by
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
Eppstein, D., Löffler, M., & Strash, D. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17517-6_36 · Cited by 356
The Tractable Cognition Thesis
Van Rooij, I. (2008) · Cognitive Science · doi:10.1080/03640210801897856 · Cited by 285
Bayesian intractability is not an ailment that approximation can cure
Kwisthout, J., Wareham, T., & van Rooij, I. (2011) · Cognitive Science · doi:10.1111/j.1551-6709.2011.01182.x · Cited by 122
Metadata
- Authors
- Fellows, M. R.
- Venue
- Electronic Notes in Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2002-01
- Volume
- 61
- Pages
- 1-19
- ISSN
- 1571-0661 (ISSN-L)
- OpenAlex
- W2913688336
- Cited by
- 2,836
- References
- 0
- FWCI
- 129.38
- Type
- journal article
- Language
- en
- Open access
- diamond
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: Parameterized Complexity. https://app.cochat.ai/papers/10.1016/s1571-0661(04)00301-9
- The paper
- Fellows, M. R. (2002). Parameterized Complexity. Electronic Notes in Theoretical Computer Science. https://doi.org/10.1016/s1571-0661(04)00301-9
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.
