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

Area Bound for the Three--Layer Wirings of a Class of Planar Layouts, (with S. Q. Zheng), Twentieth Southeastern Conference on Combinatorics, Graph Theory and Computing, February 1989.

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.

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.

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