The DOI matches its Crossref record.
The LEDA platform for combinatorial and geometric computing
Open accessAbstract
Combinatorial and geometric computing is a core area of computer science (CS). In fact, most CS curricula contain a course in data structures and algorithms. The area deals with objects such as graphs, sequences, dictionaries, trees, shortest paths, flows, matchings, points, segments, lines, convex hulls, and Voronoi diagrams and forms the basis for application areas such as discrete optimization, scheduling, traffic control, CAD, and graphics. There is no standard library of the data structures and algorithms of combinatorial and geometric computing. This is in sharp contrast to many other areas of computing. There are, for example, packages in statistics (SPSS), numerical analysis (LINPACK, EISPACK), symbolic computation (MAPLE, MATHEMATICA), and linear programming (CPLEX).
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
Cited by
A faster algorithm for betweenness centrality*
Brandes, U. (2001) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.2001.9990249 · Cited by 4,936
Integrated Genomic and Proteomic Analyses of a Systematically Perturbed Metabolic Network
Ideker, T., Thorsson, V., Ranish, J. A., Christmas, R., Buhler, J., Eng, J. K., Bumgarner, R., Goodlett, D. R., Aebersold, R., & Hood, L. (2001) · Science · doi:10.1126/science.292.5518.929 · Cited by 2,050
A barcode shape descriptor for curve point cloud data
Collins, A., Zomorodian, A., Carlsson, G., & Guibas, L. J. (2004) · Computers & Graphics · doi:10.1016/j.cag.2004.08.015 · Cited by 132
Resource Constrained Shortest Paths
Mehlhorn, K., & Ziegelmann, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45253-2_30 · Cited by 124
Self-citationGirisha, M. N., Badiger, V. P., & Pattar, S. (2022) · Network Modeling Analysis in Health Informatics and Bioinformatics · doi:10.1007/s13721-022-00353-7 · Cited by 4
Metadata
- Authors
- Mehlhorn, K., Näher, S., & Uhrig, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1997
- Volume
- 38
- Issue
- 1
- Pages
- 7-16
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W136556473
- Cited by
- 1,199
- References
- 0
- FWCI
- 19.64
- Type
- conference paper
- 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: The LEDA platform for combinatorial and geometric computing. https://app.cochat.ai/papers/10.1007/3-540-63165-8_161
- The paper
- Mehlhorn, K., Näher, S., & Uhrig, C. (1997). The LEDA platform for combinatorial and geometric computing. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-63165-8_161
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.
