A Computationally Intractable Problem on Simplicial Complexes, (with O. Egecioglu), Computational Geometry: Theory and Applications, (to appear).

On Optimal Guillotine Partitions Approximating Hyperrectangular Partitions, (with M. Razzazi, M. Shing and S. Q. Zheng), Computational Geometry: Theory and Applications, Vol. 4, (1994), 1 - 11.

A Computationally Intractable Problem of Simplicial Complexes, (with O. Egecioglu), 6th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC/SFCA '94), DIMACS, May 1994. Also in Seventh SIAM Conference on Discrete Mathematics, Albuquerque NM, June 22--25, 1994.

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.

Algorithms for a Class of Min-Cut and Max-Cut Problems, (with T. Murayama), Algorithms and Computation, Proceedings of the Third Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science #650, Springer-Verlang, December 1992, pp. 97 - 105.

Covering a Set of Points with Fixed Size Hypersquares and Related Problems, Information Processing Letters, 40, (1991), 181 - 188.

An Approximation Algorithm for Partitioning a Hyperrectilinear Polytope with Holes, (with M. Razzazi), Proceedings of the Third Canadian Conference on Computational Geometry, August 1991, pp. 183 - 186.

Properties and Algorithms for Constrained Delaunay Triangulations, (with M. Razzazi), Proceedings of the Third Canadian Conference on Computational Geometry, August 1991, pp. 114 - 117.

Approximation Algorithms for Covering with Fixed Size Hypersquares and Related Problems, Proceedings of the 29th Annual Allerton Conference on Communications, Control and Computing, October 1990, pp. 838 - 847.

An Efficient Divide-and-Conquer Approximation Algorithm for Hyperrectangular Partitions, (with M. Razzazi and S. Q. Zheng), Proceedings of the Second Canadian Conference on Computational Geometry, August 1990, pp. 214 - 217.

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.

Improved Bounds for Rectangular and Guillotine Partitions, (with S. Q. Zheng), Proceedings of the 24th Annual Allerton Conference on Communication, Control and Computing, October 1986, pp. 334 - 343.

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

Bounds for Partitioning Rectilinear Polygons, (with S. Q. Zheng), Proceedings of the Computational Geometry Conference, June 1985, pp. 281 - 287.

On the Computational Complexity of Clustering and Related Problems, Systems Modeling and Optimization, Proceedings of the 10th IFIP Conference on Systems Modeling and Optimization, Lecture Notes in Control and Information Sciences #38, Springer-Verlag, August 1981, pp. 174 - 182.