The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Combinatorial Algorithms: 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings
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
Upper Domination: Complexity and Approximation
Bazgan, C., Branković, L., Casel, K., Fernau, H., Jansen, K., Klein, K.-M., Lampis, M., Liedloff, M., Monnot, J., & Paschos, V. T. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-44543-4_19 · Cited by 8
Bounded Embeddings of Graphs in the Plane
Fulek, R. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-44543-4_3 · Cited by 6
Weighted Online Problems with Advice
Boyar, J., Favrholdt, L. M., Kudahl, C., et al. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-44543-4_14 · Cited by 5
Essential Constraints of Edge-Constrained Proximity Graphs
Bose, P. K., Carufel, J.-L. D., Shaikhet, A., & Smid, M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-44543-4_5 · Cited by 4
Cited by
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Approximate counting, uniform generation and rapidly mixing Markov chains
Sinclair, A., & Jerrum, M. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90067-9 · Cited by 735
Extendible hashing—a fast access method for dynamic files
Fagin, R., Nievergelt, J., Pippenger, N., & Strong, H. R. (1979) · ACM Transactions on Database Systems · doi:10.1145/320083.320092 · Cited by 659
Bunch: a clustering tool for the recovery and maintenance of software system structures
Mancoridis, S., Mitchell, B. S., Chen, Y., & Gansner, E. R. (1999) · Proceedings IEEE International Conference on Software Maintenance - 1999 (ICSM'99). 'Software Maintenance for Business Change' (Cat. No.99CB36360) · doi:10.1109/icsm.1999.792498 · Cited by 508
Using automatic clustering to produce high-level system organizations of source code
Mancoridis, S., Mitchell, B. S., Rorres, C., Chen, Y., & Gansner, E. R. (2002) · Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242) · doi:10.1109/wpc.1998.693283 · Cited by 484
Metadata
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2016
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W3158027121
- Cited by
- 917
- References
- 4
- FWCI
- 18.25
- Type
- conference paper
- 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
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.