1. Agarwal, A., Alon, N., Charikar, M.: Improved approximation for directed cut problems. In: STOC, pp. 671–680 (2007)
2. Andersen, R., Chung, F.R.K., Lang, K.J.: Local graph partitioning using pagerank vectors. In: FOCS, pp. 475–486 (2006)
3. Andersen, R., Gleich, D., Mirrokni, V.: Overlapping clustering for distributed computation. In: ACM Conference on Web search and Data Mining (2012)
4. Arora, S., Ge, R., Sachdeva, S., Schoenebeck, G.: Finding overlapping communities in social networks: toward a rigorous approach. In: ACM EC (2012)
5. Arora, S., Hazan, E., Kale, S.: $O(\sqrt{\log(n)})$ approximation to sparsest cut in $\tilde{o}(n^{{2}})$ time. SIAM J. Comput. 39(5), 1748–1771 (2010)