Ruoxu Cen

Orcid: 0009-0007-3900-2344

According to our database1, Ruoxu Cen authored at least 10 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Hypergraph Unreliability in Quasi-Polynomial Time.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Beyond the Quadratic Time Barrier for Network Unreliability.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Edge connectivity augmentation in near-linear time.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Augmenting Edge Connectivity via Isolating Cuts.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
Minimum Cuts in Directed Graphs via √n Max-Flows.
CoRR, 2021

Sparsification of Directed Graphs via Cut Balance.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Minimum Cuts in Directed Graphs via Partial Sparsification.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Roundtrip Spanners with (2k-1) Stretch.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Roundtrip Spanners with $(2k-1)$ Stretch.
CoRR, 2019


  Loading...