Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut. - Jonah Sherman (FOCS, 2009)

Breaking the Multicommodity Flow Barrier for sqrt(log(n))-Approximations to Sparsest Cut - Jonah Sherman (CoRR, 2009)

Nearly Maximum Flows in Nearly Linear Time. - Jonah Sherman (FOCS, 2013)

Generalized Preconditioning and Network Flow Problems. - Jonah Sherman (CoRR, 2016)

Improved bounds for the randomized decision tree Complexity of recursive majority. - Frédéric Magniez; Ashwin Nayak 001; Miklos Santha; Jonah Sherman; Gábor Tardos; David Xiao (Random Struct. Algorithms, 2016)

Generalized Preconditioning and Undirected Minimum-Cost Flow. - Jonah Sherman (SODA, 2017)

Area-convexity, l∞ regularization, and undirected multicommodity flow. - Jonah Sherman (STOC, 2017)

New Techniques for Continuous Optimization and Fast Algorithms for Flow. - Jonah Sherman (2017)