On the public citation graph

Dynamic Euclidean minimum spanning trees and extrema of binary functions

https://doi.org/10.1007/bf02574030
0 signed · 120 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.1006/jagm.1994.1033openalex-snapshot
Offline Algorithms for Dynamic Minimum Spanning Tree Problems
inferredcites →https://doi.org/10.1006/jagm.1995.1048openalex-snapshot
Static and Dynamic Algorithms for k-Point Clustering Problems
inferredcites →https://doi.org/10.1006/jagm.1996.0054openalex-snapshot
Off-Line Maintenance of Planar Configurations
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/bf02187852openalex-snapshot
Maintaining the minimal distance of a point set in polylogarithmic time
inferredcites →https://doi.org/10.1007/bf02574012openalex-snapshot
Iterated nearest neighbors and finding minimal polytopes
inferredcites →https://doi.org/10.1007/bf02574698openalex-snapshot
Euclidean minimum spanning trees and bichromatic closest pairs
inferredcites →https://doi.org/10.1007/bfb0028278openalex-snapshot
Offline algorithms for dynamic minimum spanning tree problems
inferredcites →https://doi.org/10.1016/0020-0190(82)90119-3openalex-snapshot
A data structure for dynamic range queries
inferredcites →https://doi.org/10.1016/0022-0000(81)90012-xopenalex-snapshot
Maintenance of configurations in the plane
inferredcites →https://doi.org/10.1016/0196-6774(80)90015-2openalex-snapshot
Decomposable searching problems I. Static-to-dynamic transformation
inferredcites →https://doi.org/10.1016/0925-7721(91)90001-uopenalex-snapshot
Off-line dynamic maintenance of the width of a planar point set
inferredcites →https://doi.org/10.1016/0925-7721(95)00018-6openalex-snapshot
Average case analysis of dynamic geometric optimization
inferredcites →https://doi.org/10.1016/s0925-7721(00)00026-2openalex-snapshot
Hamilton cycles in the path graph of a set of points in convex position
inferredcites →https://doi.org/10.1109/sfcs.1978.1openalex-snapshot
A data structure for orthogonal range queries
inferredcites →https://doi.org/10.1109/sfcs.1991.185368openalex-snapshot
Randomized multidimensional search trees: lazy balancing and dynamic shuffling
inferredcites →https://doi.org/10.1109/sfcs.1991.185369openalex-snapshot
Dynamic maintenance of geometric structures made easy
inferredcites →https://doi.org/10.1109/sfcs.1992.267816openalex-snapshot
Dynamic half-space reporting, geometric optimization, and minimum spanning trees
inferredcites →https://doi.org/10.1109/sfcs.1992.267818openalex-snapshot
Sparsification-a technique for speeding up dynamic graph algorithms
inferredcites →https://doi.org/10.1137/0214055openalex-snapshot
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
inferredcites →https://doi.org/10.1137/0218080openalex-snapshot
Geometry Helps in Matching
inferredcites →https://doi.org/10.1145/103516.103518openalex-snapshot
Maintenance of geometric extrema
inferredcites →https://doi.org/10.1145/109648.109662openalex-snapshot
Randomized multidimensional search trees (extended abstract)
inferredcites →https://doi.org/10.1145/129712.129763openalex-snapshot
Ray shooting and parametric search
inferredcites →https://doi.org/10.1145/142675.142683openalex-snapshot
Linear optimization queries
inferredcites →https://doi.org/10.1145/142675.142742openalex-snapshot
An optimal algorithm for the on-line closest-pair problem
inferredcites →https://doi.org/10.1145/3828.3839openalex-snapshot
Adding range restriction capability to dynamic data structures
inferredcites →https://doi.org/10.1145/800061.808754openalex-snapshot
Data structures for on-line updating of minimum spanning trees
inferredcites →https://doi.org/10.1287/ijoc.4.4.360openalex-snapshot
Dynamic Three-Dimensional Linear Programming
inferredcites →https://doi.org/10.5555/127787.127801openalex-snapshot
Offline maintenance of planar configurations
inferredcites →https://doi.org/10.5555/313559.313612openalex-snapshot
Iterated nearest neighbors and finding minimal polytypes
inferredcites →https://doi.org/10.5555/320176.320185openalex-snapshot
New techniques for some dynamic closest-point and farthest-point problems

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.2000.1107openalex-snapshot
Incremental and Decremental Maintenance of Planar Width
inferred← citeshttps://doi.org/10.1006/jagm.2001.1189openalex-snapshot
Fly Cheaply: On the Minimum Fuel Consumption Problem
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_89openalex-snapshot
Dynamic Algorithms for Approximating Interdistances
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_32openalex-snapshot
Energy Optimal Routing in Radio Networks Using Geometric Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-47789-6_2openalex-snapshot
Extreme Distances in Multicolored Point Sets
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_214openalex-snapshot
Maintaining minimum spanning trees in dynamic graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_236openalex-snapshot
Minimum Geometric Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_236openalex-snapshot
Minimum Geometric Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_18openalex-snapshot
On Two Simple[st] Learning Tasks
inferred← citeshttps://doi.org/10.1007/978-3-319-59108-7_10openalex-snapshot
Algorithms for Stable Matching and Clustering in a Grid
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_56openalex-snapshot
Reactive Proximity Data Structures for Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_13openalex-snapshot
Straight Skeletons of Three-Dimensional Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-642-25011-8_21openalex-snapshot
Kinetic Euclidean Minimum Spanning Tree in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_236-2openalex-snapshot
Minimum Geometric Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_6openalex-snapshot
Fully Dynamic Algorithms for Euclidean Steiner Tree
inferred← citeshttps://doi.org/10.1007/pl00009479openalex-snapshot
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
inferred← citeshttps://doi.org/10.1007/s00453-009-9322-3openalex-snapshot
On Bounded Leg Shortest Paths Problems
inferred← citeshttps://doi.org/10.1007/s00453-010-9414-0openalex-snapshot
Energy-Efficient Paths in Radio Networks
inferred← citeshttps://doi.org/10.1007/s00453-025-01358-0openalex-snapshot
Computing the Minimum Bottleneck Moving Spanning Tree
inferred← citeshttps://doi.org/10.1007/s00453-026-01395-3openalex-snapshot
Segment Proximity Graphs and Nearest Neighbor Queries amid Disjoint Segments
inferred← citeshttps://doi.org/10.1007/s00454-003-2923-8openalex-snapshot
A Fully Dynamic Algorithm for Planar Width
inferred← citeshttps://doi.org/10.1007/s00454-020-00229-5openalex-snapshot
Dynamic Geometric Data Structures via Shallow Cuttings
inferred← citeshttps://doi.org/10.1007/s00454-020-00243-7openalex-snapshot
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications
inferred← citeshttps://doi.org/10.1007/s00454-023-00621-xopenalex-snapshot
Dynamic Connectivity in Disk Graphs
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00018-6openalex-snapshot
Average case analysis of dynamic geometric optimization
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.01.004openalex-snapshot
Connected dominating sets on dynamic geometric graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.07.001openalex-snapshot
Stable Roommates Spanner
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.12.003openalex-snapshot
Shortest paths in intersection graphs of unit disks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.08.002openalex-snapshot
Dynamic data structures for approximate Hausdorff distance in the word RAM
inferred← citeshttps://doi.org/10.1016/j.is.2016.07.006openalex-snapshot
Approximate furthest neighbor with application to annulus query
inferred← citeshttps://doi.org/10.1016/j.jda.2012.04.009openalex-snapshot
Kinetic Euclidean minimum spanning tree in the plane
inferred← citeshttps://doi.org/10.1109/70.370502openalex-snapshot
Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest paths trees
inferred← citeshttps://doi.org/10.1109/cec.2006.1688471openalex-snapshot
A Knowledge-Based Evolution Strategy for the Multi-Objective Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1109/focs.2008.29openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
inferred← citeshttps://doi.org/10.1109/isncc66965.2025.11250449openalex-snapshot
A Formal Model for Path Set Attribute Calculation in Network Systems
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892082openalex-snapshot
Stable distributions, pseudorandom generators, embeddings and data stream computation
inferred← citeshttps://doi.org/10.1109/tro.2004.829439openalex-snapshot
Theoretical and Experimental Analysis of Heuristics for the “Freeze-Tag” Robot Awakening Problem
inferred← citeshttps://doi.org/10.1109/visual.2000.885677openalex-snapshot
H-BLOB: a hierarchical visual clustering method using implicit surfaces
inferred← citeshttps://doi.org/10.1137/090751670openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
inferred← citeshttps://doi.org/10.1137/1.9781611975994.173openalex-snapshot
Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
inferred← citeshttps://doi.org/10.1137/1.9781611976014.6openalex-snapshot
Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique
inferred← citeshttps://doi.org/10.1137/19m1246493openalex-snapshot
On Locality-Sensitive Orderings and Their Applications
inferred← citeshttps://doi.org/10.1137/20m1388371openalex-snapshot
Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
inferred← citeshttps://doi.org/10.1137/s0097539702404389openalex-snapshot
Semi-Online Maintenance of Geometric Optima and Measures
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.1137/s009753970343912xopenalex-snapshot
Dynamic Subgraph Connectivity with Geometric Applications
inferred← citeshttps://doi.org/10.1137/s009753970444572xopenalex-snapshot
Sublinear Geometric Algorithms
inferred← citeshttps://doi.org/10.1137/s0097539795295936openalex-snapshot
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
inferred← citeshttps://doi.org/10.1137/s0097539797327209openalex-snapshot
Maintaining Minimum Spanning Forests in Dynamic Graphs
inferred← citeshttps://doi.org/10.1142/9789812773289_0003openalex-snapshot
Extreme Distances in Multicolored Point Sets
inferred← citeshttps://doi.org/10.1142/9789812773296_0013openalex-snapshot
Finding Shortest Paths With Computational Geometry
inferred← citeshttps://doi.org/10.1145/1147954.1147955openalex-snapshot
Stable distributions, pseudorandom generators, embeddings, and data stream computation
inferred← citeshttps://doi.org/10.1145/1542362.1542384openalex-snapshot
Straight skeletons of three-dimensional polyhedra
inferred← citeshttps://doi.org/10.1145/1706591.1706596openalex-snapshot
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
inferred← citeshttps://doi.org/10.1145/220279.220284openalex-snapshot
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
inferred← citeshttps://doi.org/10.1145/2591796.2591805openalex-snapshot
Parallel algorithms for geometric graph problems
inferred← citeshttps://doi.org/10.1145/2591796.2591844openalex-snapshot
Approximation algorithms for bipartite matching with metric and geometric costs
inferred← citeshttps://doi.org/10.1145/262839.262998openalex-snapshot
Proximity problems on moving points
inferred← citeshttps://doi.org/10.1145/276698.276715openalex-snapshot
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
inferred← citeshttps://doi.org/10.1145/276884.276891openalex-snapshot
Raising roofs, crashing cycles, and playing pool
inferred← citeshttps://doi.org/10.1145/336154.336197openalex-snapshot
When crossings count — approximating the minimum spanning tree
inferred← citeshttps://doi.org/10.1145/351827.351829openalex-snapshot
Fast hierarchical clustering and other applications of dynamic closest pairs
inferred← citeshttps://doi.org/10.1145/3717823.3718209openalex-snapshot
Dynamic Locality Sensitive Orderings in Doubling Metrics
inferred← citeshttps://doi.org/10.1145/378583.378660openalex-snapshot
A fully dynamic algorithm for planar
inferred← citeshttps://doi.org/10.1145/502090.502095openalex-snapshot
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
inferred← citeshttps://doi.org/10.1145/509907.509911openalex-snapshot
Dynamic subgraph connectivity with geometric applications
inferred← citeshttps://doi.org/10.1145/780542.780620openalex-snapshot
Sublinear geometric algorithms
inferred← citeshttps://doi.org/10.1162/evco_a_00106openalex-snapshot
ETEA: A Euclidean Minimum Spanning Tree-Based Evolutionary Algorithm for Multi-Objective Optimization
inferred← citeshttps://doi.org/10.17169/refubium-28335openalex-snapshot
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications
inferred← citeshttps://doi.org/10.17169/refubium-41977openalex-snapshot
Dynamic Connectivity in Disk Graphs
inferred← citeshttps://doi.org/10.3929/ethz-a-006651988openalex-snapshot
Low-cost fault-tolerant spanning graphs for point sets in the Euclidean plane
inferred← citeshttps://doi.org/10.4230/lipics.socg.2015.240openalex-snapshot
Finding All Maximal Subsequences with Hereditary Properties
inferred← citeshttps://doi.org/10.48550/arxiv.0805.0022openalex-snapshot
Straight Skeletons of Three-Dimensional Polyhedra
inferred← citeshttps://doi.org/10.48550/arxiv.0808.1128openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1401.0042openalex-snapshot
Parallel Algorithms for Geometric Graph Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1412.5215openalex-snapshot
Shallow Packings in Geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1704.02303openalex-snapshot
Algorithms for Stable Matching and Clustering in a Grid
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0303001openalex-snapshot
When Crossings Count - Approximating the Minimum Spanning Tree
inferred← citeshttps://doi.org/10.5555/1109557.1109689openalex-snapshot
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
inferred← citeshttps://doi.org/10.5555/1283383.1283466openalex-snapshot
On bounded leg shortest paths problems
inferred← citeshttps://doi.org/10.5555/314464.314481openalex-snapshot
Average case analysis of dynamic geometric optimization
inferred← citeshttps://doi.org/10.5555/314613.315030openalex-snapshot
Fast hierarchical clustering and other applications of dynamic closest pairs
inferred← citeshttps://doi.org/10.5555/375213.375219openalex-snapshot
H-BLOB: a hierarchical visual clustering method using implicit surfaces
inferred← citeshttps://doi.org/10.5555/545381.545445openalex-snapshot
Semi-online maintenance of geometric optima and measures
inferred← citeshttps://doi.org/10.5555/644108.644242openalex-snapshot
Sublinear-time approximation of Euclidean minimum spanning tree
inferred← citeshttps://doi.org/10.7155/jgaa.00071openalex-snapshot
Finding Shortest Paths With Computational Geometry
inferred← citeshttps://doi.org/10.7155/jgaa.00080openalex-snapshot
Extreme Distances in Multicolored Point Sets
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.