1. Ambuhl, C., Mastrolilli, M., Svensson, O.: Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling. In: FOCS 2007: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 329–337. IEEE Computer Society, Los Alamitos (2007)
2. Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. J. ACM 56(2), Art. 5, 37 (2009)
3. Electron. Notes Discrete Math;P.S. Bonsma,2007
4. Chambers, E.W., Erickson, J., Nayyeri, A.: Minimum cuts and shortest homologous cycles. In: SCG 2009: Proceedings of the 25th annual symposium on Computational geometry, pp. 377–385. ACM, New York (2009)
5. Erickson, J., Whittlesey, K.: Greedy optimal homotopy and homology generators. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1038–1046. ACM, New York (2005) (electronic)