The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
The Dense k -Subgraph Problem
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
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,359
A Survey of Matrix Theory and Matrix Inequalities
H., A. S., Marcus, M., & Minc, H. (1965) · Mathematics of Computation · doi:10.2307/2004116 · Cited by 1,405
A Fast Parametric Maximum Flow Algorithm and Applications
Gallo, G., Grigoriadis, M. D., & Tarjan, R. E. (1989) · SIAM Journal on Computing · doi:10.1137/0218003 · Cited by 427
Leighton, T., & Rao, S. (1988) · [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21958 · Cited by 395
Polynomial time approximation schemes for dense instances of NP-hard problems
Arora, S., Karger, D., & Karpinski, M. (1995) · Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 · doi:10.1145/225058.225140 · Cited by 199
Approximation algorithms for maximum dispersion
Hassin, R., Rubinstein, S., & Tamir, A. (1997) · Operations Research Letters · doi:10.1016/s0167-6377(97)00034-5 · Cited by 186
Alon, N., Feige, U., Wigderson, A., & Zuckerman, D. (1995) · Computational Complexity · doi:10.1007/bf01277956 · Cited by 152
Self-citation
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
A model of Internet topology using k-shell decomposition
Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y., & Shir, E. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0701175104 · Cited by 760
Relations between average case complexity and approximation complexity
Feige, U. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509985 · Cited by 351
Self-citationA review on algorithms for maximum clique problems
Wu, Q., & Hao, J.-K. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2014.09.064 · Cited by 314
Metadata
- Authors
- Feige, U., Peleg, D., & Kortsarz, G.
- Venue
- Algorithmica
- Published
- 2001-03
- Volume
- 29
- Issue
- 3
- Pages
- 410-421
- ISSN
- 0178-4617 (ISSN-L)
- 1432-0541
- OpenAlex
- W2036836182
- Cited by
- 592
- References
- 7
- FWCI
- 11.26
- 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: The Dense k -Subgraph Problem. https://app.cochat.ai/papers/10.1007/s004530010050
- The paper
- Feige, U., Peleg, D., & Kortsarz, G. (2001). The Dense k -Subgraph Problem. Algorithmica. https://doi.org/10.1007/s004530010050
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.
