| Tight absolute bound for first fit decreasing bin-packing: FFD (l)⩽ 11/9OPT (L)+ 6/9 G Dósa, R Li, X Han, Z Tuza Theoretical Computer Science 510, 13-61, 2013 | 50 | 2013 |
| Harmonic algorithm for 3-dimensional strip packing problem N Bansal, X Han, K Iwama, M Sviridenko, G Zhang Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007 | 44* | 2007 |
| 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 | 42 | 2010 |
| A note on online strip packing D Ye, X Han, G Zhang Journal of Combinatorial Optimization 17 (4), 417-423, 2009 | 38 | 2009 |
| 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 | 30 | 2013 |
| 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), 50, 2011 | 28 | 2011 |
| Online minimization knapsack problem X Han, K Makino International Workshop on Approximation and Online Algorithms, 182-193, 2009 | 28 | 2009 |
| Strip packing vs. bin packing X Han, K Iwama, D Ye, G Zhang International Conference on Algorithmic Applications in Management, 358-367, 2007 | 24 | 2007 |
| Strip packing vs. bin packing X Han, K Iwama, D Ye, G Zhang International Conference on Algorithmic Applications in Management, 358-367, 2007 | 24 | 2007 |
| On-line multiple-strip packing D Ye, X Han, G Zhang International Conference on Combinatorial Optimization and Applications, 155-165, 2009 | 22 | 2009 |
| A fast asymptotic approximation scheme for bin packing with rejection W Bein, JR Correa, X Han Theoretical Computer Science 393 (1-3), 14-22, 2008 | 22 | 2008 |
| A note on online hypercube packing X Han, D Ye, Y Zhou Central European Journal of Operations Research 18 (2), 221-239, 2010 | 21 | 2010 |
| Online removable square packing X Han, K Iwama, G Zhang Theory of Computing Systems 43 (1), 38-55, 2008 | 21 | 2008 |
| 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 | 20 | 2012 |
| Online scheduling with rearrangement on two related machines G Dósa, Y Wang, X Han, H Guo Theoretical Computer Science 412 (8-10), 642-653, 2011 | 20 | 2011 |
| Online multiple-strip packing D Ye, X Han, G Zhang Theoretical Computer Science 412 (3), 233-239, 2011 | 19 | 2011 |
| Randomized algorithms for online knapsack problems X Han, Y Kawase, K Makino Theoretical Computer Science 562, 395-405, 2015 | 17 | 2015 |
| Randomized algorithms for online knapsack problems X Han, Y Kawase, K Makino Theoretical Computer Science 562, 395-405, 2015 | 17 | 2015 |
| 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 | 16 | 2011 |
| Online unweighted knapsack problem with removal cost X Han, Y Kawase, K Makino Algorithmica 70 (1), 76-91, 2014 | 15 | 2014 |
