1. S. Arora, J.R. Lee and A. Naor, Euclidean distortion and the sparsest cut, inSTOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing. ACM New York, NY, USA (2005) 553–562.
2. S. Arora, S. Rao and U. Vazirani, Expander flows, geometric embeddings and graph partitioning, inSTOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. ACM, New York, NY, USA (2004) 222–231.
3. A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique
4. S. Chawla, A. Gupta and H. Räcke, Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut, inSODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics Philadelphia, PA, USA (2005) 102–111.
5. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani and D. Sivakumar, On the hardness of approximating multicut and sparsest-cut, in20th Annual IEEE Conference on Computational Complexity(2005) 144–153.