|
Dongdong Ge
Office: Terman 328 Email: Dongdong@stanford.edu
|
Major:
Operation
Research
Advisor: Yinyu Ye Interesting Fields:
|
Education:
Stanford university
PhD
student June 2004-present in MS&E
Advisor:
Yinyu Ye
State
University of New York at Stony Brook
MA in mathematics, 1999-2001
Computer science 2002-June 2004
Nankai
University, P. R.
China
BA in mathematics, 1995-1999
MS&E 310 Linear Programming (2007)
MS&E211 Linear and nonlinear optimization (2005, 2006, 2007)
The Fixed-Hub Single Allocation Problem: A Geometric Rounding Approach. (2007)
Click PDF file . (research supported by Boeing). Submitted.
Solving Min-Max Multi-Depot Vehicle Routing Problem. (2007)
Click PDF file . (research supported by the Boeing company). Submitted.
The Cost of Cache-Oblivious Searching (2007)
Michael Bender, Gerth Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro Lopez-Ortiz. Submitted.
Improved Bounds on Sorting with Length-Weighted Reversals. (2006)
Michael Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Pinter, Steven Skiena, Firas Swidan .
Accepted by Journal of computer and system sciences (JCSS)
"Algorithms
on signed circular reversal sorting." (2004)
Firas Swidan, Michael Bender, Dongdong Ge, Haodong Hu, Simai He, Ron Pinter
The Fifteenth Annual Symposium on Combinatorial Pattern Matching (CPM 2004)
Lecture Notes in Computer Science (LNCS), Vol. 3109, July 2004, pp. 32-46.
"Improved Approximation Algorithms for the Freeze-Tag Problem"
Esther Arkin, Michael Bender, Dongdong Ge, Simai He, Joseph Mitchell
15th Annual ACM Symposium on Parallelism in Algorithms and Architecture (SPAA), 2003
"The Cost of Cache-Oblivious
Searching"
Michael Bender, Gerth Brodal, Rolf Fagerberg, Dongdong Ge, Simai
He,Haodong Hu, John Iacono, Alejandro Lopez-Ortiz
In 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Page 271-282, 2003
"Improved Bounds on Sorting with
Length-Weighted Reversals"
Michael Bender, Dongdong Ge, Simai He, Haodong
Hu, Ron Pinter, Steven Skiena, Firas Swidan
In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004
The geometric rounding and its applications on Combinatorial Auction.
Solving the intermodal vehicle routing problem.
Contact:
Dept of MS&E, Stanford university, Stanford, CA, 94305
dongdong@stanford.edu