Next: Conference Publications
Up: Publications:
Previous: Publications:
-
Recurrence Relations Based on Minimization and Maximization (with
E.M. Reingold), J. of Math. Anal. and Applications, 109, No.2
(August 1985), 591-604.
-
Minimizing Channel Density in Standard Cell Layout, ( with J.
Blair, E.L. Lloyd, K.J. Supowit), Algorithmica, Vol. 2, No. 3,
(1987), pp. 267-282.
-
Optimum Lopsided Binary Trees (with E.M. Reingold), Journal of A.C.M.,
vol. 36, No. 3, July 1989, pp.573-590.
-
Lower Bounds on Maximal Layer and Convex Hull Problems, (with P.
Ramanan), Algorithmica (1989) 4: 447-459.
-
Stochastic Rearrangement Rules for Self-Organizing Data Structures,
(with E.M. Reingold), Algorithmica (1991) 6:278-291.
-
Algorithms for Enumerating All Spanning Trees of Undirected and
Weighted Graphs, (with H. Ramesh), SIAM Journal of Computing, vol 24, No. 3.
1995.
-
Speeding up Karmarkar's Algorithm for Multi-Commodity Flows, (with
P. Vaidya), Mathematical Programming,Volume 73, Issue 1, April 1996,
pp 111-127.
-
New techniques for exact and approximate dynamic closest-point
problems, (with M. Smid), SIAM Journal of Computing, August 1996.
-
On the Complexity of approximating travelling salesman tours and
minimum spanning trees, (with G. Das and M. Smid), Algorithmica, 1997.
-
An Efficient Algorithm for Euclidean Shortest Paths amongst
Polygonal Obstacles, (with S.N. Maheshwari and J.S.B. Mitchell).
Discrete & Computational Geometry, 1997.
-
Algorithms for Enumerating All Spanning Trees of
Directed Graphs, (with H. Ramesh),
to appear in Algorithmica.
-
Efficiently constructing the visibility graph of a Simple Polygon
with Obstacles, (with S.N.Maheshwari),
accepted for publication (subject to revisions) in SIAM Journal of Computing.
-
Dynamically Maintaining Maxima in 2-dimensions,
To appear in SIAM Journal of Computing.
Next: Conference Publications
Up: Publications:
Previous: Publications:
Sanjiv Kapoor
7/27/1999