On the public citation graph
Delaunay graphs are almost as good as complete graphs
0 signed · 201 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.1145/10515.10534openalex-snapshot
There is a planar graph almost as good as the complete graph
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/dac.844openalex-snapshot
Efficient Delaunay‐based localized routing for wireless sensor networks
inferred← citeshttps://doi.org/10.1002/net.3230240406openalex-snapshot
Spanners in graphs of bounded degree
inferred← citeshttps://doi.org/10.1007/11561071_48openalex-snapshot
Small Stretch Spanners on Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/11573937_41openalex-snapshot
Dynamic Delaunay Triangulation for Wireless Ad Hoc Network
inferred← citeshttps://doi.org/10.1007/11602613_3openalex-snapshot
Embedding Point Sets into Plane Graphs of Small Dilation
inferred← citeshttps://doi.org/10.1007/11751540_1openalex-snapshot
Upper Bound on Dilation of Triangulations of Cyclic Polygons
inferred← citeshttps://doi.org/10.1007/11940128_19openalex-snapshot
Diamond Triangulations Contain Spanners of Bounded Degree
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/3-540-45749-6_24openalex-snapshot
Constructing Plane Spanners of Bounded Degree and Low Weight
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_42openalex-snapshot
On the Spanning Ratio of Gabriel Graphs and β-skeletons
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_12openalex-snapshot
Online Routing in Triangulations
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-61680-2_79openalex-snapshot
Planar spanners and approximate shortest path queries among obstacles in the plane
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_111openalex-snapshot
Dilation of Geometric Networks
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_294openalex-snapshot
Planar Geometric Spanners
inferred← citeshttps://doi.org/10.1007/978-0-387-48945-2_11openalex-snapshot
Overlay Networks for Wireless ad hoc 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-4419-7997-1_41openalex-snapshot
Geometric Optimization in Wireless 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-1-4614-0110-0_17openalex-snapshot
Plane Geometric Graph Augmentation: A Generic Perspective
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_111openalex-snapshot
Dilation of Geometric Networks
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_294openalex-snapshot
Planar Geometric Spanners
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_11openalex-snapshot
Plane Hop Spanners for Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-36412-0_38openalex-snapshot
Improved Stretch Factor of Delaunay Triangulations of Points in Convex Position
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_25openalex-snapshot
Drawing Graphs as Spanners
inferred← citeshttps://doi.org/10.1007/978-3-031-74580-5_11openalex-snapshot
The Exact Spanning Ratio of the Parallelogram Delaunay Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_9openalex-snapshot
Competitive Online Routing on Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-319-29221-2_12openalex-snapshot
Lower Bounds on the Dilation of Plane Spanners
inferred← citeshttps://doi.org/10.1007/978-3-319-48517-1_25openalex-snapshot
Constrained Generalized Delaunay Graphs are Plane Spanners
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_18openalex-snapshot
Local Routing in Spanners Based on WSPDs
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_33openalex-snapshot
Spanners of Additively Weighted Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_16openalex-snapshot
Light Orthogonal Networks with Constant Geometric Dilation
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_29openalex-snapshot
On Generalized Diamond Spanners
inferred← citeshttps://doi.org/10.1007/978-3-540-74823-6_2openalex-snapshot
Topology Control and Geographic Routing in Realistic Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_54openalex-snapshot
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_23openalex-snapshot
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_58openalex-snapshot
On the Stretch Factor of Convex Delaunay Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92666-5_2openalex-snapshot
Paving the Way Towards Reactive Planar Spanner Construction in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_8openalex-snapshot
On Spanners of Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-16007-3_2openalex-snapshot
Approximate Shortest Path Queries Using Voronoi Duals
inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_25openalex-snapshot
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-19056-8_14openalex-snapshot
k th Order Geometric Spanners for Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_18openalex-snapshot
Generalizing Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_111-2openalex-snapshot
Dilation of Geometric Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-38221-5_17openalex-snapshot
An Algorithm for Maximum Common Subgraph of Planar Triangulation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_18openalex-snapshot
Upper and Lower Bounds for Online Routing on Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_19openalex-snapshot
Improved Spanning Ratio for Low Degree Plane Spanners
inferred← citeshttps://doi.org/10.1007/978-981-97-7798-3_22openalex-snapshot
Revisiting the Stretch Factor of Delaunay Triangulations of Points in Convex Position
inferred← citeshttps://doi.org/10.1007/bf02574005openalex-snapshot
Approximating Euclidean distances by small degree graphs
inferred← citeshttps://doi.org/10.1007/bf02574695openalex-snapshot
A sparse graph almost as good as the complete graph on points inK dimensions
inferred← citeshttps://doi.org/10.1007/bf03321771openalex-snapshot
Bounds for the CRDT Conformal Mapping Algorithm
inferred← citeshttps://doi.org/10.1007/bfb0113278openalex-snapshot
Application of the delaunay triangulation to geometric intersection problems
inferred← citeshttps://doi.org/10.1007/s00373-023-02632-0openalex-snapshot
Emanation Graph: A Plane Geometric Spanner with Steiner Points
inferred← citeshttps://doi.org/10.1007/s00453-001-0021-yopenalex-snapshot
On the Hardness of Approximating 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-008-9216-9openalex-snapshot
Graph Spanners in the Streaming Model: An Experimental Study
inferred← citeshttps://doi.org/10.1007/s00453-017-0305-5openalex-snapshot
Improved Spanning Ratio for Low Degree Plane Spanners
inferred← citeshttps://doi.org/10.1007/s00453-022-00930-2openalex-snapshot
Local Routing in Sparse and Lightweight Geometric Graphs
inferred← citeshttps://doi.org/10.1007/s00453-025-01308-wopenalex-snapshot
The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
inferred← citeshttps://doi.org/10.1007/s00454-016-9842-yopenalex-snapshot
Upper and Lower Bounds for Online Routing on Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-022-00398-5openalex-snapshot
Drawing Graphs as Spanners
inferred← citeshttps://doi.org/10.1007/s00454-023-00499-9openalex-snapshot
Improved Routing on the Delaunay Triangulation
inferred← citeshttps://doi.org/10.1007/s10558-009-9091-2openalex-snapshot
Automatic Left Ventricular Contour Extraction from Cardiac Magnetic Resonance Images Using Cantilever Beam and Random Walk Approach
inferred← citeshttps://doi.org/10.1007/s10732-014-9237-2openalex-snapshot
Approximated algorithms for the minimum dilation triangulation problem
inferred← citeshttps://doi.org/10.1007/s10878-022-00940-4openalex-snapshot
Improved stretch factor of Delaunay triangulations of points in convex position
inferred← citeshttps://doi.org/10.1007/s10898-017-0517-xopenalex-snapshot
An exact algorithm for the minimum dilation triangulation problem
inferred← citeshttps://doi.org/10.1007/s11036-005-4447-3openalex-snapshot
Localized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/s11036-006-4469-5openalex-snapshot
Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/s11276-007-0078-xopenalex-snapshot
Single-step creation of localized Delaunay triangulations
inferred← citeshttps://doi.org/10.1007/s11277-017-4322-0openalex-snapshot
Dynamic Node Deployment and Cross Layer Opportunistic Robust Routing for PoI Coverage Using WSNs
inferred← citeshttps://doi.org/10.1007/s12652-016-0351-xopenalex-snapshot
Analysis and visualization of meteorological emergencies
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00104-9openalex-snapshot
Constructing sparse spanners for most graphs in higher dimensions
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90073-6openalex-snapshot
NP-completeness of minimum spanner 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.cagd.2006.07.001openalex-snapshot
Cycle bases of graphs and sampled manifolds
inferred← citeshttps://doi.org/10.1016/j.cagd.2021.102039openalex-snapshot
Affine invariant triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.06.004openalex-snapshot
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.05.005openalex-snapshot
On the stabbing number of a random Delaunay triangulation
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.09.007openalex-snapshot
On the stretch factor of Delaunay triangulations of points in convex position
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.09.009openalex-snapshot
Almost all Delaunay triangulations have stretch factor greater than π/2
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.04.006openalex-snapshot
Some properties of k-Delaunay and k-Gabriel graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.04.002openalex-snapshot
On plane geometric spanners: A survey and open problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.10.005openalex-snapshot
Tight stretch factors for L1 - and L∞ -Delaunay triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2018.06.006openalex-snapshot
Constrained generalized Delaunay graphs are plane spanners
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101622openalex-snapshot
Plane hop spanners for unit disk graphs: Simpler and better
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101808openalex-snapshot
Sparse hop spanners for unit disk graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2024.102121openalex-snapshot
Routing on heavy path WSPD spanners
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.05.013openalex-snapshot
10-Gabriel graphs are Hamiltonian
inferred← citeshttps://doi.org/10.1016/j.jda.2008.07.007openalex-snapshot
Light orthogonal networks with constant geometric dilation
inferred← citeshttps://doi.org/10.1016/j.jda.2011.03.001openalex-snapshot
Spanners of additively weighted point sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.05.019openalex-snapshot
Competitive online routing in geometric graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.04.022openalex-snapshot
Small stretch (α,β) -spanners in the streaming model
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.034openalex-snapshot
Approximation of minimum weight spanners for sparse graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00074-4openalex-snapshot
Spanners of underlying graphs of iterated line digraphs
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)00226-2openalex-snapshot
Tree spanners in planar graphs
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00055-4openalex-snapshot
Beta-skeletons have unbounded dilation
inferred← citeshttps://doi.org/10.1017/apr.2018.3openalex-snapshot
Stretch factor in a planar Poisson–Delaunay triangulation with a large intensity
inferred← citeshttps://doi.org/10.1080/15427951.2008.10129164openalex-snapshot
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
inferred← citeshttps://doi.org/10.1109/38.124289openalex-snapshot
An intersection algorithm based on Delaunay triangulation
inferred← citeshttps://doi.org/10.1109/case59546.2024.10711491openalex-snapshot
A Distributed Online Heuristic for a Large-scale Workforce Task Assignment and Multi-vehicle Routing Problem
inferred← citeshttps://doi.org/10.1109/hpcc.2008.41openalex-snapshot
A Radius Geocast Routing Protocol
inferred← citeshttps://doi.org/10.1109/icact.2006.206022openalex-snapshot
Optimal coverage deployment for wireless sensor networks
inferred← citeshttps://doi.org/10.1109/icc.2002.997421openalex-snapshot
Coverage in wireless ad-hoc sensor networks
inferred← citeshttps://doi.org/10.1109/icc.2003.1204216openalex-snapshot
Localized routing for wireless ad hoc networks
inferred← citeshttps://doi.org/10.1109/iccitechnology.2013.6579526openalex-snapshot
Geometric spanners: Recent results and open directions
inferred← citeshttps://doi.org/10.1109/iccke50421.2020.9303695openalex-snapshot
A new memoryless online routing algorithm for Delaunay triangulations
inferred← citeshttps://doi.org/10.1109/icdcs.2007.130openalex-snapshot
Protocol Design for Dynamic Delaunay Triangulation
inferred← citeshttps://doi.org/10.1109/icdcsw.2003.1203633openalex-snapshot
Efficient localized routing for wireless ad hoc networks
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00355openalex-snapshot
Reconsidering Tree based Methods for k-Maximum Inner-Product Search: The LRUS-CoverTree
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019377openalex-snapshot
Distributed construction of a planar spanner and routing for ad hoc wireless networks
inferred← citeshttps://doi.org/10.1109/infcom.2005.1497885openalex-snapshot
Spatial energy balancing in large-scale wireless multihop networks
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10228941openalex-snapshot
Prophet: An Efficient Feature Indexing Mechanism for Similarity Data Sharing at Network Edge
inferred← citeshttps://doi.org/10.1109/isvd.2006.28openalex-snapshot
On the Stretch Factor of the Constrained Delaunay Triangulation
inferred← citeshttps://doi.org/10.1109/isvd.2009.30openalex-snapshot
Approximate Shortest Path Queries in Graphs Using Voronoi Duals
inferred← citeshttps://doi.org/10.1109/jsac.2004.837364openalex-snapshot
Geometric spanners for routing in mobile networks
inferred← citeshttps://doi.org/10.1109/lcomm.2010.03.092045openalex-snapshot
On the necessity of using Delaunay Triangulation substrate in greedy routing based networks
inferred← citeshttps://doi.org/10.1109/mass.2012.6502544openalex-snapshot
On the spanning ratio of partial Delaunay triangulation
inferred← citeshttps://doi.org/10.1109/nabic.2009.5393806openalex-snapshot
Effect of β in random walk approach for LV contour extraction
inferred← citeshttps://doi.org/10.1109/percomw.2011.5766938openalex-snapshot
P2P network for storage and query of a spatio-temporal flow of events
inferred← citeshttps://doi.org/10.1109/sitis.2014.25openalex-snapshot
Identification of Spatio-Temporal Outliers through Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1109/sutc.2006.1636200openalex-snapshot
Node Placement for Optimal Coverage in Sensor Networks
inferred← citeshttps://doi.org/10.1109/sutc.2006.97openalex-snapshot
Node placement for optimal coverage in sensor networks
inferred← citeshttps://doi.org/10.1109/tase.2026.3730532openalex-snapshot
A Real-Time Heuristic for Large-Scale Workforce Task Assignment, Multi-Vehicle Routing, and Scheduling With Time-Dependent Profits
inferred← citeshttps://doi.org/10.1109/tc.2003.1204831openalex-snapshot
Coverage in wireless ad hoc sensor networks
inferred← citeshttps://doi.org/10.1109/tmc.2009.133openalex-snapshot
An Edge-Constrained Localized Delaunay Graph for Geographic Routing in Mobile Ad Hoc and Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnet.2008.2002222openalex-snapshot
Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks
inferred← citeshttps://doi.org/10.1109/tnet.2024.3465844openalex-snapshot
KMSharing: The Framework and Space Abstraction for Efficient Data Sharing at the Network Edge
inferred← citeshttps://doi.org/10.1109/tnet.2024.3473853openalex-snapshot
Optimal Indexing: An Efficient Feature-Based Indexing Framework for Similarity Data Sharing at the Network Edge
inferred← citeshttps://doi.org/10.1109/tpds.2003.1239871openalex-snapshot
Localized Delaunay triangulation with application in ad hoc wireless networks
inferred← citeshttps://doi.org/10.1109/tpds.2006.48openalex-snapshot
Impact of sensing coverage on greedy geographic routing algorithms
inferred← citeshttps://doi.org/10.1109/tpds.2006.53openalex-snapshot
Localized topology control for unicast and broadcast in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1109/tvcg.2017.2705189openalex-snapshot
The LloydRelaxer: An Approach to Minimize Scaling Effects for Multivariate Projections
inferred← citeshttps://doi.org/10.1109/wcnc.2007.731openalex-snapshot
An Edge Constrained Localized Delaunay Graph for Geographic Routing in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1137/080737708openalex-snapshot
On Spanners and Lightweight Spanners of Geometric Graphs
inferred← citeshttps://doi.org/10.1137/110832458openalex-snapshot
The Stretch Factor of the Delaunay Triangulation Is Less than 1.998
inferred← citeshttps://doi.org/10.1137/110857428openalex-snapshot
Resistance-Based Performance Analysis of the Consensus Algorithm over Geometric Graphs
inferred← citeshttps://doi.org/10.1137/s0097539700369387openalex-snapshot
Online Routing in Triangulations
inferred← citeshttps://doi.org/10.1137/s0097539799361671openalex-snapshot
Approximating the Stretch Factor of Euclidean Graphs
inferred← citeshttps://doi.org/10.1137/s0895480103431046openalex-snapshot
Sparse Distance Preservers and Additive Spanners
inferred← citeshttps://doi.org/10.1137/s0895480194266628openalex-snapshot
Spanners of Hypercube-Derived Networks
inferred← citeshttps://doi.org/10.1137/s0895480197318088openalex-snapshot
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
inferred← citeshttps://doi.org/10.1142/s0218195904001366openalex-snapshot
EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
inferred← citeshttps://doi.org/10.1142/s0218195907002318openalex-snapshot
EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION
inferred← citeshttps://doi.org/10.1142/s0218195909002861openalex-snapshot
DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE
inferred← citeshttps://doi.org/10.1142/s0218195912500161openalex-snapshot
IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
inferred← citeshttps://doi.org/10.1142/s0218195917500066openalex-snapshot
Competitive Online Routing on Delaunay Triangulations
inferred← citeshttps://doi.org/10.1142/s0218195999000194openalex-snapshot
MIXED SPANNING TREES IN THEORY AND PRACTICE
inferred← citeshttps://doi.org/10.1145/1080829.1080831openalex-snapshot
A unified energy-efficient topology for unicast and broadcast
inferred← citeshttps://doi.org/10.1145/109648.109677openalex-snapshot
Construction of multidimensional spanner graphs, with applications to minimum spanning trees
inferred← citeshttps://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
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/1998196.1998235openalex-snapshot
Improved upper bound on the stretch factor of delaunay triangulations
inferred← citeshttps://doi.org/10.1145/2582112.2582141openalex-snapshot
There are Plane Spanners of Maximum Degree 4
inferred← citeshttps://doi.org/10.1145/3709693openalex-snapshot
Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art
inferred← citeshttps://doi.org/10.1145/501422.501424openalex-snapshot
Geometric spanner for routing in mobile networks
inferred← citeshttps://doi.org/10.1145/570810.570814openalex-snapshot
Asymptotically optimal geometric mobile ad-hoc routing
inferred← citeshttps://doi.org/10.1145/941079.941088openalex-snapshot
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
inferred← citeshttps://doi.org/10.1145/989459.989465openalex-snapshot
On greedy geographic routing algorithms in sensing-covered networks
inferred← citeshttps://doi.org/10.1145/989459.989473openalex-snapshot
Localized algorithms for energy efficient topology in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1201/9780203489635.ch39openalex-snapshot
Wireless Sensor Networks and Computational Geometry
inferred← citeshttps://doi.org/10.13140/rg.2.2.33820.33923openalex-snapshot
POSITION-BASED DISTRIBUTED HASH TABLES
inferred← citeshttps://doi.org/10.14778/3583140.3583166openalex-snapshot
ELPIS: Graph-Based Similarity Search for Scalable Data Science
inferred← citeshttps://doi.org/10.14778/3749646.3749725openalex-snapshot
SIEVE: Effective Filtered Vector Search with Collection of Indexes
inferred← citeshttps://doi.org/10.1556/comec.1.2000.1.7openalex-snapshot
On plexus representation of dissimilarities
inferred← citeshttps://doi.org/10.15807/jorsj.58.209openalex-snapshot
ROUTING ALGORITHMS UNDER MUTUAL INTERFERENCE CONSTRAINTS
inferred← citeshttps://doi.org/10.17169/refubium-22690openalex-snapshot
Minimum dilation triangulations
inferred← citeshttps://doi.org/10.22215/etd/2008-06271openalex-snapshot
Approximation algorithms for geometric networks
inferred← citeshttps://doi.org/10.22215/etd/2008-08369openalex-snapshot
Localized square test graph with applications to wireless ad hoc networks
inferred← citeshttps://doi.org/10.22215/etd/2014-10473openalex-snapshot
Theta-Graphs and Other Constrained Spanners
inferred← citeshttps://doi.org/10.22215/etd/2015-10924openalex-snapshot
Plane Spanners of Degree Eight
inferred← citeshttps://doi.org/10.22215/etd/2019-13678openalex-snapshot
Improved Spanning and Routing Ratios on Geometric Graphs
inferred← citeshttps://doi.org/10.22215/etd/2020-14152openalex-snapshot
Generalized Delaunay Triangulations:Graph-Theoretic Properties and Algorithms
inferred← citeshttps://doi.org/10.22215/etd/2020-14188openalex-snapshot
Routing on Heavy Path WSPD Spanners
inferred← citeshttps://doi.org/10.2991/cssdre-18.2018.94openalex-snapshot
Geometry of transport networks in the region
inferred← citeshttps://doi.org/10.3150/17-bej943openalex-snapshot
Coalescence of Euclidean geodesics on the Poisson–Delaunay triangulation
inferred← citeshttps://doi.org/10.4230/lipics.esa.2018.22openalex-snapshot
Improved Routing on the Delaunay Triangulation
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2008.1320openalex-snapshot
On Geometric Spanners of Euclidean and Unit Disk Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0801.4013openalex-snapshot
Spanners of Additively Weighted Point Sets
inferred← citeshttps://doi.org/10.48550/arxiv.0806.4221openalex-snapshot
Localized Spanners for Wireless Networks
inferred← citeshttps://doi.org/10.48550/arxiv.0903.5208openalex-snapshot
On the Necessary and Sufficient Condition of Greedy Routing Supporting Geographical Data Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1006.0291openalex-snapshot
The dilation of the Delaunay triangulation is greater than π/2
inferred← citeshttps://doi.org/10.48550/arxiv.1403.5350openalex-snapshot
There are Plane Spanners of Maximum Degree 4
inferred← citeshttps://doi.org/10.48550/arxiv.1410.0309openalex-snapshot
10-Gabriel graphs are Hamiltonian
inferred← citeshttps://doi.org/10.48550/arxiv.1507.06856openalex-snapshot
On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere
inferred← citeshttps://doi.org/10.48550/arxiv.1606.08824openalex-snapshot
Towards Plane Spanners of Degree 3
inferred← citeshttps://doi.org/10.48550/arxiv.1607.05770openalex-snapshot
Stretch Factor of Long Paths in a planar Poisson-Delaunay Triangulation
inferred← citeshttps://doi.org/10.5821/dissertation-2117-328194openalex-snapshot
Generalized Delaunay triangulations : graph-theoretic properties and algorithms
inferred← citeshttps://doi.org/10.6028/nist.ir.5164openalex-snapshot
Bibliographic notes on Voronoi diagrams
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.