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