On the public citation graph
Approximating Euclidean distances by small degree graphs
0 signed · 36 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-19487-8_23openalex-snapshot
Approximating the complete Euclidean graph
inferredcites →https://doi.org/10.1007/3-540-51859-2_2openalex-snapshot
There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees
inferredcites →https://doi.org/10.1007/3-540-52846-6_75openalex-snapshot
Generating sparse spanners for weighted graphs
inferredcites →https://doi.org/10.1007/978-1-4757-2016-7openalex-snapshot
Sphere Packings, Lattices and Groups
inferredcites →https://doi.org/10.1007/bf02187718openalex-snapshot
AnO(n logn) algorithm for the all-nearest-neighbors Problem
inferredcites →https://doi.org/10.1007/bf02187801openalex-snapshot
Delaunay graphs are almost as good as complete graphs
inferredcites →https://doi.org/10.1007/bf02187821openalex-snapshot
Classes of graphs which approximate the complete euclidean graph
inferredcites →https://doi.org/10.1007/bf02189308openalex-snapshot
On sparse spanners of weighted graphs
inferredcites →https://doi.org/10.1007/bf02574695openalex-snapshot
A sparse graph almost as good as the complete graph on points inK dimensions
inferredcites →https://doi.org/10.1017/s2040618500033219openalex-snapshot
The Closest Packing of Spherical Caps in n Dimensions
inferredcites →https://doi.org/10.1145/10515.10534openalex-snapshot
There is a planar graph almost as good as the complete graph
inferredcites →https://doi.org/10.1145/109648.109677openalex-snapshot
Construction of multidimensional spanner graphs, with applications to minimum spanning trees
inferredcites →https://doi.org/10.1145/142675.142716openalex-snapshot
On Euclidean spanner graphs with small degree
inferredcites →https://doi.org/10.2307/2323992openalex-snapshot
Sphere Packings, Lattices and Groups.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_8openalex-snapshot
$$\delta $$-Greedy t-spanner
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_35openalex-snapshot
Computing the Greedy Spanner in Near-Quadratic Time
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_40openalex-snapshot
An Optimal Dynamic Spanner for Doubling Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_19openalex-snapshot
The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_29openalex-snapshot
An Optimal Algorithm for Computing Angle-Constrained Spanners
inferred← citeshttps://doi.org/10.1007/bfb0053970openalex-snapshot
On the hardness of approximating spanners
inferred← citeshttps://doi.org/10.1007/s004460100054openalex-snapshot
Sparse communication networks and efficient routing in the plane
inferred← citeshttps://doi.org/10.1007/s00453-001-0021-yopenalex-snapshot
On the Hardness of Approximating Spanners
inferred← citeshttps://doi.org/10.1007/s00453-009-9293-4openalex-snapshot
Computing the Greedy Spanner in Near-Quadratic Time
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90133-3openalex-snapshot
Euclidean spanner graphs with degree four
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102201openalex-snapshot
Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average degrees
inferred← citeshttps://doi.org/10.1016/j.dam.2024.12.003openalex-snapshot
Further acceleration in computing the gap greedy spanner: An empirical approach
inferred← citeshttps://doi.org/10.1109/focs.2013.80openalex-snapshot
A Linear Time Approximation Scheme for Euclidean TSP
inferred← citeshttps://doi.org/10.1137/s0097539794268753openalex-snapshot
Generating Low-Degree 2-Spanners
inferred← citeshttps://doi.org/10.1145/142675.142717openalex-snapshot
New sparseness results on graph spanners
inferred← citeshttps://doi.org/10.1145/1498698.1564499openalex-snapshot
Experimental study of geometric t -spanners
inferred← citeshttps://doi.org/10.18419/opus-2455openalex-snapshot
Hierarchische Graphen zur Wegesuche
inferred← citeshttps://doi.org/10.5555/314464.314648openalex-snapshot
Generating low-degree 2-spanners
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.