Next: Other manuscripts
Up: Publications:
Previous: 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
1991.
-
Algorithms for Relative Neighborhood Graphs and Vornoi Diagrams in
Simple Polygons, (With V. Sarin), 4th Canadian Conference on
Computational Geometry, 1992.
-
New techniques for exact and approximate dynamic closest-point
problems, (with M. Smid),
10th ACM Symposium on Computational Geometry, 1994.
-
Dynamically Maintaining Maxima in 2-dimensions,
10th ACM Symposium on Computational Geometry, 1994.
-
On Minmum 3-cuts and Approximating Graph Partitioning using Cut Trees,
Proc. of 5th International IPCO Conference , LNCS Springer-Verlag, 1996.
-
On the Complexity of approximating travelling salesman tours and
minimum spanning trees, 1996 (with G. Das and M. Smid),
Proc. of FST & TCS, India, LNCS Springer-Verlag, 1996.
-
Dynamically maintaining shortest path trees in simple polygons,
(with Tripurari Singh),
Proc. of FST & TCS, India, LNCS, Springer-Verlag, 1996.
-
Dynamic Binary Space Partitioning for hidden surface removal,
(with A. Kumar, V. Kwatra, B. Singh),
Proc. of ICGVIP 1998 (part B),
New Delhi.
-
Using Separating Planes between Objects for Dynamic Binary Space Partitioning,
(with A. Kumar, V. Kwatra, B. singh), in
Proc of International Conference on
Visual Computing, Goa, India, Feb. 1999.
-
Efficiently computing Geodesic Shortest Paths, in
ACM Symposium on Theory of Computing, May 1999.
-
Bus Routing and allocation, (with M. Kathuria), presented
at INFORMS, May 1999, Cinicinatti, USA.
Next: Other manuscripts
Up: Publications:
Previous: Conference Publications
Sanjiv Kapoor
7/27/1999