Andrew B. Kahng,et al. Recent directions in netlist partitioning: a survey , 1995, Integr..
 Frank Thomson Leighton,et al. A Framework for Solving VLSI Graph Layout Problems , 1984, J. Comput. Syst. Sci..
 Vipin Kumar,et al. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..
 Yuval Rabani,et al. An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..
 Vijay V. Vazirani,et al. Finding separator cuts in planar graphs within twice the optimal , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
 Vijay V. Vazirani,et al. Finding Separator Cuts in Planar Graphs within Twice the Optimal , 1999, SIAM J. Comput..
 Robert Krauthgamer,et al. Approximating the minimum bisection size (extended abstract) , 2000, STOC '00.
 Curt Jones,et al. Finding Good Approximate Vertex and Edge Partitions is NP-Hard , 1992, Inf. Process. Lett..
 Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
 David B. Shmoys,et al. Cut problems and their application to divide-and-conquer , 1996 .
 Philip N. Klein,et al. Excluded minors, network decomposition, and multicommodity flow , 1993, STOC '93.
 Frank Thomson Leighton,et al. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
 Marek Karpinski,et al. Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems , 1999, J. Comput. Syst. Sci..
 Frank Thomson Leighton,et al. Graph bisection algorithms with good average case behavior , 1987, Comb..