dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Hong Zhu (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu: Greedy online frequency allocation in cellular networks. Inf. Process. Lett. 102(2-3): 55-61 (2007)
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu: Efficient algorithms for finding a longest common increasing subsequence. J. Comb. Optim. 13(3): 277-288 (2007)
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu: Frequency Allocation Problems for Linear Cellular Networks. ISAAC 2006: 61-70
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen, Prudence W. H. Wong: A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time. J. Comb. Optim. 11(2): 177-187 (2006)
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen, Prudence W. H. Wong: Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling. COCOON 2005: 318-328
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu: Efficient Algorithms for Finding a Longest Common Increasing Subsequence. ISAAC 2005: 665-674

Selection of 6 from 208 records - Hong Zhu has 229 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page