default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRuoxu Cen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Beyond the Quadratic Time Barrier for Network Unreliability. SODA 2024: 1542-1567- [c7]Ruoxu Cen
, Jason Li, Debmalya Panigrahi:
Hypergraph Unreliability in Quasi-Polynomial Time. STOC 2024: 1700-1711 - [i9]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Hypergraph Unreliability in Quasi-Polynomial Time. CoRR abs/2403.18781 (2024) - 2023
- [c6]Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. SODA 2023: 2449-2488 - [i8]Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Beyond the Quadratic Time Barrier for Network Unreliability. CoRR abs/2304.06552 (2023) - 2022
- [c5]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Augmenting Edge Connectivity via Isolating Cuts. SODA 2022: 3237-3252 - [c4]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Edge connectivity augmentation in near-linear time. STOC 2022: 137-150 - [i7]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Edge Connectivity Augmentation in Near-Linear Time. CoRR abs/2205.04636 (2022) - [i6]Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. CoRR abs/2211.05769 (2022) - 2021
- [c3]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud:
Minimum Cuts in Directed Graphs via Partial Sparsification. FOCS 2021: 1147-1158 - [c2]Ruoxu Cen, Yu Cheng, Debmalya Panigrahi, Kevin Sun:
Sparsification of Directed Graphs via Cut Balance. ICALP 2021: 45:1-45:21 - [i5]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Minimum Cuts in Directed Graphs via √n Max-Flows. CoRR abs/2104.07898 (2021) - [i4]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Augmenting Edge Connectivity via Isolating Cuts. CoRR abs/2111.02361 (2021) - [i3]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak:
Minimum Cuts in Directed Graphs via Partial Sparsification. CoRR abs/2111.08959 (2021) - 2020
- [c1]Ruoxu Cen, Ran Duan, Yong Gu:
Roundtrip Spanners with (2k-1) Stretch. ICALP 2020: 24:1-24:11 - [i2]Ruoxu Cen, Yu Cheng, Debmalya Panigrahi, Kevin Sun:
Sparsification of Directed Graphs via Cut Balance. CoRR abs/2006.01975 (2020)
2010 – 2019
- 2019
- [i1]Ruoxu Cen, Ran Duan:
Roundtrip Spanners with $(2k-1)$ Stretch. CoRR abs/1911.12411 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
