The DOI matches its Crossref record.
On Spectral Graph Drawing
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
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
Levy, B. (2006) · IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06) · doi:10.1109/smi.2006.21 · Cited by 422
Social Network Analysis and Mining for Business Applications
Bonchi, F., Castillo, C., Gionis, A., & Jaimes, A. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961194 · Cited by 359
Fundamentals of spherical parameterization for 3D meshes
Gotsman, C., Gu, X., & Sheffer, A. (2003) · ACM SIGGRAPH 2003 Papers · doi:10.1145/1201775.882276 · Cited by 267
Mesh parameterization: theory and practice
Hormann, K., Polthier, K., & Sheffer, A. (2008) · ACM SIGGRAPH ASIA 2008 courses · doi:10.1145/1508044.1508091 · Cited by 259
Combining hierarchy and energy for drawing directed graphs
Carmel, L., Harel, D., & Koren, Y. (2004) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2004.1260757 · Cited by 34
Self-citation
Metadata
- Authors
- Koren, Y.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2003
- Pages
- 496-508
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1530948733
- Cited by
- 159
- References
- 0
- FWCI
- 5.18
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On Spectral Graph Drawing. https://app.cochat.ai/papers/10.1007/3-540-45071-8_50
- The paper
- Koren, Y. (2003). On Spectral Graph Drawing. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-45071-8_50
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.