Follow
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
2202014
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
922012
Dual-failure distance and connectivity oracles
R Duan, S Pettie
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
922009
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
862009
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
722010
Scaling algorithms for weighted matching in general graphs
R Duan, S Pettie, HH Su
ACM Transactions on Algorithms (TALG) 14 (1), 1-35, 2018
572018
A combinatorial polynomial algorithm for the linear Arrow–Debreu market
R Duan, K Mehlhorn
Information and Computation 243, 112-132, 2015
432015
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
422016
Connectivity oracles for failure prone graphs
R Duan, S Pettie
Proceedings of the forty-second ACM Symposium on Theory of Computing, 465-474, 2010
312010
Connectivity oracles for graphs subject to vertex failures
R Duan, S Pettie
SIAM Journal on Computing 49 (6), 1363-1396, 2020
302020
Scaling algorithms for approximate and exact maximum weight matching
R Duan, S Pettie, HH Su
arXiv preprint arXiv:1112.0790, 2011
242011
New data structures for subgraph connectivity
R Duan
International Colloquium on Automata, Languages, and Programming, 201-212, 2010
192010
Dynamic edge coloring with improved approximation
R Duan, H He, T Zhang
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
172019
A combinatorial polynomial algorithm for the linear Arrow-Debreu market
R Duan, K Mehlhorn
International Colloquium on Automata, Languages, and Programming, 425-436, 2013
142013
Improved distance sensitivity oracles via tree partitioning
R Duan, T Zhang
Workshop on Algorithms and Data Structures, 349-360, 2017
122017
Approximation algorithms for the Gromov hyperbolicity of discrete metric spaces
R Duan
Latin American Symposium on Theoretical Informatics, 285-293, 2014
112014
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
102016
Improved algorithms for maintaining DFS tree in undirected graphs
L Chen, R Duan, R Wang, H Zhang
CoRR, abs/1607.04913, 2016
92016
Faster algorithms for all pairs non-decreasing paths problem
R Duan, C Jin, H Wu
arXiv preprint arXiv:1904.10701, 2019
82019
Faster randomized worst-case update time for dynamic subgraph connectivity
R Duan, L Zhang
Workshop on Algorithms and Data Structures, 337-348, 2017
8*2017
The system can't perform the operation now. Try again later.
Articles 1–20