Ran Duan

761 total citations
18 papers, 274 citations indexed

About

Ran Duan is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Ran Duan has authored 18 papers receiving a total of 274 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computer Networks and Communications, 14 papers in Computational Theory and Mathematics and 4 papers in Artificial Intelligence. Recurrent topics in Ran Duan's work include Complexity and Algorithms in Graphs (12 papers), Advanced Graph Theory Research (9 papers) and Optimization and Search Problems (8 papers). Ran Duan is often cited by papers focused on Complexity and Algorithms in Graphs (12 papers), Advanced Graph Theory Research (9 papers) and Optimization and Search Problems (8 papers). Ran Duan collaborates with scholars based in United States, China and Germany. Ran Duan's co-authors include Seth Pettie, Hongxun Wu, Tianyi Zhang, Yi‐Jun Chang, Lijie Chen, Le Zhang and Ruosong Wang and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and ACM Transactions on Algorithms.

In The Last Decade

Ran Duan

16 papers receiving 264 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Ran Duan United States	7	153	138	67	30	28	18	274
Loukas Georgiadis Greece	10	128 0.8×	132 1.0×	65 1.0×	14 0.5×	19 0.7×	32	237
Prajakta Nimbhorkar India	6	71 0.5×	53 0.4×	83 1.2×	20 0.7×	42 1.5×	21	227
Naonori Kakimura Japan	8	171 1.1×	78 0.6×	48 0.7×	28 0.9×	8 0.3×	61	262
Yuval Filmus Israel	10	157 1.0×	78 0.6×	122 1.8×	37 1.2×	15 0.5×	53	300
Martha Sideri Greece	10	169 1.1×	132 1.0×	126 1.9×	16 0.5×	18 0.6×	18	348
Sepehr Assadi United States	12	156 1.0×	171 1.2×	110 1.6×	15 0.5×	16 0.6×	48	296
Glencora Borradaile United States	11	193 1.3×	94 0.7×	41 0.6×	42 1.4×	21 0.8×	31	293
Deepak Ajwani Ireland	9	47 0.3×	95 0.7×	101 1.5×	28 0.9×	54 1.9×	31	244
Anil Kamath United States	10	142 0.9×	204 1.5×	99 1.5×	49 1.6×	7 0.3×	13	333
Shlomi Rubinstein Israel	10	166 1.1×	108 0.8×	53 0.8×	30 1.0×	22 0.8×	14	314

Countries citing papers authored by Ran Duan

Since Specialization

Citations

This map shows the geographic impact of Ran Duan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ran Duan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ran Duan more than expected).

Fields of papers citing papers by Ran Duan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ran Duan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ran Duan. The network helps show where Ran Duan may publish in the future.

Co-authorship network of co-authors of Ran Duan

This figure shows the co-authorship network connecting the top 25 collaborators of Ran Duan. A scholar is included among the top collaborators of Ran Duan based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ran Duan. Ran Duan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

18 of 18 papers shown

1.

Duan, Ran, et al.. (2025). Breaking the Sorting Barrier for Directed Single-Source Shortest Paths. 36–44. 1 indexed citations

2.

Chang, Yi‐Jun, et al.. (2023). Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election. ACM Transactions on Algorithms. 19(4). 1–23. 1 indexed citations

3.

Duan, Ran, et al.. (2023). Faster Matrix Multiplication via Asymmetric Hashing. 2129–2138. 21 indexed citations

4.

Duan, Ran, et al.. (2023). A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs. 484–492. 5 indexed citations

5.

Duan, Ran, et al.. (2022). Faster min-plus product for monotone instances. 1529–1542. 7 indexed citations

6.

Chang, Yi‐Jun, et al.. (2021). Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election. 15. 162–172. 2 indexed citations

7.

Duan, Ran & Seth Pettie. (2020). Connectivity Oracles for Graphs Subject to Vertex Failures. SIAM Journal on Computing. 49(6). 1363–1396. 3 indexed citations

8.

Duan, Ran, et al.. (2019). Dynamic edge coloring with improved approximation. Symposium on Discrete Algorithms. 1937–1945. 2 indexed citations

9.

Duan, Ran, et al.. (2018). Scaling Algorithms for Weighted Matching in General Graphs. ACM Transactions on Algorithms. 14(1). 1–35. 19 indexed citations

10.

Duan, Ran, et al.. (2018). Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14.

11.

Chen, Lijie, et al.. (2018). An Improved Algorithm for Incremental DFS Tree in Undirected Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 12. 2 indexed citations

12.

Duan, Ran. (2014). A Simpler Scaling Algorithm for Weighted Matching in General Graphs.. arXiv (Cornell University).

13.

Duan, Ran & Seth Pettie. (2014). Linear-Time Approximation for Maximum Weight Matching. Journal of the ACM. 61(1). 1–23. 135 indexed citations

14.

Duan, Ran & Seth Pettie. (2010). Approximating Maximum Weight Matching in Near-Linear Time. 673–682. 25 indexed citations

15.

Duan, Ran & Seth Pettie. (2010). Connectivity oracles for failure prone graphs. 465–474. 4 indexed citations

16.

Duan, Ran & Seth Pettie. (2009). Dual-failure distance and connectivity oracles. Symposium on Discrete Algorithms. 506–515. 25 indexed citations

17.

Duan, Ran & Seth Pettie. (2009). Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths. Symposium on Discrete Algorithms. 384–391. 21 indexed citations

18.

Duan, Ran & Seth Pettie. (2008). Bounded-leg distance and reachability oracles. Symposium on Discrete Algorithms. 436–445. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact