| 2010 |
|---|
| 9 | Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks. Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang. Algorithmica (58): 498-515 (2010). Web SearchBibTeXDownload |
| 2008 |
|---|
| 8 | 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 |
|---|
| 7 | Greedy online frequency allocation in cellular networks. Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu. Inf. Process. Lett. (102): 55-61 (2007). Web SearchBibTeXDownload |
| 6 | 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 |
| 5 | Efficient algorithms for finding a longest common increasing subsequence. Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu. J. Comb. Optim. (13): 277-288 (2007). Web SearchBibTeXDownload |
| 4 | Online frequency allocation in cellular networks. Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang. SPAA 2007, 241-249. Web SearchBibTeXDownload |
| 2006 |
|---|
| 3 | Frequency Allocation Problems for Linear Cellular Networks. Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu. ISAAC 2006, 61-70. Web SearchBibTeXDownload |
| 2005 |
|---|
| 2 | Efficient Algorithms for Finding a Longest Common Increasing Subsequence. Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu. ISAAC 2005, 665-674. Web SearchBibTeXDownload |
| 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 |
