| Tight absolute bound for First Fit Decreasing bin-packing: FFD (L)⩽ 11/9 OPT (L)+ 6/9 G Dósa, R Li, X Han, Z Tuza Theoretical Computer Science 510, 13-61, 2013 | 95 | 2013 |
| Scheduling on parallel identical machines with late work criterion: Offline and online cases X Chen, M Sterna, X Han, J Blazewicz Journal of Scheduling 19, 729-736, 2016 | 65 | 2016 |
| Harmonic algorithm for 3-dimensional strip packing problem N Bansal, X Han, K Iwama, M Sviridenko, G Zhang SODA 7, 1197-1206, 2007 | 56* | 2007 |
| A note on online strip packing D Ye, X Han, G Zhang Journal of Combinatorial Optimization 17 (4), 417-423, 2009 | 51 | 2009 |
| Randomized algorithms for online knapsack problems X Han, Y Kawase, K Makino Theoretical Computer Science 562, 395-405, 2015 | 49 | 2015 |
| A new upper bound 2.5545 on 2d online bin packing X Han, FYL Chin, HF Ting, G Zhang, Y Zhang ACM Transactions on Algorithms (TALG) 7 (4), 1-18, 2011 | 45 | 2011 |
| Deadline scheduling and power management for speed bounded processors X Han, TW Lam, LK Lee, IKK To, PWH Wong Theoretical Computer Science 411 (40-42), 3587-3600, 2010 | 44 | 2010 |
| A note on a selfish bin packing problem R Ma, G Dósa, X Han, HF Ting, D Ye, Y Zhang Journal of Global Optimization 56 (4), 1457-1462, 2013 | 40 | 2013 |
| Strip packing vs. bin packing X Han, K Iwama, D Ye, G Zhang Algorithmic Aspects in Information and Management: Third International …, 2007 | 38 | 2007 |
| Online unweighted knapsack problem with removal cost X Han, Y Kawase, K Makino Algorithmica 70 (1), 76-91, 2014 | 36 | 2014 |
| Online multiple-strip packing D Ye, X Han, G Zhang Theoretical Computer Science 412 (3), 233-239, 2011 | 35 | 2011 |
| Online minimization knapsack problem X Han, K Makino Approximation and Online Algorithms: 7th International Workshop, WAOA 2009 …, 2010 | 34 | 2010 |
| Online removable square packing X Han, K Iwama, G Zhang Theory of Computing Systems 43 (1), 38-55, 2008 | 29 | 2008 |
| Online removable knapsack problem under convex function X Han, Y Kawase, K Makino, H Guo Theoretical Computer Science 540, 62-69, 2014 | 27 | 2014 |
| A note on online hypercube packing X Han, D Ye, Y Zhou Central European Journal of Operations Research 18 (2), 221-239, 2010 | 27 | 2010 |
| Semi-online hierarchical scheduling problems with buffer or rearrangements X Chen, Z Xu, G Dósa, X Han, H Jiang Information Processing Letters 113 (4), 127-131, 2013 | 26 | 2013 |
| Online removable knapsack with limited cuts X Han, K Makino Theoretical Computer Science 411 (44-46), 3956-3964, 2010 | 26 | 2010 |
| On-line multiple-strip packing D Ye, X Han, G Zhang Combinatorial Optimization and Applications: Third International Conference …, 2009 | 26 | 2009 |
| Optimal algorithms for online scheduling with bounded rearrangement at the end X Chen, Y Lan, A Benko, G Dósa, X Han Theoretical Computer Science 412 (45), 6269-6278, 2011 | 24 | 2011 |
| An expedient approach to highly enantioenriched cyclic nitrones mediated by robust and recoverable C 3-symmetric cinchonine-squaramide catalysts X Han, X Wu, C Min, HB Zhou, C Dong RSC advances 2 (19), 7501-7505, 2012 | 23 | 2012 |
