Papers & Reports

• RaftGP: Random Fast Graph Partitioning, IEEE HPEC Graph Challenge 2023, Innovation Award,

with Meng Qin, Yibin Ding, Li Zeng, Chaorui Zhang, Weixi Zhang, Wei Han, Rongqian Zhao, and Bo Bai

• Kissat_MAB_prop in SAT Competition 2023, 1st place in the UNSAT track, 2nd place in the main (SAT+UNSAT) track,

• Phase Transitions of Structured Codes of Graphs, manuscript,

with Bo Bai, Jie Ma, and Yuze Wu. (https://arxiv.org/abs/2307.08266)

• Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers, STOC 2022,

with Jan van den Brand, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, and Aaron Sidford. (https://arxiv.org/abs/2112.00722)

• Hardness of Graph-Structured Algebraic and Symbolic Problems, WADS 2023,

with Yufan Huang, Richard Peng, Jingbang Chen, and Runze Wang. (https://arxiv.org/abs/2109.12736)

• Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time, SODA 2022,

with Sally Dong, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva and Guanghao Ye. (https://arxiv.org/abs/2205.01562)

• Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao, FOCS 2021,

with Yang P. Liu and Richard Peng. (https://arxiv.org/abs/2101.07233)

• A Study of Performances of Optimal Transport, OTML 2019,

with Yihe Dong, Richard Peng, Ilya Razenshteyn and Saurabh Sawlani. (https://arxiv.org/abs/2005.01182)

• A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond, FOCS 2020,

with Julia Chuzhoy, Jason Li, Danupon Nanongkai, Richard Peng and Thatchaphol Saranurak. (https://arxiv.org/abs/1910.08025)

• Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex, preprint,

with Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak and Sorrachai Yingchareonthawornchai. (https://arxiv.org/abs/1910.07950)

• Flowless: Extracting Densest Subgraphs Without Flow Computations, TheWebConf 2020,

with Digvijay Boob, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang and Junxing Wang. (https://arxiv.org/abs/1910.07087)

• On the Complexity of Sequence to Graph Alignment, RECOMB 2019,

with Chirag Jain, Haowen Zhang and Srinivas Aluru. (https://www.biorxiv.org/content/10.1101/522912v1)

• Fully Dynamic Vertex Sparsifiers and Applications, STOC 2019,

with David Durfee, Gramoz Goranci and Richard Peng. (https://arxiv.org/abs/1906.10530, previous version: https://arxiv.org/abs/1804.04038)

• Fitting Second-order Constrained Functions to Data, WADS 2019,

with David Durfee, Anup B. Rao and Richard Peng. (https://arxiv.org/abs/1905.02149)

• Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions, FOCS 2018,

with Junxing Wang, Richard Peng, Saurabh Sawlani, Sushant Sachdeva and Timothy Chu. (https://arxiv.org/abs/1805.12051)

• Nearly Tight Bounds for Sandpile Transience on the Grid, SODA 2018,

with David Durfee, Matthew Fahrbach, and Tao Xiao. (https://arxiv.org/abs/1704.04830)

The authors are sorted alphabetically (or uniformly randomly) following the convention (or trend) in mathematics and theoretical computer science.