1. Agarwal A, Charikar M, Makarychev K, Makarychev Y (2005) Proceedings of the 37th ACM symposium on theory of computing (STOC), Baltimore, May 2005, pp 573–581
2. Aggarwal A, Alon N, Charikar M (2007) Improved approximations for directed cut problems. In: Proceedings of the 39th ACM symposium on theory of computing (STOC), San Diego, June 2007, pp 671–680
3. Arora S, Hazan E, Kale S (2004) Proceedings of the 45th IEEE symposium on foundations of computer science (FOCS), Rome, 17–19 Oct 2004, pp 238–247
4. Arora S, Rao S, Vazirani U (2004) Expander flows, geometric embeddings, and graph partitionings. In: Proceedings of the 36th ACM symposium on theory of computing (STOC), Chicago, June 2004, pp 222–231
5. Arora S, Lee J, Naor A (2005) Euclidean distortion and the sparsest cut. In: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), Baltimore, May 2005, pp 553–562