On the public citation graph
A sparse graph almost as good as the complete graph on points inK dimensions
0 signed · 101 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/bf00288933openalex-snapshot
Quad trees a data structure for retrieval on composite keys
inferredcites →https://doi.org/10.1007/bf01553909openalex-snapshot
Approximate minimum weight matching on points ink-dimensional space
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.1109/sfcs.1983.16openalex-snapshot
Fast algorithms for the all nearest neighbors problem
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.1145/10515.10534openalex-snapshot
There is a planar graph almost as good as the complete graph
inferredcites →https://doi.org/10.1145/28395.28402openalex-snapshot
Approximation algorithms for shortest path motion planning
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.2307/2987917openalex-snapshot
Combinatorial Algorithms: Theory and Practice.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.3230240406openalex-snapshot
Spanners in graphs of bounded degree
inferred← citeshttps://doi.org/10.1007/11589440_11openalex-snapshot
I/O-Efficiently Pruning Dense Spanners
inferred← citeshttps://doi.org/10.1007/11602613_7openalex-snapshot
Sparse Geometric Graphs with Small Dilation
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_28openalex-snapshot
Improved Greedy Algorithms for Constructing Sparse Geometric Spanners
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_24openalex-snapshot
Constructing Plane Spanners of Bounded Degree and Low Weight
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_20openalex-snapshot
New Results on Fault Tolerant Geometric Spanners
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_65openalex-snapshot
Graph spanners and connectivity
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_230openalex-snapshot
Constructing degree-3 spanners with other sparseness properties
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_14openalex-snapshot
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_17openalex-snapshot
Lightweight Near-Additive Spanners
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_42openalex-snapshot
Fast Pruning of Geometric Spanners
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_15openalex-snapshot
Spanners of Complete k-Partite Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-85209-4_11openalex-snapshot
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range
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-10631-6_23openalex-snapshot
Geodesic Spanners on Polyhedral Surfaces
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/bf01294129openalex-snapshot
Balancing minimum spanning trees and shortest-path trees
inferred← citeshttps://doi.org/10.1007/bf02523237openalex-snapshot
Efficient construction of a bounded-degree spanner with low weight
inferred← citeshttps://doi.org/10.1007/bf02574005openalex-snapshot
Approximating Euclidean distances by small degree graphs
inferred← citeshttps://doi.org/10.1007/bfb0049396openalex-snapshot
Efficient construction of a bounded degree spanner with low weight
inferred← citeshttps://doi.org/10.1007/pl00009390openalex-snapshot
Approximate Nearest Neighbor Queries Revisited
inferred← citeshttps://doi.org/10.1007/s00453-001-0075-xopenalex-snapshot
Improved Algorithms for Constructing Fault-Tolerant Spanners
inferred← citeshttps://doi.org/10.1007/s00453-005-1168-8openalex-snapshot
Constructing Plane Spanners of Bounded Degree and Low Weight
inferred← citeshttps://doi.org/10.1007/s00453-009-9322-3openalex-snapshot
On Bounded Leg Shortest Paths Problems
inferred← citeshttps://doi.org/10.1007/s00453-011-9504-7openalex-snapshot
Fully Dynamic Geometric Spanners
inferred← citeshttps://doi.org/10.1007/s00453-022-00994-0openalex-snapshot
Light Spanners for High Dimensional Norms via Stochastic Decompositions
inferred← citeshttps://doi.org/10.1007/s00454-008-9115-5openalex-snapshot
Small Hop-diameter Sparse Spanners for Doubling Metrics
inferred← citeshttps://doi.org/10.1007/s00454-009-9137-7openalex-snapshot
Region-Fault Tolerant Geometric Spanners
inferred← citeshttps://doi.org/10.1007/s00454-015-9663-4openalex-snapshot
Average Stretch Factor: How Low Does It Go?
inferred← citeshttps://doi.org/10.1007/s00454-021-00282-8openalex-snapshot
Fractal Dimension and Lower Bounds for Geometric Problems
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90133-3openalex-snapshot
Euclidean spanner graphs with degree four
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50006-1openalex-snapshot
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
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.2007.07.004openalex-snapshot
Sparse geometric graphs with small dilation
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.07.007openalex-snapshot
I/O-efficient algorithms for computing planar geometric spanners
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.12.001openalex-snapshot
Computing a minimum-dilation spanning tree is NP-hard
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.02.008openalex-snapshot
Well-separated pair decomposition in linear time?
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00075-6openalex-snapshot
Spanners of de Bruijn and Kautz graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00280-8openalex-snapshot
Lower bounds for computing geometric spanners and approximate shortest paths
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.2013.80openalex-snapshot
A Linear Time Approximation Scheme for Euclidean TSP
inferred← citeshttps://doi.org/10.1109/icmlc.2010.5580811openalex-snapshot
Discrete construction of Voronoi diagrams for cross generators
inferred← citeshttps://doi.org/10.1109/infcom.2009.5061918openalex-snapshot
Near Optimal Multicriteria Spanner Constructions in Wireless Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462284openalex-snapshot
Improved Multi-criteria Spanners for Ad-Hoc Networks Under Energy and Distance Metrics
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/tnet.2010.2053381openalex-snapshot
Near-Optimal Multicriteria Spanner Constructions in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1137/050635675openalex-snapshot
Improving the Stretch Factor of a Geometric Network by Edge Augmentation
inferred← citeshttps://doi.org/10.1137/070707130openalex-snapshot
Spanners of Complete k -Partite Geometric Graphs
inferred← citeshttps://doi.org/10.1137/090758039openalex-snapshot
Fault Tolerant Spanners for General Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611973105.57openalex-snapshot
Euclidean Spanners in High Dimensions
inferred← citeshttps://doi.org/10.1137/23m1589670openalex-snapshot
A Unified Framework of Light Spanners I: Fast (Yet Optimal) Constructions
inferred← citeshttps://doi.org/10.1137/s0097539700382947openalex-snapshot
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
inferred← citeshttps://doi.org/10.1137/s0895480194266628openalex-snapshot
Spanners of Hypercube-Derived Networks
inferred← citeshttps://doi.org/10.1142/s0129054109006486openalex-snapshot
ON SPANNERS OF GEOMETRIC GRAPHS
inferred← citeshttps://doi.org/10.1142/s0218195999000194openalex-snapshot
MIXED SPANNING TREES IN THEORY AND PRACTICE
inferred← citeshttps://doi.org/10.1145/1064092.1064143openalex-snapshot
Finding the best shortcut in a geometric network
inferred← citeshttps://doi.org/10.1145/1247069.1247134openalex-snapshot
Fully dynamic geometric spanners
inferred← citeshttps://doi.org/10.1145/142675.142716openalex-snapshot
On Euclidean spanner graphs with small degree
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.1145/1536414.1536475openalex-snapshot
Fault-tolerant spanners for general graphs
inferred← citeshttps://doi.org/10.1145/177424.177579openalex-snapshot
A fast algorithm for constructing sparse Euclidean spanners
inferred← citeshttps://doi.org/10.1145/1807048.1807054openalex-snapshot
Localized spanner construction for ad hoc networks with variable transmission range
inferred← citeshttps://doi.org/10.1145/2489253.2489254openalex-snapshot
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
inferred← citeshttps://doi.org/10.1145/2591796.2591864openalex-snapshot
From hierarchical partitions to hierarchical covers
inferred← citeshttps://doi.org/10.1145/262839.263001openalex-snapshot
Approximate nearest neighbor queries revisited
inferred← citeshttps://doi.org/10.1145/276698.276734openalex-snapshot
Efficient algorithms for constructing fault-tolerant geometric spanners
inferred← citeshttps://doi.org/10.1145/2915183openalex-snapshot
On Hierarchical Routing in Doubling Metrics
inferred← citeshttps://doi.org/10.1556/comec.1.2000.1.7openalex-snapshot
On plexus representation of dissimilarities
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.21openalex-snapshot
Efficient Construction of Spanners in $d$-Dimensions
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.1305.4170openalex-snapshot
Average Stretch Factor: How Low Does It Go?
inferred← citeshttps://doi.org/10.48550/arxiv.2106.15596openalex-snapshot
Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702080openalex-snapshot
Sparse geometric graphs with small dilation
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0703023openalex-snapshot
Computing a Minimum-Dilation Spanning Tree is NP-hard
inferred← citeshttps://doi.org/10.5555/1109557.1109566openalex-snapshot
Small hop-diameter sparse spanners for doubling metrics
inferred← citeshttps://doi.org/10.5555/1283383.1283384openalex-snapshot
Region-fault tolerant geometric spanners
inferred← citeshttps://doi.org/10.5555/1283383.1283466openalex-snapshot
On bounded leg shortest paths problems
inferred← citeshttps://doi.org/10.5555/313559.313760openalex-snapshot
Balancing minimum spanning and shortest path trees
inferred← citeshttps://doi.org/10.5555/313559.313777openalex-snapshot
Faster algorithms for some geometric graph problems in higher dimensions
inferred← citeshttps://doi.org/10.5860/choice.42-1619aopenalex-snapshot
Spanning trees and optimization problems
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.