1. In A Decomposition Algorithm for Circuit Routing, Hu TC, Kuh ES. (eds.).
2. An adaptation of the interior point method for solving the global routing problem
3. An efficient linear programming based approach for finding netlist partitions. Proceedings Can. Conference VLSI, 1988.
4. A new relative placement procedure based on MSST and linear programming. Proceedings of the IEEE International Symposium on Circuits & Systems (ISCAS), 1987; 564-567.
5. An implementation of Karmarkar's algorithm for linear programming