Subhash Suri

Univ. of California, Santa Barbara, Dept. of Computer Science
http://www.cs.ucsb.edu/~suri/
suri@cs.ucsb.edu

Author, editor, or reviewer of:

• An optimal algorithm for Euclidean shortest paths in the plane
• Compressing two-dimensional routing tables
• Data structures for two-edge connectivity in planar graphs
• Efficient computation of Euclidean shortest paths in the plane
• Erased arrangements of lines and convex decompositions of polyhedra
• Finding $k$ points with minimum diameter and related problems
• Finding the $k$ shortest simple paths: a new algorithm and its implementation
• Fully dynamic 2-edge-connectivity in planar graphs
• Kinetic connectivity of rectangles
• On the difficulty of some shortest path problems
• Query-sensitive ray shooting
• Range counting over multidimensional data streams
• Stabbing triangulations by lines in 3D
• The centroid of points with approximate weights
• Vickrey prices and shortest paths: what is an edge worth?
• Proc. 7th Int. Symp. Algorithms & Computation (ISAAC 1996)