The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Call routing and the ratcatcher
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Some simplified NP-complete graph problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90059-1 · Cited by 2,059
Graph minors. X. Obstructions to tree-decomposition
Robertson, N., & Seymour, P. D. (1991) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(91)90061-n · Cited by 658
Self-citationSome simplified NP-complete problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1974) · Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74 · doi:10.1145/800119.803884 · Cited by 614
Cited by
Invitation to Fixed-Parameter Algorithms
Niedermeier, R. (2006) · doi:10.1093/acprof:oso/9780198566076.001.0001 · Cited by 1,668
A survey of graph layout problems
Díaz, J., Petit, J., & Serna, M. (2002) · ACM Computing Surveys · doi:10.1145/568522.568523 · Cited by 599
PARAMETERIZED COMPLEXITY THEORY
Niedermeier, R. (2006) · Invitation to Fixed-Parameter Algorithms · doi:10.1093/acprof:oso/9780198566076.003.0013 · Cited by 574
Treewidth: Algorithmic techniques and results
Bodlaender, H. L. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0029946 · Cited by 289
Tree-Like Structure in Large Social and Information Networks
Adcock, A. B., Sullivan, B. D., & Mahoney, M. W. (2013) · 2013 IEEE 13th International Conference on Data Mining · doi:10.1109/icdm.2013.77 · Cited by 141
Metadata
- Authors
- Seymour, P. D., & Thomas, R.
- Venue
- Combinatorica
- Published
- 1994-06
- Volume
- 14
- Issue
- 2
- Pages
- 217-241
- ISSN
- 0209-9683 (ISSN-L)
- 1439-6912
- OpenAlex
- W2019137761
- Cited by
- 394
- References
- 3
- FWCI
- 2.42
- 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: Call routing and the ratcatcher. https://app.cochat.ai/papers/10.1007/bf01215352
- The paper
- Seymour, P. D., & Thomas, R. (1994). Call routing and the ratcatcher. Combinatorica. https://doi.org/10.1007/bf01215352
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.