Dihedral bounds for mesh generation in high dimensions
- Marshall Bern
- Paul Chew
- et al.
- 1995
- SODA 1995
Conference paper
Publications
8 results for David Eppstein
Separator based sparsification for dynamic planar graph algorithms
- David Eppstein
- Zvi Galil
- et al.
- 1993
- STOC 1993
Conference paperSparsification-a technique for speeding up dynamic graph algorithms
- David Eppstein
- Zvi Galil
- et al.
- 1992
- FOCS 1992
Conference paperSparse Dynamic Programming I: Linear Cost Functions
- David Eppstein
- Zvi Galil
- et al.
- 1992
- Journal of the ACM
PaperSparse Dynamic Programming II: Convex and Concave Cost Functions
- David Eppstein
- Zvi Galil
- et al.
- 1992
- Journal of the ACM
PaperMaintenance of a minimum spanning forest in a dynamic plane graph
- David Eppstein
- Giuseppe F Italiano
- et al.
- 1992
- Journal of Algorithms
PaperEfficient sequential and parallel algorithms for computing recovery points in trees and paths
- Marek Chrobak
- David Eppstein
- et al.
- 1991
- SODA 1991
Conference paperMaintenance of a minimum spanning forest in a dynamic planar graph
- David Eppstein
- Giuseppe F. Italiano
- et al.
- 1990
- SODA 1990
Conference paper