network flows

An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
Co-winner of Best Paper Award at SODA 2014.
Jonathan A. Kelner, YinTat Lee, Lorenzo Orecchia, Aaron Sidford
DOI ArXiv SIAM
Flow-Based Algorithms for Local Graph Clustering
Zeyuan Allen-Zhu, Lorenzo Orecchia
ArXiv SIAM
Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques
UCB TR
On Partitioning Graphs via Single Commodity Flows
Lorenzo Orecchia, Leonard Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi
ACM
On a Cut-Matching Game for the Sparsest Cut Problem
Rohit Khandekar, Subhash A. Khot, Nisheeth K. Vishnoi, Lorenzo Orecchia
UCB TR