Approximating Corridors and Tours via Restriction and Relaxation Techniques, (with A. Gonzalez), ACM Transactions on Algorithms, (to appear).

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.

Pairwise Disjoint Shortest Paths in the n-Cube and Related Problems, (with D. Serena), Theoretical Computer Science, Vol 369, No. 1, pp. 427 -- 435, 2006.

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

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

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

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

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.

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.

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

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.

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.

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.

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.

P--Complete Approximation Problems, (with S. Sahni), Journal of the Association for Computing Machinery, Vol. 23, No. 3, July 1976, pp. 555 -- 565.