On Ensuring MultiLayer Wirability by Stretching Layouts, (with S. Q. Zheng), *VLSI Design: An International Journal of Custom--Chip Design, Simulation, and Testing*, Vol. 7, No. 4, 1998, 365 -- 383.

Improved Approximation Algorithms for Embedding Hypergraphs in a Cycle, *Information Processing Letters*, Vol. 67, 1998, 267 -- 271.

Pin Redistribution Problem for Multi--Chip Modules: Algorithms and Complexity, (with D. Chang), *International Journal of High Speed Electronics and Systems, Special Issue on High Performance CAD for Packaging and Multi--Chip Modules*, Vol. 6, No. 3, 1995, pp, 459 -- 475. Also appears in High Performance Design Automation for Multi--Chip Modules and Packages, Selected Topics in Electronics and Systems -- Vol. 5, Edited by J. D. Cho, and P. D. Franzon, World Scientific Publishing Co., 1996 (IBSN 981--02--2307--2).

Single Phase Three--Layer Channel Routing Algorithms, (with S. Q. Zheng), *INTEGRATION, the VLSI Journal*, Vol. 17, 1994, pp 141 -- 151.

A Flow Based Approach to the Pin Redistribution Problem for Multi--Chip Modules, (with D. Chang, and O. H. Ibarra), Proceedings of the GLS--VLSI '94 Conference, March 1994, pp. 114 -- 119.

Switch--Box Routing Under the Two--Overlap Wiring Model, (with K. G. Shashishekhar and S. Q. Zheng), Algorithmic Aspects of VLSI Layout, Eds. M. Sarrafzadeh and D. T. Lee, World Scientific, 1993, 265 -- 308.

An Approximation Algorithm for Routing Around Two Rectangles, (with S. L. Lee), Algorithmic Aspects of VLSI Layout, Eds. M. Sarrafzadeh and D. T. Lee, World Scientific, 1993, 365 -- 397.

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.

Grid Stretching Algorithms for Routing Multiterminal Nets Through a Rectangle, (with S. Q. Zheng), *INTEGRATION: the VLSI Journal*, Vol. 13, 1992, 153 -- 177.

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.

On the Generalized Channel Definition Problem, (with M. Razzazi), Proceedings of the GLS--VLSI '91 Conference, March 1991, pp. 88 -- 91.

Multiterminal--Net Routing by Grid Stretching, (with S. Q. Zheng), IEEE International Conference on Computer Design: VLSI in Computers and Processors ( ICCD '90 ), October 1990, pp. 396 -- 399.

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.

Area Bound for the Three--Layer Wirings of a Class of Planar Layouts, (with S. Q. Zheng), *Congressus Numerantium*, Vol. 74, January 1990, pp. 181 -- 192.

XXVLSI An Approximation Algorithm for Partitioning a Hyperrectilinear Polygon with Holes, (with M. Razzazi), UCSB Technical Report TRCS 90--23, November, 1990.

Stretching and Three--Layer Wiring Planar Layouts, (with S. Q. Zheng), *INTEGRATION: the VLSI Journal*, Vol. 8, 1989, pp. 111 -- 141.

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

An Approximation Algorithm for the Via Placement, (with K. G. Shashishekhar), *IEEE Transactions on Computer--Aided Design of Integrated Circuits and Systems*, Vol. 8, No. 3, March 1989, pp. 219 -- 228.

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 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.

Minimization of the Number of Layers for Single Row Routing with Fixed Street Capacity, (with K. G. Shashishekhar), *IEEE Transactions on Computer--Aided Design of Integrated Circuit and Systems*, Vol. 7, No. 3, March 1988, pp. 420 -- 424.

A Suboptimal Solution to the Via Placement Problem, (with K. G. Shashishekhar), Proceedings of the 25th Annual Allerton Conference on Communications, Control and Computing, October 1987, pp. 377 -- 386.

Three Layer Wirability of Planar Layouts, (with S. Q. Zheng), Proceedings of the 25th Annual Allerton Conference on Communications, Control and Computing, October 1987, pp. 387 -- 396.

Layer Assignment for Planar Layouts, (with S. Q. Zheng), IEEE International Conference on Computer Design: VLSI in Computers and Processors ( ICCD '87 ), October 1987, pp. 278 -- 281.

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.

Three--Layer Channel Routing Multi--Terminal Nets, (with S. Q. Zheng), UCSB Technical Report #TRCS 87--13, August 1987.

Routing Multiterminal Nets Around a Rectangle, (with S. L. Lee), *IEEE Transactions on Computers*, Vol. C--35, No. 6, June 1986, pp. 543 -- 549.

An Approximation Algorithm for Routing Two--Terminal Nets Around Two Rectangles, (with S. L. Lee), Proceedings of the 24th Annual Allerton Conference on Communication, Control and Computing, October 1986, pp. 550 -- 559.

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.

An Efficient Algorithm to Minimize the Number of Layers for Single Row Routing Problems with Fixed Street Capacity, (with K. G. Shashishekhar), IEEE Physical Design Conference, March 1986.

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

An Approximation Algorithm for the Multi--Via Assignment Problem, *IEEE Transactions on Computer--Aided Design of Integrated Circuits and Systems*, Vol. CAD--3, No. 4, October 1984, pp. 257 -- 264.

Near--Optimal Routings of Multi--Nets Around a Rectangle, (with S. L. Lee), Proceedings of the 22nd Annual Allerton Conference on Communications, Control and Computing, October 1984, pp. 498 -- 507.

Optimal and Near--Optimal Routing Around a Rectangle, (with S. L. Lee), ORSA/TIMS National Joint Meeting, Dallas Texas, November 1984.

An Approximation Algorithm for the Via Assignment Problem, Proceedings of the 1983 International Conference on Computer--Aided Design ( ICCAD 83 ), Santa Clara, CA, September 1983, pp. 125 -- 128.

Approximation Algorithms for PLA Folding, Technical Report #128, The University of Texas at Dallas, March 1983.

An Optimal Algorithm for Optimal Wiring Around a Rectangle, (with S. L. Lee), Proceedings of the 20th Annual Allerton Conference on Communication, Control and Computing, October 1982, pp. 636 -- 645.