Computation Geometry Journals

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

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.

Minimum Edge Length Rectangular Partitions, (with S. Q. Zheng), Handbook of Approximation Algorithms and Metaheuristics, Ed. T. F. Gonzalez, Chapter 54, Part V, Chapman & Hall / CRC, May 2007.

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

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

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.

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

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

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

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