Profile :   From  2004 to 2007, he received his doctoral degree on computer science

         from Graduate School of Information, Kyoto University, Japan.

         From  2007 to  2008, he worked at  The University of Hong Kong as a post-doc.

    From 2008 to 2010, he worked at department of mathematical Informatics, graduate school of information technology, Univerity of Tokyo as a post-doc. 

        From 2010 to 2015,  he worked at School of Software of Dalian University of Technology    as an associate professor.

       From 2016 to now, he is working at the same university as a full professor.

Research: His research interests include Algorithm Design and Analysis, especially,

for on-line and approximational Algorithm(strip packing, bin packing, knapsack, scheduling problems etc).

Selected Publications:

• Xin Han, Liang Zhao, Zhishan Guo, Xingwu Liu:
  An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines Under Dynamic Priority Scheduling. RTSS 2018: 447-455

• 
  

• Xin Han, Yasushi Kawase, Kazuhisa Makino:
  Randomized algorithms for online knapsack problems. Theor. Comput. Sci. 562: 395-405 (2015)
  
  

• Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang:
  A Harmonic Algorithm for the 3D Strip Packing Problem. SIAM J. Comput. 42(2): 579-592 (2013)
  
  

• Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang, Yong Zhang:
  A new upper bound 2.5545 on 2D Online Bin Packing. ACM Trans. Algorithms 7(4): 50:1-50:18 (2011)
  
  

•