On the public citation graph
Efficient construction of a bounded-degree spanner with low weight
0 signed · 87 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.1006/jagm.1995.1048openalex-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/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/s0129054196000105openalex-snapshot
CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES
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.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.1007/11682462_29openalex-snapshot
Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_38openalex-snapshot
Efficient Construction of Low Weight Bounded Degree Planar Spanner
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-030-26176-4_4openalex-snapshot
Geodesic Fault-Tolerant Additive Weighted Spanners
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_32openalex-snapshot
Vertex Fault-Tolerant Spanners for Weighted Points in Polygonal Domains
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/978-3-642-10631-6_23openalex-snapshot
Geodesic Spanners on Polyhedral Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_6openalex-snapshot
The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_5openalex-snapshot
Balancing Degree, Diameter and Weight in Euclidean Spanners
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/s004460100054openalex-snapshot
Sparse communication networks and efficient routing in the plane
inferred← citeshttps://doi.org/10.1007/s00454-009-9230-yopenalex-snapshot
Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
inferred← citeshttps://doi.org/10.1007/s10878-025-01345-9openalex-snapshot
A divide-and-conquer based preprocessing for routing in a simple polygon
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50021-8openalex-snapshot
Closest-Point Problems in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.10.001openalex-snapshot
Deformable spanners and applications
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.1016/j.ejc.2024.103927openalex-snapshot
Minimum weight Euclidean (1+ɛ) -spanners
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00014-0openalex-snapshot
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
inferred← citeshttps://doi.org/10.1109/focs.2008.24openalex-snapshot
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
inferred← citeshttps://doi.org/10.1109/focs.2019.00069openalex-snapshot
Truly Optimal Euclidean Spanners
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/tmc.2008.158openalex-snapshot
Topology Management in Directional Antenna-Equipped Ad Hoc Networks
inferred← citeshttps://doi.org/10.1137/120901295openalex-snapshot
Balancing Degree, Diameter, and Weight in Euclidean Spanners
inferred← citeshttps://doi.org/10.1137/22m1502707openalex-snapshot
Euclidean Steiner Spanners: Light and Sparse
inferred← citeshttps://doi.org/10.1137/s0097539703435297openalex-snapshot
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
inferred← citeshttps://doi.org/10.1142/s0129054123500119openalex-snapshot
A Simple and Efficient Method for Accelerating Construction of the Gap-Greedy Spanner
inferred← citeshttps://doi.org/10.1142/s0218195901000511openalex-snapshot
ON ENUMERATING AND SELECTING DISTANCES
inferred← citeshttps://doi.org/10.1142/s0218195904001366openalex-snapshot
EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
inferred← citeshttps://doi.org/10.1142/s021819592250008xopenalex-snapshot
Vertex Fault-Tolerant Geometric Spanners for Weighted Points
inferred← citeshttps://doi.org/10.1142/s1793830922500744openalex-snapshot
Vertex fault-tolerant spanners for weighted points in polygonal domains
inferred← citeshttps://doi.org/10.1145/2483699.2483708openalex-snapshot
Sparse Euclidean Spanners with Tiny Diameter
inferred← citeshttps://doi.org/10.1145/2582112.2582140openalex-snapshot
Light spanners for Snowflake Metrics
inferred← citeshttps://doi.org/10.1145/276884.276916openalex-snapshot
On enumerating and selecting distances
inferred← citeshttps://doi.org/10.1145/3519270.3538414openalex-snapshot
Can't See the Forest for the Trees
inferred← citeshttps://doi.org/10.1145/564585.564602openalex-snapshot
Topology control and routing in ad hoc networks
inferred← citeshttps://doi.org/10.1145/777412.777447openalex-snapshot
On local algorithms for topology control and routing in ad hoc networks
inferred← citeshttps://doi.org/10.1145/777792.777794openalex-snapshot
Fault-tolerant geometric spanners
inferred← citeshttps://doi.org/10.1145/997817.997848openalex-snapshot
Deformable spanners and applications
inferred← citeshttps://doi.org/10.20382/jocg.v3i1a1openalex-snapshot
The emergence of sparse spanners and well-separated pair decomposition under anarchy
inferred← citeshttps://doi.org/10.22215/etd/2021-14513openalex-snapshot
Geometric Spanners For Compact Regions
inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.15openalex-snapshot
Light Euclidean Steiner Spanners in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.0801.3581openalex-snapshot
Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners
inferred← citeshttps://doi.org/10.48550/arxiv.1005.4155openalex-snapshot
An Optimal-Time Construction of Euclidean Sparse Spanners with Tiny Diameter
inferred← citeshttps://doi.org/10.48550/arxiv.1108.6022openalex-snapshot
Balancing Degree, Diameter and Weight in Euclidean Spanners
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1831openalex-snapshot
Optimal Euclidean spanners: really short, thin and lanky
inferred← citeshttps://doi.org/10.48550/arxiv.1304.8135openalex-snapshot
From Hierarchical Partitions to Hierarchical Covers: Optimal Fault-Tolerant Spanners for Doubling Metrics
inferred← citeshttps://doi.org/10.48550/arxiv.1401.5014openalex-snapshot
Light spanners for snowflake metrics
inferred← citeshttps://doi.org/10.48550/arxiv.1904.12042openalex-snapshot
Truly Optimal Euclidean Spanners
inferred← citeshttps://doi.org/10.48550/arxiv.2107.14221openalex-snapshot
Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners
inferred← citeshttps://doi.org/10.48550/arxiv.2111.13748openalex-snapshot
A Unified Framework of Light Spanners II: Fine-Grained Optimality
inferred← citeshttps://doi.org/10.5555/2133036.2133101openalex-snapshot
An optimal-time construction of sparse Euclidean spanners with tiny diameter
inferred← citeshttps://doi.org/10.5555/545381.545489openalex-snapshot
Approximate distance oracles for geometric graphs
inferred← citeshttps://doi.org/10.5555/644108.644242openalex-snapshot
Sublinear-time approximation of Euclidean minimum spanning tree
inferred← citeshttps://doi.org/10.7936/k7rr1wjzopenalex-snapshot
Spatiotemporal Multicast and Partitionable Group Membership Service
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.