On the public citation graph

Efficient construction of a bounded degree spanner with low weight

https://doi.org/10.1007/bfb0049396
0 signed · 34 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-57155-8_254openalex-snapshot
Static and dynamic algorithms for k-point clustering problems
inferredcites →https://doi.org/10.1007/3-540-57568-5_230openalex-snapshot
Constructing degree-3 spanners with other sparseness properties
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf01840386openalex-snapshot
Dynamic fractional cascading
inferredcites →https://doi.org/10.1007/bf02187852openalex-snapshot
Maintaining the minimal distance of a point set in polylogarithmic time
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.1109/sfcs.1992.267752openalex-snapshot
Enumerating the k closest pairs optimally
inferredcites →https://doi.org/10.1137/0211059openalex-snapshot
On Constructing Minimum Spanning Trees in k -Dimensional Spaces and Related Problems
inferredcites →https://doi.org/10.1142/s0218195991000098openalex-snapshot
CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
inferredcites →https://doi.org/10.1142/s0218195992000044openalex-snapshot
ENUMERATING INTERDISTANCES IN SPACE
inferredcites →https://doi.org/10.1142/s0218195992000147openalex-snapshot
SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
inferredcites →https://doi.org/10.1145/142675.142716openalex-snapshot
On Euclidean spanner graphs with small degree
inferredcites →https://doi.org/10.1145/142675.142717openalex-snapshot
New sparseness results on graph spanners
inferredcites →https://doi.org/10.1145/160985.160998openalex-snapshot
Optimally sparse spanners in 3-dimensional Euclidean space
inferredcites →https://doi.org/10.1145/177424.177579openalex-snapshot
A fast algorithm for constructing sparse Euclidean spanners
inferredcites →https://doi.org/10.1145/225058.225191openalex-snapshot
Euclidean spanners
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.5555/313651.313697openalex-snapshot
A new way to weigh Malnourished Euclidean graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/wcm.107openalex-snapshot
Algorithmic, geometric and graphs issues in wireless networks
inferred← citeshttps://doi.org/10.1007/978-0-387-49592-7_5openalex-snapshot
Topology Control for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-1-4613-0223-0_7openalex-snapshot
Applications of Computational Geometry in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_22openalex-snapshot
A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs
inferred← citeshttps://doi.org/10.1007/s00454-004-1121-7openalex-snapshot
Fault-Tolerant Geometric Spanners
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00013openalex-snapshot
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier
inferred← citeshttps://doi.org/10.1109/hicss.2002.994518openalex-snapshot
Sparse power efficient topology for wireless networks
inferred← citeshttps://doi.org/10.1109/sahcn.2006.288499openalex-snapshot
Topology Control to Simultaneously Achieve Near-Optimal Node Degree and Low Path Stretch in Ad hoc Networks
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365722openalex-snapshot
Randomized and deterministic algorithms for geometric spanners of small diameter
inferred← citeshttps://doi.org/10.1109/tmc.2008.158openalex-snapshot
Topology Management in Directional Antenna-Equipped Ad Hoc Networks
inferred← citeshttps://doi.org/10.1145/225058.225191openalex-snapshot
Euclidean spanners
inferred← citeshttps://doi.org/10.1145/2488608.2488691openalex-snapshot
Optimal euclidean spanners
inferred← citeshttps://doi.org/10.1145/2591796.2591864openalex-snapshot
From hierarchical partitions to hierarchical covers
inferred← citeshttps://doi.org/10.1201/9780203489635.ch39openalex-snapshot
Wireless Sensor Networks and Computational Geometry
inferred← citeshttps://doi.org/10.22215/etd/2021-14513openalex-snapshot
Geometric Spanners For Compact Regions
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.