Discrete Applied Mathematics, Volume 90

Volume 90, Number 1-3, January 1999

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