A note on the complexity of L p minimization D Ge, X Jiang, Y Ye Mathematical programming 129 (2), 285-299, 2011 | 277 | 2011 |

Complexity of unconstrained minimization X Chen, D Ge, Z Wang, Y Ye Mathematical Programming 143 (1), 371-383, 2014 | 130 | 2014 |

Solving min-max multi-depot vehicle routing problem J Carlsson, D Ge, A Subramaniam, A Wu, Y Ye Lectures on global optimization 55, 31-46, 2009 | 101 | 2009 |

A review of piecewise linearization methods MH Lin, JG Carlsson, D Ge, J Shi, JF Tsai Mathematical problems in Engineering 2013, 2013 | 87 | 2013 |

The cost of cache-oblivious searching MA Bender, GS Brodal, R Fagerberg, D Ge, S He, H Hu, J Iacono, ... Algorithmica 61 (2), 463-505, 2011 | 49 | 2011 |

A note on appointment scheduling with piecewise linear cost functions D Ge, G Wan, Z Wang, J Zhang Mathematics of Operations Research 39 (4), 1244-1251, 2014 | 41 | 2014 |

Sorting by length-weighted reversals: Dealing with signs and circularity F Swidan, MA Bender, D Ge, S He, H Hu, RY Pinter Annual Symposium on Combinatorial Pattern Matching, 32-46, 2004 | 39 | 2004 |

Improved bounds on sorting by length-weighted reversals MA Bender, D Ge, S He, H Hu, RY Pinter, S Skiena, F Swidan Journal of Computer and System Sciences 74 (5), 744-774, 2008 | 38 | 2008 |

Improved bounds on sorting with length-weighted reversals. MA Bender, D Ge, S He, H Hu, RY Pinter, S Skiena, F Swidan SODA 4, 919-928, 2004 | 34 | 2004 |

Improved approximation algorithms for the freeze-tag problem EM Arkin, MA Bender, D Ge Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and …, 2003 | 25 | 2003 |

A genetic algorithm-based method for look-ahead scheduling in the finishing phase of construction projects N Dong, D Ge, M Fischer, Z Haddad Advanced Engineering Informatics 26 (4), 737-748, 2012 | 23 | 2012 |

A nonasymptotic approach to analyzing kidney exchange graphs Y Ding, D Ge, S He, CT Ryan Operations Research 66 (4), 918-935, 2018 | 20 | 2018 |

On equivalence of semidefinite relaxations for quadratic matrix programming Y Ding, D Ge, H Wolkowicz Mathematics of Operations Research 36 (1), 88-104, 2011 | 19 | 2011 |

Strong np-hardness for sparse optimization with concave penalty functions Y Chen, D Ge, M Wang, Z Wang, Y Ye, H Yin Proceedings of the 34th International Conference on Machine Learning-Volume …, 2017 | 15 | 2017 |

Interior-point methods strike back: Solving the wasserstein barycenter problem D Ge, H Wang, Z Xiong, Y Ye arXiv preprint arXiv:1905.12895, 2019 | 14 | 2019 |

On doubly positive semidefinite programming relaxations D Ge, Y Ye Manuscript, Availabe at http://www. optimizationonline. org/DB HTML/2010/08 …, 2010 | 14* | 2010 |

Strong NP-hardness result for regularized Lq-minimization problems with concave penalty functions D Ge, Z Wang, Y Ye, H Yin arXiv preprint arXiv:1501.00622, 2015 | 9 | 2015 |

Strong NP-hardness result for regularized Lq-minimization problems with concave penalty functions D Ge, Z Wang, Y Ye, H Yin arXiv preprint arXiv:1501.00622, 2015 | 9 | 2015 |

Optimization theory, methods, and applications in engineering 2013 JF Tsai, JG Carlsson, D Ge, YC Hu, J Shi Mathematical problems in engineering 2014, 2014 | 7 | 2014 |

The fixed-hub single allocation problem: a geometric rounding approach D Ge, Y Ye, J Zhang Preprint available at http://www. stanford. edu/yyye/revisedHub. pdf, 2007 | 6 | 2007 |