Ruoxu Cen

According to our database, Ruoxu Cen authored at least 13 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2026

Fully Dynamic Set Cover: Worst-Case Recourse and Update Time.

Sayan Bhattacharya, Ruoxu Cen, Debmalya Panigrahi

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025

Network Unreliability in Almost-Linear Time.

Ruoxu Cen, Jason Li, Debmalya Panigrahi

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Fast Algorithms for Graph Arboricity and Related Problems.

Ruoxu Cen, Henry L. Fleischmann, George Z. Li, Jason Li, Debmalya Panigrahi

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024

Hypergraph Unreliability in Quasi-Polynomial Time.

Ruoxu Cen, Jason Li, Debmalya Panigrahi

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Beyond the Quadratic Time Barrier for Network Unreliability.

Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows.

Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Edge connectivity augmentation in near-linear time.

Ruoxu Cen, Jason Li, Debmalya Panigrahi

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.

Ruoxu Cen, Jason Li, Debmalya Panigrahi

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

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

Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak

CoRR, 2021

Sparsification of Directed Graphs via Cut Balance.

Ruoxu Cen, Yu Cheng, Debmalya Panigrahi, Kevin Sun

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Minimum Cuts in Directed Graphs via Partial Sparsification.

Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Roundtrip Spanners with (2k-1) Stretch.

Ruoxu Cen, Ran Duan, Yong Gu

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

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

Ruoxu Cen, Ran Duan

CoRR, 2019