The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Approximating maximum independent sets by excluding subgraphs
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
Cites
(1979) · Cited by 43,841
Bollobás, B. (1985) · Cited by 6,196
Approximating clique is almost NP-complete
Feige, U., Goldwasser, S., Lovasz, L., Safra, S., & Szegedy, M. (2002) · [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science · doi:10.1109/sfcs.1991.185341 · Cited by 396
A still better performance guarantee for approximate graph coloring
Halldórsson, M. M. (1993) · Information Processing Letters · doi:10.1016/0020-0190(93)90246-6 · Cited by 224
Self-citationRamsey numbers and an approximation algorithm for the vertex cover problem
Monien, B., & Speckenmeyer, E. (1985) · Acta Informatica · doi:10.1007/bf00290149 · Cited by 189
Determining the Stability Number of a Graph
Chvátal, V. (1977) · SIAM Journal on Computing · doi:10.1137/0206046 · Cited by 55
Approximating maximum independent sets by excluding subgraphs
Boppana, R. B., & Halldórsson, M. M. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52846-6_74 · Cited by 46
Self-citationSome tools for approximate 3-coloring
Blum, A. L. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89576 · Cited by 37
Cited by
Clique is hard to approximate within n1−ε
Håstad, J. (1999) · Acta Mathematica · doi:10.1007/bf02392825 · Cited by 1,369
Probabilistic checking of proofs: a new characterization of NP
Arora, S., & Safra, S. (1998) · Journal of the ACM · doi:10.1145/273865.273901 · Cited by 1,153
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Combinatorial Auctions: A Survey
de Vries, S., & Vohra, R. V. (2003) · INFORMS Journal on Computing · doi:10.1287/ijoc.15.3.284.16077 · Cited by 985
Metadata
- Authors
- Boppana, R., & Halldórsson, M. M.
- Venue
- BIT
- Published
- 1992-06
- Volume
- 32
- Issue
- 2
- Pages
- 180-196
- ISSN
- 0006-3835 (ISSN-L)
- 1572-9125
- OpenAlex
- W2089247135
- Cited by
- 359
- References
- 8
- FWCI
- 8.84
- 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: Approximating maximum independent sets by excluding subgraphs. https://app.cochat.ai/papers/10.1007/bf01994876
- The paper
- Boppana, R., & Halldórsson, M. M. (1992). Approximating maximum independent sets by excluding subgraphs. BIT. https://doi.org/10.1007/bf01994876
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.