Homepage

Ran Duan

Email: Get my email address via email
Phone: +49 681 9325 1009
Fax: +49 681 9325 199

Ran Duan, Seth Pettie, Hsin-Hao Su: Scaling Algorithms for Approximate and Exact Maximum Weight Matching
In Submisson. arXiv
Ran Duan, Hsin-Hao Su: A Scaling Algorithm for Maximum Weight Matching in Bipartite Graphs
To appear in Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA '12)
Ran Duan, Seth Pettie: Approximating Maximum Weight Matching in Near-linear Time
In Proceedings of the 51st IEEE Symposium on Foundations of Computer Science (FOCS '10)
Ran Duan: New Data Structures for Subgraph Connectivity
In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP '10)
Ran Duan, Seth Pettie: Connectivity Oracles for Failure Prone Graphs
In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC '10)
Ran Duan, Seth Pettie: Dual-Failure Distance and Connectivity Oracles
In Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA '09)
Ran Duan, Seth Pettie: Fast Algorithms for (Max,Min)-Matrix Multiplication and Bottleneck Shortest Paths
In Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA '09)
Ran Duan, Seth Pettie: Bounded-leg Distance and Reachability Oracles
In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA '08)

September 2006 - August 2011:
Ph. D. student in Computer Science and Engineering at the University of Michigan, Ann Arbor, Michigan, US.
Title of Ph. D.'s Thesis: New Algorithms for Some Basic Graph Optimization Problems (supervisor: Prof. Dr. Seth Pettie)

September 2002 - July 2006:
Studies in Computer Science at the Tsinghua University, Beijing, China