Next: Conference Publications
Efficient Algorithms for Quadratic programming and Multi-Commodity
Flows, (with P. Vaidya) Procededings of the 18th Annual ACM
Symposium on Theory of Computing, 1986, pp.147-159.
Rectilinear shortest paths amongst Polygonal Obstacles, (with K.
Clarkson and P. Vaidya), 3rd Annual A.C.M. Symposium on
Computational Geometry, 1987.
Efficient Algorithms for Euclidean Shortest Path and Visibility
Problems with Polygonal Obstacles, (with S.N. Maheswari), 4th
Annual A.C.M. Symposium on Computational Geometry, 1988,pp.172-182.
On Enumerating all spanning trees of directed and undirected
graphs, (with H. Ramesh), Proc. Workshop on Algorithms and Data
Structures, Carleton University, Canada, Springer Verlag, August
Algorithms for Relative Neighborhood Graphs and Vornoi Diagrams in
Simple Polygons, (With V. Sarin), 4th Canadian Conference on
Computational Geometry, 1992.