关注
Ran Duan
Ran Duan
在 mail.tsinghua.edu.cn 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Linear-time approximation for maximum weight matching
R Duan, S Pettie
Journal of the ACM (JACM) 61 (1), 1-23, 2014
2692014
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
1072012
Dual-failure distance and connectivity oracles
R Duan, S Pettie
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
982009
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
932009
Faster matrix multiplication via asymmetric hashing
R Duan, H Wu, R Zhou
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
772023
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
762010
Scaling algorithms for weighted matching in general graphs
R Duan, S Pettie, HH Su
ACM Transactions on Algorithms (TALG) 14 (1), 1-35, 2018
732018
A combinatorial polynomial algorithm for the linear Arrow–Debreu market
R Duan, K Mehlhorn
Information and Computation 243, 112-132, 2015
512015
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
442016
Connectivity oracles for graphs subject to vertex failures
R Duan, S Pettie
SIAM Journal on Computing 49 (6), 1363-1396, 2020
362020
Connectivity oracles for failure prone graphs
R Duan, S Pettie
Proceedings of the forty-second ACM Symposium on Theory of Computing, 465-474, 2010
362010
Dynamic edge coloring with improved approximation
R Duan, H He, T Zhang
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
272019
Scaling algorithms for approximate and exact maximum weight matching
R Duan, S Pettie, HH Su
arXiv preprint arXiv:1112.0790, 2011
252011
New data structures for subgraph connectivity
R Duan
International Colloquium on Automata, Languages, and Programming, 201-212, 2010
192010
Faster min-plus product for monotone instances
S Chi, R Duan, T Xie, T Zhang
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
182022
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
132017
Approximation algorithms for the Gromov hyperbolicity of discrete metric spaces
R Duan
Latin American Symposium on Theoretical Informatics, 285-293, 2014
122014
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
112016
Maintaining exact distances under multiple edge failures
R Duan, H Ren
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
92022
系统目前无法执行此操作,请稍后再试。
文章 1–20