Yu Gao
Yu Gao
Unknown affiliation
Verified email at - Homepage
Cited by
Cited by
A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond
J Chuzhoy, Y Gao, J Li, D Nanongkai, R Peng, T Saranurak
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
Fully dynamic electrical flows: Sparse maxflow faster than Goldberg–Rao
Y Gao, Y Liu, R Peng
SIAM Journal on Computing, FOCS21-85-FOCS21-156, 2023
Graph sparsification, spectral sketches, and faster resistance computation via short cycle decompositions
T Chu, Y Gao, R Peng, S Sachdeva, S Sawlani, J Wang
SIAM Journal on Computing 52 (6), FOCS18-85-FOCS18-157, 2020
On the complexity of sequence-to-graph alignment
C Jain, H Zhang, Y Gao, S Aluru
Journal of Computational Biology 27 (4), 640-654, 2020
Flowless: Extracting densest subgraphs without flow computations
D Boob, Y Gao, R Peng, S Sawlani, C Tsourakakis, D Wang, J Wang
Proceedings of The Web Conference 2020, 573-583, 2020
Fully dynamic spectral vertex sparsifiers and applications
D Durfee, Y Gao, G Goranci, R Peng
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Faster maxflow via improved dynamic spectral vertex sparsifiers
J van den Brand, Y Gao, A Jambulapati, YT Lee, YP Liu, R Peng, ...
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
Nested dissection meets ipms: Planar min-cost flow in nearly-linear time
S Dong, Y Gao, G Goranci, YT Lee, R Peng, S Sachdeva, G Ye
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
A study of performance of optimal transport
Y Dong, Y Gao, R Peng, I Razenshteyn, S Sawlani
arXiv preprint arXiv:2005.01182, 2020
Deterministic graph cuts in subquadratic time: Sparse, balanced, and k-vertex
Y Gao, J Li, D Nanongkai, R Peng, T Saranurak, ...
arXiv preprint arXiv:1910.07950, 2019
Fully dynamic effective resistances
D Durfee, Y Gao, G Goranci, R Peng
arXiv preprint arXiv:1804.04038, 2018
Raftgp: Random fast graph partitioning
Y Gao, M Qin, Y Ding, L Zeng, C Zhang, W Zhang, W Han, R Zhao, B Bai
2023 IEEE High Performance Extreme Computing Conference (HPEC), 1-7, 2023
Nearly tight bounds for sandpile transience on the grid
D Durfee, M Fahrbach, Y Gao, T Xiao
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
Efficient Second-Order Shape-Constrained Function Fitting
D Durfee, Y Gao, AB Rao, S Wild
Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index
Q Mang, J Chen, H Zhou, Y Gao, Y Zhou, R Peng, Y Fang, C Ma
arXiv preprint arXiv:2406.00344, 2024
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
J Chen, Q Mang, H Zhou, R Peng, Y Gao, C Ma
arXiv preprint arXiv:2402.05006, 2024
Hardness of Graph-Structured Algebraic and Symbolic Problems
J Chen, Y Gao, Y Huang, R Peng, R Wang
Algorithms and Data Structures Symposium, 232-246, 2023
Check for updates Hardness of Graph-Structured Algebraic and Symbolic Problems
Y Gao, Y Huang, R Peng¹
Algorithms and Data Structures: 18th International Symposium, WADS 2023 …, 2023
Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers
J Brand, Y Gao, A Jambulapati, YT Lee, YP Liu, R Peng, A Sidford
arXiv preprint arXiv:2112.00722, 2021
Unit-Weight Laplacians are Complete for Linear Systems Modulo
Y Huang, R Peng, Y Gao, J Chen
arXiv e-prints, arXiv: 2109.12736, 2021
The system can't perform the operation now. Try again later.
Articles 1–20