The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Unit disk graph recognition is NP-hard
Open accessOverview
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
Cites
(1979) · Cited by 43,841
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Booth, K. S., & Lueker, G. S. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80045-1 · Cited by 1,488
Clark, B. N., Colbourn, C. J., & Johnson, D. S. (1990) · Discrete Mathematics · doi:10.1016/0012-365x(90)90358-o · Cited by 1,429
Frequency assignment: Theory and applications
Hale, W. K. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11899 · Cited by 1,344
Incidence matrices and interval graphs
Fulkerson, D., & Gross, O. (1965) · Pacific Journal of Mathematics · doi:10.2140/pjm.1965.15.835 · Cited by 1,262
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1991) · Operations Research · doi:10.1287/opre.39.3.378 · Cited by 845
Havel, T. F., Kuntz, I. D., & Crippen, G. M. (1983) · Journal of Theoretical Biology · doi:10.1016/0022-5193(83)90112-1 · Cited by 59
On the complexity of recognizing intersection and touching graphs of disks
Breu, H., & Kirkpatrick, D. G. (1996) · Lecture notes in computer science · doi:10.1007/bfb0021793 · Cited by 29
Self-citationA molecular orbital and chemical study of aminoacetonitrile: A possible prebiotic peptide precursor
Loew, G. H., Chadha, M. S., & Chang, S. (1972) · Journal of Theoretical Biology · doi:10.1016/0022-5193(72)90044-6 · Cited by 21
Cited by
Deep learning methods in protein structure prediction
Torrisi, M., Pollastri, G., & Le, Q. (2020) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2019.12.011 · Cited by 284
Metadata
- Authors
- Breu, H., & Kirkpatrick, D. G.
- Venue
- Computational Geometry
- Publisher
- Elsevier BV
- Published
- 1998-01
- Volume
- 9
- Issue
- 1-2
- Pages
- 3-24
- ISSN
- 0925-7721 (ISSN-L)
- OpenAlex
- W1982378203
- Cited by
- 312
- References
- 10
- FWCI
- 4.02
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Unit disk graph recognition is NP-hard. https://app.cochat.ai/papers/10.1016/s0925-7721(97)00014-x
- The paper
- Breu, H., & Kirkpatrick, D. G. (1998). Unit disk graph recognition is NP-hard. Computational Geometry. https://doi.org/10.1016/s0925-7721(97)00014-x
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.