Guochuan Zhang
Loading Google Thumbnails...
| 2011 |
| 7 | A new upper bound 2.5545 on 2D Online Bin Packing. Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang, Yong Zhang. ACM Transactions on Algorithms (7): 50 (2011). Web SearchBibTeXDownload |
| 6 | Mechanisms for Obnoxious Facility Game on a Path. Yukun Cheng, Wei Yu, Guochuan Zhang. COCOA 2011, 262-271. Web SearchBibTeXDownload |
| 5 | Improved Approximation Algorithms for Routing Shop Scheduling. Wei Yu, Guochuan Zhang. ISAAC 2011, 30-39. Web SearchBibTeXDownload |
| 2009 |
| 4 | A New Upper Bound on 2D Online Bin Packing. Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang. CoRR (abs/0906.0409) (2009). Web SearchBibTeXDownload |
| 2008 |
| 3 | On-line scheduling of parallel jobs on two machines. Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, Yong Zhang. J. Discrete Algorithms (6): 3-10 (2008). Web SearchBibTeXDownload |
| 2007 |
| 2 | Online bin packing of fragile objects with application in cellular networks. Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, Yong Zhang. J. Comb. Optim. (14): 427-435 (2007). Web SearchBibTeXDownload |
| 2005 |
| 1 | Online Bin Packing of Fragile Objects with Application in Cellular Networks. Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, Yong Zhang. WINE 2005, 564-573. Web SearchBibTeXDownload |
from DBLP and Google Scholar