Yu Gao

Orcid: 0009-0002-4660-2149

Affiliations:
  • Georgia Institute of Technology, Atlanta, GA, USA


According to our database1, Yu Gao authored at least 18 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index.
CoRR, 2024

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

2023
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions.
SIAM J. Comput., December, 2023

Hardness of Graph-Structured Algebraic and Symbolic Problems.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2022
Faster maxflow via improved dynamic spectral vertex sparsifiers.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
Unit-Weight Laplacians are Complete for Linear Systems Modulo $p$.
CoRR, 2021

Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
On the Complexity of Sequence-to-Graph Alignment.
J. Comput. Biol., 2020

A Study of Performance of Optimal Transport.
CoRR, 2020

Flowless: Extracting Densest Subgraphs Without Flow Computations.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex.
CoRR, 2019

Efficient Second-Order Shape-Constrained Function Fitting.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Fully dynamic spectral vertex sparsifiers and applications.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018
Fully Dynamic Effective Resistances.
CoRR, 2018

Nearly Tight Bounds for Sandpile Transience on the Grid.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Tight Bounds for Sandpile Transience on the Two-Dimensional Grid up to Polylogarithmic Factors.
CoRR, 2017


  Loading...