1. Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs
2. Subgraph sparsification and nearly optimal ultrasparsifiers
3. On accelerated proximal gradient methods for convex-concave optimization;tseng;Submitted to the SIAM Journal on Control and Optimization,2008
4. A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally;mahoney;Journal of Machine Learning Research,2012
5. A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and be-yond;chuzhoy;ArXiv,2019