1. Alpert CJ, Kahng AB (1995) Recent directions in netlist partitioning: a survey. Integr VLSI J 19(1–2):1–81
2. Arora S, Rao S, Vazirani U (2004) Expander flows, geometric embeddings, and graph partitionings. In: 36th annual symposium on the theory of computing, Chicago, June 2004, pp 222–231
3. Berman P, Karpinski M (2003) Approximability of hypergraph minimum bisection. ECCC report TR03-056, Electronic Colloquium on Computational Complexity, vol 10
4. Bui TN, Jones C (1992) Finding good approximate vertex and edge partitions is NP-hard. Inform Process Lett 42(3):153–159
5. Coja-Oghlan A, Goerdt A, Lanka A, Schädlich F (2004) Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. Theory Comput Sci 329(1–3):1–45