- Dynamic algorithms for half-space reporting, proximity
problems, and geometric minimum spanning trees, 33rd IEEE Symp.
Foundations of Computer Science, Pittsburgh, October 25, 1992. I
don't remember for sure, but I think Pankaj Agarwal presented this
talk.
- Subquadratic algorithms for the straight skeleton, Jeff Erickson, January
24, 1997.
- Raising roofs, crashing cycles, and playing pool, Jeff
Erickson, Dagstuhl Computational Geometry Seminar, February,
1997.
- Raising roofs, crashing cycles,
and playing pool: applications of a data structure for finding
pairwise interactions, ICS
Research Symposium, Dept. of Information & Computer
Science, UC Irvine, February 7, 1997.
- A subquadratic algorithm for the
straight skeleton, Workshop on Voronoi Diagrams,
Triangulations, and Splines, Tempe, Arizona, February 21,
1997.
- Raising roofs, crashing cycles, and playing pool, Jeff
Erickson, Johns Hopkins Univ., April, 1997.
- Raising roofs, crashing cycles, and playing pool, Jeff
Erickson, Univ. of Maryland, College Park, April, 1997.
- Fast hierarchical clustering via
dynamic closest pairs, Applied Statistics Seminar Series on
Cluster Analysis, Center for Statistical Clustering, UC Irvine, May
7, 1997.
- Fast hierarchical clustering and other applications of dynamic
closest pairs, Worksh. Effiziente Algorithmen, Oberwolfach, Germany, August 7, 1997.
- Raising roofs, crashing cycles, and playing pool, Jeff
Erickson, 29th Computational Geometry
Day, NYU, December 12, 1997.
- Fast hierarchical clustering and other applications of dynamic
closest pairs, 9th ACM-SIAM Symp. Discrete Algorithms, San
Francisco, January 1998.
- Raising roofs, crashing cycles, and playing pool: applications
of a data structure for finding pairwise interactions, Jeff
Erickson, 12th ACM Symp. Comp. Geom., Minneapolis, June 1998.
- Incremental
and decremental maintenance of planar width, 10th ACM-SIAM
Symp. Discrete Algorithms, Baltimore, January 1999.
David Eppstein, Information &
Computer Science, UC Irvine,
.