Finding Optimal Geodesic Bridges Between Two Simple Polygons ( with A. Bhosle), submitted for possible journal publication.

Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links ( with A. Bhosle), submitted for possible journal publication.

Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links, (with A. Bhosle), Proceedings of the 21th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '09.

Minimizing Total Completion Time on Uniform Processor Systems with Deadline Constraints, (with J. Leung and M. Pinedo), ACM Transactions on Algorithms, Vol. 2, No. 1, pp. 95 - 115, 2006.

Exact and Approximation Algorithms for finding the Optimal Bridge Connecting Two Simple Polygons, (with A. M. Bhosle), International Journal on Computational Geometry and Applications, Vol 15, No. 6, pp. 609 - 630, Dec. 2005.

Algorithms for Single Link Failure Recovery and Related Problems, (with A. M. Bhosle), Journal of Graph Algorithms and Applications, Vol. 8, No 3, pp 275 -- 294, 2004.

Replacement Paths for Pairs of Shortest Path Edges in Directed Graphs, (with A. M. Bhosle), Proceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '04, (2004), MIT Cambridge MA, 94--99.

n-Cube Network: Node Disjoint Shortest Paths for Maximal Distance Pairs of Vertices, (with D. Serena), Journal of Parallel Computing, Vol. 30, 8, pp. 973 -998, 2004.

Online Dictionary Structures," Handbook of Data Structures and Applications, Eds. D. Mehta and S. Sahni, Chapter 24, Part IV, Chapman & Hall / CRC, Oct. 2004.

Complexity of the Pairwise Shortest Path Routing in the Grid, (with D. Serena), Theoretical Computer Science, Vol. 326, 1-3, pp. 155 -185, 2004.

Open Shop Scheduling," in Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Ed. Y. J.-T. Leung, Chapter 6, Part II, Chapman & Hall / CRC, 2004.

An Efficient Algorithm for Gossiping in the Multicasting Communication Environment," IEEE Transactions on Parallel and Distributed Systems, Vol 14, No. 7, pp. 701 -708, 2003.

Efficient Algorithms for Single Link Failure Recovery and Its Application to ATM Networks, (with A. M. Bhosle), Proceedings of the 15th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '03, (2003), Marina Del Rey, CA, 87 -- 92.

Node Disjoint Shortest Paths for Pairs of Vertices in an n-Cube Network, (with F. D. Serena) Proceedings of the 13th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '01, (2001), Anaheim, CA, 278 -- 282.

Gossiping in the Multicasting Communication Environment, Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS 2001, (6 pages).

Gossiping with Multicasting Communication Primitives, Proceedings of the 12th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS '00, (2000), Las Vegas, NV, Vol. II, 768 -- 773.

Simple Algorithms for the On-Line Multidimensional Problem and Related Problems, Algorithmica, Vol. 28, 2000, 255 -- 267.

Self--Stabilizing Algorithms for Tree Metrics (with A. K. Datta, and V. Thiagarajan), Parallel Processing Letters, Vol. 8, No. 1, World Scientific, March 1998. p.121-33.

Self--Stabilizing Algorithms for Tree Metrics (with V. Thiagarajan, and A. K. Datta), Proceedings of the First International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP--95), Vol. 1, pp 471 -- 478, Australia, 1995.

The On--Line D--Dimensional Dictionary Problem, Proceedings of the 3rd Symposium on Discrete Algorithms, January 1992, pp. 376 -- 385.

Complexity Aspects of Map Compression, (with H. Bodlaender and T. Kloks), Proceedings of the Data Compression Conference, April 1991, pp. 287 -- 296.

Optimal Preemptive Scheduling of Two Unrelated Processors, (with E. L. Lawler and S. Sahni), ORSA Journal on Computing, Vol. 2, No. 3, 1990, pp. 219 -- 224.

Complexity of Data Compression for Colored Maps, (with H. Bodlaender and T. Kloks), ALCOM Workshop on Data Structures, Graph Algorithms, and Computational Complexity, Berlin, Germany, October 1990.

Properties and Algorithms for Constrained Delaunay Triangulations, (with M. Razzazi), UCSB Technical Report #TRCS 89--32, November 1989.

A Linear Time Algorithm for Optimal Wiring Around a Rectangle, (with S. L. Lee), Journal of the Association for Computing Machinery, Vol. 35, No. 4, October 1988, pp. 810 -- 832.

Simple Three--Layer Channel Routing Algorithms, (with S. Q. Zheng), VLSI Algorithms and Architectures, Proceedings of the 3rd AEGEAN Workshop on Computing (AWOC 88), Lecture Notes in Computer Science, Springer--Verlag, June 1988, pp. 237 -- 246.

Minimization of the Number of Layers for Single Row Routing with Fixed Street Capacity, (with K. G. Shashishekhar), IEEE Transactions on Computer--Aided Design of Integrated Circuit and Systems, Vol. 7, No. 3, March 1988, pp. 420 -- 424.

An Efficient Algorithm to Minimize the Number of Layers for Single Row Routing Problems with Fixed Street Capacity, (with K. G. Shashishekhar), IEEE Physical Design Conference, March 1986.

On the Computational Complexity of Path Covering Problems, (with S. Ntafos), Journal of Computer and Systems Sciences, Vol. 29, No. 1, October 1984, pp. 225 -- 342.

Optimal and Near--Optimal Routing Around a Rectangle, (with S. L. Lee), ORSA/TIMS National Joint Meeting, Dallas Texas, November 1984.

Evaluation of Arithmetic Expressions with Algebraic Identities, (with J. JaJa), SIAM Journal on Computing, Vol. 11, No. 4, November 1982, pp. 633 -- 662.

Sorting Numbers in Linear Expected Time and Optimal Extra Space, (with D. B. Johnson), Information Processing Letters, Vol. 15, No. 3, October 1982, pp. 119 -- 124.

An Optimal Algorithm for Optimal Wiring Around a Rectangle, (with S. L. Lee), Proceedings of the 20th Annual Allerton Conference on Communication, Control and Computing, October 1982, pp. 636 -- 645.

Preemptive Scheduling of Parallel Processors, ORSA/TIMS Joint National Meeting, Houston Texas, October 1981.

A New Algorithm for Preemptive Scheduling Trees, (with D. B. Johnson), Journal of the Association for Computing Machinery, Vol. 27, No. 2, April 1980, pp. 287 -- 312.

A Note on Open Shop Preemptive Schedules, IEEE Transactions on Computers, Vol. C--28, No. 10, October 1979, pp. 782 -- 786.

NP--hard Shop Problems, Technical Report CS--79--35, The Pennsylvania State University, May 1979, (proofs of theorems in ``Unit Execution Time Shop Problems'' appear in this paper).

Minimizing the Mean and Maximum Finishing Time on Identical Processors, Technical Report CS--78--13, The Pennsylvania State University, August 1978.

Minimizing the Mean and Maximum Finishing Time on Uniform Processors, Technical Report CS--78--22, The Pennsylvania State University, November 1978.

Sorting Numbers in Linear Expected Time and Constant Extra Space, (with D. B. Johnson), Proceedings of the 16th Annual Allerton Conference on Communication, Control and Computing, October 1978, pp. 64 -- 72.

Preemptive Scheduling of Uniform Processor Systems, (with S. Sahni) Journal of the Association for Computing Machinery, Vol. 25, No. 1, January 1978, pp. 92 -- 101.

An Efficient Algorithm for the Kolmogorov--Smirnov and Lilliefors Tests, (with S. Sahni and W. R. Franta), ACM Transactions on Mathematical Software, Vol. 3, No. 1, March 1977, pp. 60 -- 64.

Open Shop Scheduling to Minimize Finish Time, (with S. Sahni), Journal of the Association for Computing Machinery, Vol. 23, No. 4, October 1976, pp. 665 -- 679.

Scheduling Independent Tasks with Release Dates and Due Dates on Parallel Machines, (with J. L. Bruno), Technical Report 213, The Pennsylvania State University, December 1976.

On Flowshop and Jobshop Schedules, (with S. Sahni), ORSA/TIMS Special Interest Conference on Scheduling, Orlando Florida, February 1976.

Algorithms on Sets and Related Problems, Technical Report 75--15, Department of Computer Science, University of Oklahoma, December 1975.