t-Spanners in Euclidean plane
t-Spanners for undirected graphs
Approximate minimum degree spanning trees
Arora's PTAS for Euclidean TSP
Uniform buy-at-bulk network design
Tree metrics in network design
Computing an Euclidean shortest path amid obstacles
Dynamic reachability in directed graphs
* Some of these talks were delivered multiple times.
The year indicates the last time it was delivered.
* The duration of a talk is from one to three hours.