| 3 | -- | 26 | Charles J. Alpert, Andrew B. Kahng, So-Zen Yao. Spectral Partitioning with Multiple Eigenvectors |
| 27 | -- | 50 | Jonathan W. Berry, Mark K. Goldberg. Path Optimization for Graph Partitioning Problems |
| 51 | -- | 67 | Manjit Borah, Robert Michael Owens, Mary Jane Irwin. A Fast and Simple Steiner Routing Heuristic |
| 69 | -- | 88 | Endre Boros, Peter L. Hammer, Michel Minoux, David J. Rader Jr.. Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization |
| 89 | -- | 114 | Bradley S. Carlson, C. Y. Roger Chen, Dikran S. Meliksetian. Transistor Chaining in Static CMOS Functional Cells of Arbitrary Planar Topology |
| 115 | -- | 133 | Sunil Chopra, Jonathan H. Owen. A Note on Formulations for the A-partition Problem on Hypergraphs |
| 135 | -- | 159 | Michael J. Fischer, Mike Paterson. Optimal Layout of Edge-weighted Forests |
| 161 | -- | 171 | Joseph L. Ganley. Computing Optimal Rectilinear Steiner Trees: A Survey and Experimental Evaluation |
| 173 | -- | 194 | Edmund Ihler, Gabriele Reich, Peter Widmayer. Class Steiner Trees and VLSI-design |
| 195 | -- | 221 | Jagannathan Narasimhan, Kazuo Nakajima, Chong S. Rim. A Graph Theoretical Approach for the Yield Enhancement of Reconfigurable VLSI/WSI Arrays |
| 223 | -- | 243 | C.-J. Richard Shi, Janusz A. Brzozowski. A Characterization of Signed Hypergraphs and Its Applications to VLSI Via Minimization and Logic Synthesis |
| 245 | -- | 255 | Xuehou Tan, Xiaoyu Song. Routing Multiterminal Nets on a Hexagonal Grid |