Ran Duan
Ran Duan
Verified email at mail.tsinghua.edu.cn - Homepage
Title
Cited by
Cited by
Year
Linear-time approximation for maximum weight matching
R Duan, S Pettie
Journal of the ACM (JACM) 61 (1), 1-23, 2014
1582014
A scaling algorithm for maximum weight matching in bipartite graphs
R Duan, HH Su
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
842012
Dual-failure distance and connectivity oracles
R Duan, S Pettie
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
812009
Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths
R Duan, S Pettie
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
802009
Approximating maximum weight matching in near-linear time
R Duan, S Pettie
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 673-682, 2010
642010
Scaling algorithms for weighted matching in general graphs
R Duan, S Pettie, HH Su
ACM Transactions on Algorithms (TALG) 14 (1), 1-35, 2018
402018
A combinatorial polynomial algorithm for the linear Arrow–Debreu market
R Duan, K Mehlhorn
Information and Computation 243, 112-132, 2015
302015
Connectivity oracles for failure prone graphs
R Duan, S Pettie
Proceedings of the forty-second ACM Symposium on Theory of Computing, 465-474, 2010
272010
An improved combinatorial polynomial algorithm for the linear Arrow-Debreu market
R Duan, J Garg, K Mehlhorn
Proceedings of the twenty-seventh annual ACM-SIAM symposium on discrete …, 2016
252016
Scaling algorithms for approximate and exact maximum weight matching
R Duan, S Pettie, HH Su
arXiv preprint arXiv:1112.0790, 2011
242011
Connectivity oracles for graphs subject to vertex failures
R Duan, S Pettie
SIAM Journal on Computing 49 (6), 1363-1396, 2020
202020
New data structures for subgraph connectivity
R Duan
International Colloquium on Automata, Languages, and Programming, 201-212, 2010
162010
Dynamic edge coloring with improved approximation
R Duan, H He, T Zhang
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
152019
A combinatorial polynomial algorithm for the linear Arrow-Debreu market
R Duan, K Mehlhorn
International Colloquium on Automata, Languages, and Programming, 425-436, 2013
152013
Approximation algorithms for the gromov hyperbolicity of discrete metric spaces
R Duan
Latin American Symposium on Theoretical Informatics, 285-293, 2014
102014
Improved distance sensitivity oracles via tree partitioning
R Duan, T Zhang
Workshop on Algorithms and Data Structures, 349-360, 2017
72017
Bounded-leg distance and reachability oracles.
R Duan, S Pettie
SODA 8, 436-445, 2008
62008
Faster algorithms for all pairs non-decreasing paths problem
R Duan, C Jin, H Wu
arXiv preprint arXiv:1904.10701, 2019
52019
Approximating all-pair bounded-leg shortest path and apsp-af in truly-subcubic time
R Duan, H Ren
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
52018
An improved algorithm for incremental DFS tree in undirected graphs
L Chen, R Duan, R Wang, H Zhang, T Zhang
arXiv preprint arXiv:1607.04913, 2016
52016
The system can't perform the operation now. Try again later.
Articles 1–20