Kun He
Professor
Computer Science
Huazhong University of Science and Technology
China
Biography
Ph.D. in System Engineering Huazhong University of Science and Technology, 2006 M.E. in Computer Science Huazhong Normal University, 2002 B.S. in Physics Wuhan University, 1989 At since 2006, Associate Professor (~ ) ,Assistant Professor(2008 ~ 2010), Post Doctorate (2006 ~ 2008) At Cornell University, Department of Computer Science, Visiting Associate Professor (Jan. 2012 ~ May 2013 At Stanford University, Management Science and Engineering Department, Visiting Scholar (Aug. 2011 ~ Aug. 2012)
Research Interest
Algorithms for NP hard problems, combinatorial optimization Including algorithms for packing problem, scheduling problem, floorplanning problem, SAT problem, etc.  Data mining and machine learning Including social network, high dimension data, deep lear
Publications
-
Wenqi Huang, Kun He*. On the weak computability of a four-dimensional orthogonal packing and time scheduling problem. Theoretical Computer Science, vol. 501(27): 1–10, 2013.
-
Kun He, Menglong Huang, Chenkai Yang. An action space based global optimization algorithm for packing circles into a square container, Computers & Operations Research, accepted.
-
Kun He, Pengli Ji, Chumin Li. A dynamic reduction algorithm for the rectangle packing area minimization problem. European Journal of Operational Research, DOI: 10.1016/j.ejor.2014.09.042, available online October 2014.
