Deshi Ye
Department of Mathematics
Zhejiang University
Hangzhou 310027
China
E-mail: deshiye "at" hotmail.com
Curriculum
Vitae
July 1999, Bachelor of Science (BSc) in Applied Mathematics at Zhejiang University.
Since September. 1999, Ph. D. student in Operations Research at Zhejiang University.
August -- September 2003, Attending German Courses in Carl Duisberg Centrum Cologne, Germany.
October 2003 -- September 2004, Ph.D. Student in Computer Science and applied Mathematics at University of Kiel, Germany. (DAAD scholarship holder (Sandwich type)).
Research Interests
On-line algorithms and approximation algorithms for
NP-hard optimization problems
Design and analysis of algorithms
Scheduling and bin packing problems
Publications
D. Ye and G. Zhang, On-line scheduling of parallel jobs,
Proceedings of the 11th Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer LNCS 3104, 279-290, 2004.
D. Ye and H. Zhang, The range assignment problem in static ad-hoc networks on metric spaces, Proceedings of the 11th Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer LNCS 3104, 291-302, 2004.
D. Ye and G. Zhang, On-line extensible bin packing with unequal bin sizes, Proceedings of the First Workshop on Approximation and Online Algorithms (WAOA), Springer LNCS 2909, 235-247, 2003.
D. Ye and G. Zhang, On-line scheduling of parallel jobs with dependencies on 2-dimensional meshes, Proceedings of the 14th International Symposium on Algorithms and Computation (ISAAC), Springer LNCS 2906, 329-338, 2003.
D. Ye and G. Zhang, On-line scheduling with extendable working time on a small number of machines, Information Processing Letters 85, 171-177, 2003.
G. Zhang and D. Ye, A note on on-line scheduling with partial information,
Computers and Mathematics with Applications 44, 539-543, 2002.
