Scholar
Cen Ruoxu
Google Scholar ID: ezVy6UUAAAAJ
Duke University
Citations & Impact
Citations
98
H-index
6
i10-index
5
Publications
12
Co-authors
0
Contact
No contact links provided.
Publications
Browse publications on Google Scholar (top-right) ↗
Resume (English only)
Academic Achievements
- Publications:
- - Fast Algorithms for Graph Arboricity and Related Problems, FOCS 2025
- - Network Unreliability in Almost Linear Time, STOC 2025
- - Hypergraph Unreliability in Quasi-Polynomial Time, STOC 2024
- - Beyond the Quadratic Time Barrier for Network Unreliability, SODA 2024
- - Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows, SODA 2023
- - Edge Connectivity Augmentation in Near-Linear Time, STOC 2022
- - Augmenting Edge Connectivity via Isolating Cuts, SODA 2022
- - Minimum Cuts in Directed Graphs via Partial Sparsification, FOCS 2021
- - Sparsification of Directed Graphs via Cut Balance, ICALP 2021
- - Roundtrip Spanners with (2k-1) Stretch, ICALP 2020
Research Experience
- Currently a fifth-year PhD student at Duke University, working on graph algorithms.
Education
- PhD student at Duke University, advisor: Prof. Debmalya Panigrahi; Bachelor's degree from Yao Class at Tsinghua University
Background
- Research interest: graph algorithms in theoretical computer science; professional field: graph connectivity and network reliability; brief introduction: the goal is to design efficient graph algorithms that are close to linear time, in response to the explosive growth in the size of modern networks.
Co-authors