Complexity of the Minimum-Length Corridor Problem, (with A. Gonzalez), Journal of Computational Geometry: Theory and Applications, Vol. 37, No. 2, pp. 72 -- 103, 2007.

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.

Wavelength Assignment in Multifiber Optical Star Networks under the Multicasting Communication Mode, (with R. Brandt), Journal of Interconnection Networks, Vol. 6, No. 5, pp. 383 - 406, 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.

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.

Efficient Resource Utilization in Parallel and Distributed Systems, Journal of Supercomputing, Vol. 28, (1), pp 5 - 6, (Guest Editorial).

On Solving Multimessage Multicasting Problems, International Journal of Foundations of Computer Science, Special Issue on Scheduling - Theory and Applications, Vol. 12, No. 6, pp. 791 -- 808, 2001.

Simple Algorithms for MultiMessage Multicasting with Forwarding, Algorithmica, Vol. 29, 2001, pp. 511 -- 533.

Distributed Algorithms for Multimessage Multicasting, Journal of Interconnection Networks, Vol. 1, No. 4, Dec 2000, pp 303 -- 315.

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

Complexity and Approximations for Multimessage Multicasting, Journal of Parallel and Distributed Computing, 55, 1998, 215 -- 235.

On Ensuring MultiLayer Wirability by Stretching Layouts, (with S. Q. Zheng), VLSI Design: An International Journal of Custom--Chip Design, Simulation, and Testing, Vol. 7, No. 4, 1998, 365 -- 383.

Bounded Fan-Out MultiMessage Multicasting, Nordic Journal on Computing, Vol. 5, 1998, 196 -- 213.

Improved Approximation Algorithms for Embedding Hypergraphs in a Cycle, Information Processing Letters, Vol. 67, 1998, 267 -- 271.

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.

A Computationally Intractable Problem on Simplicial Complexes, (with O. Egecioglu), Computational Geometry: Theory and Applications, Vol. 6, No. 2, 1996, pp. 85 -- 98.

Pin Redistribution Problem for Multi--Chip Modules: Algorithms and Complexity, (with D. Chang), International Journal of High Speed Electronics and Systems, Special Issue on High Performance CAD for Packaging and Multi--Chip Modules, Vol. 6, No. 3, 1995, pp, 459 -- 475. Also appears in High Performance Design Automation for Multi--Chip Modules and Packages, Selected Topics in Electronics and Systems -- Vol. 5, Edited by J. D. Cho, and P. D. Franzon, World Scientific Publishing Co., 1996 (IBSN 981--02--2307--2).

Complexity Aspects of Two--Dimensional Data Compression, (with H. Bodlaender and T. Kloks), Nordic Journal on Computing, Vol. 4, No. 2, 1995, pp. 462 -- 495.

LP--Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem, Information Processing Letters, Vol. 54, No. 3, 1995, 129 -- 131.

Single Phase Three--Layer Channel Routing Algorithms, (with S. Q. Zheng), INTEGRATION, the VLSI Journal, Vol. 17, 1994, pp 141 -- 151.

On Optimal Guillotine Partitions Approximating Optimal d-Box Partitions, (with M. Razzazi, M. Shing and S. Q. Zheng), Computational Geometry: Theory and Applications, Vol. 4, No. 1, 1994, 1 -- 11.

An Efficient Divide--and--Conquer Approximation Algorithm for Partitioning D--Boxes, (with M. Razzazi, and S. Q. Zheng), International Journal on Computational Geometry and Applications, Vol. 3, No. 4, 1993, 417 -- 428.

Grid Stretching Algorithms for Routing Multiterminal Nets Through a Rectangle, (with S. Q. Zheng), INTEGRATION: the VLSI Journal, Vol. 13, 1992, 153 -- 177.

Covering a Set of Points in Multidimensional Space, Information Processing Letters, Vol. 40, 1991, 181 -- 188.

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.

Approximation Algorithms for Partitioning Rectilinear Polygons with Interior Points, (with S. Q. Zheng), Algorithmica, Vol. 5, January 1990, pp. 11 -- 42.

Area Bound for the Three--Layer Wirings of a Class of Planar Layouts, (with S. Q. Zheng), Congressus Numerantium, Vol. 74, January 1990, pp. 181 -- 192.

Stretching and Three--Layer Wiring Planar Layouts, (with S. Q. Zheng), INTEGRATION: the VLSI Journal, Vol. 8, 1989, pp. 111 -- 141.

Improved Bounds for Rectangular and Guillotine Partitions, (with S. Q. Zheng), Journal of Symbolic Computation, Vol. 7, 1989, pp. 591 -- 610.

A 1.60 Approximation Algorithm for Routing Multiterminal Nets Around a Rectangle, (with S. L. Lee), SIAM Journal on Computing, Vol. 16, No. 4, August 1987, pp. 669 -- 704.

Clustering to Minimize the Maximum Inter--Cluster Distance, Journal of Theoretical Computer Science, No. 38, October 1985, pp. 293 -- 306.

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.

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.

Unit Execution Time Shop Problems, Mathematics of Operations Research, Vol. 7, No. 1, February 1982, pp. 57 -- 66.

On the Complexity of Computing Bilinear Forms with (0,1) Constants, (with J. JaJa), Journal of Computer and Systems Sciences, Vol. 20, February 1980, pp. 77 -- 95.

An Efficient Approximate Algorithm for the Kolmogorov--Smirnov and Lilliefors Tests, (with S. Sahni and W. R. Franta), Journal of Statistical Computation and Simulation, Vol. 6, 1978, pp. 257 -- 263.

Flowshop and Jobshop Schedules: Complexity and Approximation, (with S. Sahni), Operations Research, Vol. 26, No. 1, January--February 1978, pp. 36 -- 52.

Bounds for LPT Schedules for Uniform Processors, (with O. H. Ibarra and S. Sahni), SIAM Journal on Computing, Vol. 6, No. 1, March 1977, pp. 155 -- 166.