David Eppstein

*Discrete & Computational Geometry* 13(1):111–122, Jan 1995

Tech. report 92-05, Univ. of California, Irvine, Dept. of Information and Computer Science, 1992

Tech. report 92-88, Univ. of California, Irvine, Dept. of Information and Computer Science, 1992

*Mathematical Reviews* 95g:68122

http://www.ics.uci.edu/~eppstein/pubs/p-dynmst.html

http://www.ics.uci.edu/~eppstein/pubs/Epp-DCG-95.pdf

Cited by:

- Minkowski-type theorems and least-squares clustering
- Dynamic half-space range reporting and its applications
- Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
- Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest path trees
- Maintaining minimum spanning trees in dynamic graphs
- Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree
- Poly-logarithmic deterministic fully-dynamic graph algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Low-cost fault-tolerant spanning graphs for point sets in the Euclidean plane
- When crossings count — approximating the minimum spanning tree
- Stable distributions, pseudorandom generators, embeddings and data stream computation
- Top-trees and dynamic graph algorithms
- Reductions among high dimensional proximity problems
- A fully dynamic algorithm for planar width
- Fly cheaply: on the minimum fuel consumption problem
- Semi-online maintenance of geometric optima and measures
- Dynamic subgraph connectivity with geometric applications
- Lectures on Discrete Geometry
- IVORY — An Object-Oriented Framework for Physics-Based Information Visualization
- Better algorithms for high-dimensional proximity problems via asymmetric embeddings
- Sublinear time approximation of Euclidean minimum spanning tree
- Sublinear geometric algorithms
- Energy optimal routing in radio networks using geometric data structures
- Extreme distances in multicolored point sets
- Geometric Shape Matching and Drug Design
- High-Dimensional Computational Geometry
- Kinetic Maintenance of Proximity Structures
- A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
- On bounded leg shortest paths problems