Tight Bounds for Sandpile Transience on the Two-Dimensional Grid up to Polylogarithmic Factors. - David Durfee; Matthew Fahrbach; Yu Gao 001; Tao Xiao (CoRR, 2017)

Nearly Tight Bounds for Sandpile Transience on the Grid. - David Durfee; Matthew Fahrbach; Yu Gao 001; Tao Xiao (SODA, 2018)

Fully Dynamic Effective Resistances. - David Durfee; Yu Gao 001; Gramoz Goranci; Richard Peng (CoRR, 2018)

Fully dynamic spectral vertex sparsifiers and applications. - David Durfee; Yu Gao 001; Gramoz Goranci; Richard Peng (STOC, 2019)

Efficient Second-Order Shape-Constrained Function Fitting. - David Durfee; Yu Gao 001; Anup B. Rao; Sebastian Wild (WADS, 2019)

Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex. - Yu Gao 001; Jason Li 006; Danupon Nanongkai; Richard Peng; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (CoRR, 2019)

A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. - Julia Chuzhoy; Yu Gao 001; Jason Li 006; Danupon Nanongkai; Richard Peng; Thatchaphol Saranurak (FOCS, 2020)

Flowless: Extracting Densest Subgraphs Without Flow Computations. - Digvijay Boob; Yu Gao 001; Richard Peng; Saurabh Sawlani; Charalampos E. Tsourakakis; Di Wang 005; Junxing Wang (WWW, 2020)

A Study of Performance of Optimal Transport. - Yihe Dong; Yu Gao 001; Richard Peng; Ilya P. Razenshteyn; Saurabh Sawlani (CoRR, 2020)

On the Complexity of Sequence-to-Graph Alignment. - Chirag Jain; Haowen Zhang; Yu Gao 001; Srinivas Aluru (J. Comput. Biol., 2020)

Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. - Yu Gao 001; Yang P. Liu; Richard Peng (FOCS, 2021)

Unit-Weight Laplacians are Complete for Linear Systems Modulo $p$. - Jingbang Chen; Yu Gao 001; Yufan Huang; Richard Peng (CoRR, 2021)

Faster maxflow via improved dynamic spectral vertex sparsifiers. - Jan van den Brand; Yu Gao 001; Arun Jambulapati; Yin Tat Lee; Yang P. Liu; Richard Peng; Aaron Sidford (STOC, 2022)

Analysis and Maintenance of Graph Laplacians via Random Walks. - Yu Gao 001 (2022)

Hardness of Graph-Structured Algebraic and Symbolic Problems. - Jingbang Chen; Yu Gao 001; Yufan Huang; Richard Peng; Runze Wang (WADS, 2023)

Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions. - Timothy Chu; Yu Gao 001; Richard Peng; Sushant Sachdeva; Saurabh Sawlani; Junxing Wang (SIAM J. Comput., 2023)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks. - Jingbang Chen; Qiuyang Mang; Hangrui Zhou; Richard Peng; Yu Gao 001; Chenhao Ma 001 (KDD, 2024)

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index. - Qiuyang Mang; Jingbang Chen; Hangrui Zhou; Yu Gao 001; Yingli Zhou; Richard Peng; Yixiang Fang; Chenhao Ma 001 (CoRR, 2024)

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index. - Qiuyang Mang; Jingbang Chen; Hangrui Zhou; Yu Gao 001; Yingli Zhou; Qingyu Shi; Richard Peng; Yixiang Fang; Chenhao Ma 001 (Proc. VLDB Endow., 2025)

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. - Sally Dong; Yu Gao 001; Gramoz Goranci; Yin Tat Lee; Sushant Sachdeva; Richard Peng; Guanghao Ye (J. ACM, 2025)