Exact and Approximation Algorithms for finding the Optimal Bridge Connecting Two Simple Polygons, (with A. M. Bhosle), (Submitted for journal publication).

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.