Anand A, Lee E, Li J and Saranurak T. Approximating Small Sparse Cuts. Proceedings of the 56th Annual ACM Symposium on Theory of Computing. (319-330).

Brand J, Chen L, Kyng R, Liu Y, Peng R, Gutenberg M, Sachdeva S and Sidford A. (2023). A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). 10.1109/FOCS57990.2023.00037. 979-8-3503-1894-4. (503-514).

https://ieeexplore.ieee.org/document/10353212/

Veldt N. Cut-matching Games for Generalized Hypergraph Ratio Cuts. Proceedings of the ACM Web Conference 2023. (694-704).

https://doi.org/10.1145/3543507.3583539

Chen L, Peng R and Wang D. (2022). 2-norm Flow Diffusion in Near-Linear Time 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). 10.1109/FOCS52979.2021.00060. 978-1-6654-2055-6. (540-549).

https://ieeexplore.ieee.org/document/9719724/

Vishnoi N. (2021). Algorithms for Convex Optimization

https://www.cambridge.org/core/product/identifier/9781108699211/type/book

Priyadarshini S and Rodda S. (2020). Geometric Multi-Way Frequent Subgraph Mining Approach to a Single Large Database. Smart Intelligent Computing and Applications. 10.1007/978-981-32-9690-9_23. (233-244).

http://link.springer.com/10.1007/978-981-32-9690-9_23

Saranurak T and Wang D. Expander decomposition and pruning. Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. (2616-2635).

/doi/10.5555/3310435.3310597

Fountoulakis K, Gleich D and Mahoney M. An Optimization Approach to Locally-Biased Graph Algorithms. Proceedings of the IEEE. 10.1109/JPROC.2016.2637349. 105:2. (256-272).

http://ieeexplore.ieee.org/document/7828195/

Chattopadhyay A, Langberg M, Li S and Rudra A. Tight network topology dependent bounds on rounds of communication. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. (2524-2539).

/doi/10.5555/3039686.3039853

Henzinger M, Rao S and Wang D. Local flow partitioning for faster edge connectivity. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. (1919-1938).

/doi/10.5555/3039686.3039811

Chuzhoy J and Li S. (2016). A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. Journal of the ACM. 63:5. (1-51). Online publication date: 20-Dec-2016.

https://doi.org/10.1145/2893472

Chekuri C and Chuzhoy J. (2016). Polynomial Bounds for the Grid-Minor Theorem. Journal of the ACM. 63:5. (1-65). Online publication date: 20-Dec-2016.

https://doi.org/10.1145/2820609

(2016). Quantum circuit physical design flow for the multiplexed trap architecture. Microprocessors & Microsystems. 45:PA. (23-31). Online publication date: 1-Aug-2016.

https://doi.org/10.1016/j.micpro.2016.02.018

Arora S and Kale S. (2016). A Combinatorial, Primal-Dual Approach to Semidefinite Programs. Journal of the ACM. 63:2. (1-35). Online publication date: 4-May-2016.

https://doi.org/10.1145/2837020

Peng R. Approximate undirected maximum flows in o(mpolylog(n)) time. Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms. (1862-1867).

/doi/10.5555/2884435.2884565

Schild A and Sommer C. On Balanced Separators in Road Networks. Proceedings of the 14th International Symposium on Experimental Algorithms - Volume 9125. (286-297).

https://doi.org/10.1007/978-3-319-20086-6_22

Chekuri C and Chuzhoy J. Degree-3 treewidth sparsifiers. Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. (242-255).

/doi/10.5555/2722129.2722148

Sarma A, Molla A and Pandurangan G. Distributed Computation of Sparse Cuts via Random Walks. Proceedings of the 16th International Conference on Distributed Computing and Networking. (1-10).

https://doi.org/10.1145/2684464.2684474

Sachdeva S and Vishnoi N. (2014). Faster Algorithms via Approximation Theory. Foundations and Trends® in Theoretical Computer Science. 9:2. (125-210). Online publication date: 28-Mar-2014.

https://doi.org/10.1561/0400000065

Orecchia L and Zhu Z. Flow-based algorithms for local graph clustering. Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms. (1267-1286).

/doi/10.5555/2634074.2634168

Chekuri C, Shepherd F and Weibel C. (2013). Flow-cut gaps for integer and fractional multiflows. Journal of Combinatorial Theory Series B. 103:2. (248-273). Online publication date: 1-Mar-2013.

https://doi.org/10.1016/j.jctb.2012.11.002

Chekuri C and Ene A. Poly-logarithmic approximation for maximum node disjoint paths with constant congestion. Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms. (326-341).

/doi/10.5555/2627817.2627841

Chuzhoy J and Li S. A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science. (233-242).

https://doi.org/10.1109/FOCS.2012.54

Orecchia L, Sachdeva S and Vishnoi N. Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator. Proceedings of the forty-fourth annual ACM symposium on Theory of computing. (1141-1160).

https://doi.org/10.1145/2213977.2214080

Chuzhoy J. Routing in undirected graphs with constant congestion. Proceedings of the forty-fourth annual ACM symposium on Theory of computing. (855-874).

https://doi.org/10.1145/2213977.2214054

Spielman D. (2012). Spectral Graph Theory. Combinatorial Scientific Computing. 10.1201/b11644-19. (495-524). Online publication date: 25-Jan-2012.

http://www.crcnetbase.com/doi/abs/10.1201/b11644-19

Mahoney M. (2012). Algorithmic and Statistical Perspectives on Large-Scale Data Analysis. Combinatorial Scientific Computing. 10.1201/b11644-17. (427-469). Online publication date: 25-Jan-2012.

http://www.crcnetbase.com/doi/abs/10.1201/b11644-17

Teng S. (2011). Numerical Thinking in Algorithm Design and Analysis. Computer Science. 10.1007/978-1-4614-1168-0_15. (349-384).

https://link.springer.com/10.1007/978-1-4614-1168-0_15

Madry A. Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs. Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. (245-254).

https://doi.org/10.1109/FOCS.2010.30

Teng S. The laplacian paradigm. Proceedings of the 7th annual conference on Theory and Applications of Models of Computation. (2-14).

https://doi.org/10.1007/978-3-642-13562-0_2

Chekuri C, Shepherd F and Weibel C. Flow-cut gaps for integer and fractional multiflows. Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms. (1198-1208).

/doi/10.5555/1873601.1873697

Chung F and Zhao W. (2010). A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification. Algorithms and Models for the Web-Graph. 10.1007/978-3-642-18009-5_2. (2-14).

http://link.springer.com/10.1007/978-3-642-18009-5_2

Sherman J. Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut. Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science. (363-372).

https://doi.org/10.1109/FOCS.2009.66

Lang K, Mahoney M and Orecchia L. Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow. Proceedings of the 8th International Symposium on Experimental Algorithms. (197-208).

https://doi.org/10.1007/978-3-642-02011-7_19

Khandekar R, Rao S and Vazirani U. (2009). Graph partitioning using single commodity flows. Journal of the ACM. 56:4. (1-15). Online publication date: 1-Jun-2009.

https://doi.org/10.1145/1538902.1538903

Trevisan L. Max cut and the smallest eigenvalue. Proceedings of the forty-first annual ACM symposium on Theory of computing. (263-272).

https://doi.org/10.1145/1536414.1536452

Andersen R and Peres Y. Finding sparse cuts locally using evolving sets. Proceedings of the forty-first annual ACM symposium on Theory of computing. (235-244).

https://doi.org/10.1145/1536414.1536449

Arora S, Rao S and Vazirani U. (2008). Geometry, flows, and graph-partitioning algorithms. Communications of the ACM. 51:10. (96-105). Online publication date: 1-Oct-2008.

https://doi.org/10.1145/1400181.1400204