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.

Online Dictionary Structures," Handbook of Data Structures and Applications, Eds. D. Mehta and S. Sahni, Chapter 24, Part IV, Chapman & Hall / CRC, Oct. 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.

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

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.

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.

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.

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

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.

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.

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.

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.