The DOI matches its Crossref record; 97 of the 97 references it cites were found in a registry or an index.
Recent Advances in Graph Partitioning
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
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Lanczos, C. (1950) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.045.026 · Cited by 4,391
The university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
Cited by
Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
Liu, X., Angone, A., Shaydulin, R., Safro, I., Alexeev, Y., & Cincio, L. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3140190 · Cited by 78
Self-citationController placement and flow based dynamic management problem towards SDN
Yao, L., Hong, P., Zhang, W., Li, J., & Ni, D. (2015) · 2015 IEEE International Conference on Communication Workshop (ICCW) · doi:10.1109/iccw.2015.7247206 · Cited by 68
Unveiling Scholarly Communities over Knowledge Graphs
Vahdati, S., Palma, G., Nath, R. J., Lange, C., Auer, S., & Vidal, M.-E. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-00066-0_9 · Cited by 16
Metadata
- Authors
- Buluç, A., Meyerhenke, H., Safro, I., Sanders, P., & Schulz, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2016
- Pages
- 117-158
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1910515323
- Cited by
- 482
- References
- 97
- FWCI
- 50.37
- Type
- conference paper
- Language
- en
- Open access
- green
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: Recent Advances in Graph Partitioning. https://app.cochat.ai/papers/10.1007/978-3-319-49487-6_4
- The paper
- Buluç, A., Meyerhenke, H., Safro, I., Sanders, P., & Schulz, C. (2016). Recent Advances in Graph Partitioning. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-49487-6_4
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.