Yong Zhang

 

BSc, PhD Fudan University

 

Contact Address


Department of Computer Science
The University of Hong Kong
Pokfulam Road
Hong Kong

E-mail: yzhang {at} cs {dot} hku {dot} hk
Tel: +852 - 2857 8465
Fax: +852 - 2559 8447 

 

Research Interests 

 

 



Publications 

 

Journal Publications:

 

1-Space Bounded Algorithms for 2-Dimensional Bin Packing

To appear in International Journal of Foundation of Computer Science.

 

Online Tree Node Assignment with Resource Augmentation

to appear in Journal of Combinatorial Optimization.

 

·         Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye and Yong Zhang,

Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks

Algorithmica, 58,(2): 498-515, 2010.

 

A constant-competitive algorithm for online OVSF code assignment

Algorithmica, 56(1): 89-104, 2010.

 

Online Problems for Frequency Assignment and OVSF Code Assignment in Wireless Communication Networks

SIGACT News Vol. 40(3), pp. 86-98, 2009.

 

A note on On-line Broadcast Scheduling with Deadlines

Information Processing Letters, 109(3): 204-207 (2009).

 

A 1-local Asymptotic 13/9-competitive Algorithm for Multicoloring Hexagonal Graphs

Algorithmica, (2009) 54:557-567.

 

On-line Scheduling of Parallel Jobs on Two Machines

Journal of Discrete Algorithms, 6(1): 3-10, March, 2008.

 

Online Bin Packing of Fragile Objects with Application in Cellular Networks

Journal of Combinatorial Optimization, 14(4):427-435, November 2007.

 

Greedy Online Frequency Allocation in Cellular Networks

Information Processing Letters, 102(2007), 55-61.

 

Efficient Algorithms for Finding Longest Common Increasing Subsequence

Journal of Combinatorial Optimization, 13(3):277-288, April 2007

 

Approximating the Minimal Weight Weak Vertex Cover

Theoretical Computer Science 363(2006) 99-105.

 

A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time

Journal of Combinatorial Optimization, 2006, 11(2):177-1874.

 

Approximation Algorithms for the Problems of Weak Set Cover (in Chinese)

Chinese Journal of Computers, 2005, 28(9):1497-1500.

 

Approximation Algorithm for Weighted Weak Vertex Cover

Journal of Computer Science and Technology, 2004,19(6):782-786

 

 

Conference Publications:

 

·         Yong Zhang , Jingchi Chen, Francis Y.L. Chin , Xin Han, Hingfung Ting and Yung H. Tsin,

Improved Algorithms for 1-Space Bounded 2-Dimensional Bin Packing

In Proc. of the 21st International Symposium on Algorithms and Computation (ISAAC 2010), LNCS 6507, pp. 242-253.

 

·         Yong Zhang, Zhuo Chang, Francis Y.L. Chin, Hing-Fung Ting, and Yung H. Tsin,

Online Uniformly Inserting Points on Grid

In Proc. of the Sixth International Conference on Algorithmic Aspects in Information and Management (AAIM 2010), LNCS 6124, pp. 281-292

 

·         Yong Zhang, Francis Y.L. Chin, and Hing-Fung Ting,

Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

In Proc. of the 16th Annual International Computing and Combinatorics Conference (COCOON 2010), LNCS 6196, pp. 100-109.

 

·         Joseph Chan, Francis Chin, Xin Han, Ka-Cheong Lam, Hing-Fung Ting and Yong Zhang,

Deterministic Online Call Control in Cellular Networks and Triangle-Free Networks

In Proc.of the Fourth International Frontiers of Algorithmics Workshop (FAW 2010), LNCS 6213, pp. 222-233.

 

·         Ming-Yang Kao, Henry Leung, He Sun, Yong Zhang,

Deterministic Polynomial-Time Algorithms for Designing Short DNA Words

In Proc. of the 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), LNCS 6108, pp. 308-319.

 

·         Francis Y. L. Chin, Hingfung Ting, Yong Zhang,

1-Space Bounded Algorithms for 2-Dimensional Bin Packing

In Proc. of the 20th Annual International Symposium on Algorithms and Computation (ISAAC 2009), LNCS 5878, pp. 321-330.

 

·         Joseph Wun-Tat Chan, Francis Y. L. Chin, Hingfung Ting, Yong Zhang,

Online Tree Node Assignment with Resource Augmentation, 

In Proc. of the 15th International Computing and Combinatorics Conference (COCOON 2009), LNCS 5609, pp.358-367.

 

·         Francis Y. L. Chin, Hingfung Ting, Yong Zhang,

Variable-Size Rectangle Covering

In Proc. of the third Annual International Conference on Combinatorial Optimization and Applications (COCOA'09), LNCS 5573, pp. 145-154.

 

·         Francis Y. L. Chin, Hingfung Ting, Yong Zhang,

A constant-competitive algorithm for online OVSF code assignment

In Proc. of the 18th Annual International Symposium on Algorithms and Computation (ISAAC 2007), LNCS 4835, pp. 452-463.

 

Online Frequency Allocation in Cellular Networks

In Proc. of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '07), pp. 241-249.

 

A 1-local 4/3-competitive Algorithm for Multicoloring Triangle-free Hexagonal Graphs

In proc. of the 13th Annual International Computing and Combinatorics Conference (COCOON 2007), LNCS 4598, pp. 526-536.

 

Online OVSF Code Assignment with Resource Augmentations

In Proc. of the third International Conference on Algorithmic Aspects in Information and Management (AAIM 2007), LNCS 4508, pp. 191?00.

 

Frequency Allocation Problem for Linear Cellular Networks

In Proc. of the 17th Annual International Symposium on Algorithms and Computation (ISAAC 2006), India. LNCS 4288, 61-70.

 

Efficient Algorithms for Finding Longest Common Increasing Subsequence

In Proc. Of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), LNCS 3827, 665-674. 

 

Online Bin Packing of Fragile Objects with Application in Cellular Networks

In Proc. of the first Workshop on Internet and Network Economics (WINE 2005). LNCS 3828, 564-573

 

On-line Scheduling of Parallel Jobs on Two Machines

In Proc. of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA 2005), pp.369-380.

 

Off-line Algorithms for Minimizing the Total Flow Time in Broadcast Scheduling

In Proc. Of the 11th Annual International Computing and Combinatorics Conference (COCOON 2005), LNCS 3595, 318-328.

 

An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs

In Proc. of the 10th Annual International Computing and Combinatorics Conference (COCOON 2004), LNCS 3106, pp.143-150.

 

Building Semantic Peer-to-peer Networks Upon CAN

In Proc of the 5th International Workshop on Networked Group Communications (NGC2003), LNCS 2816, pp95-106.

 


Projects 

 

 

2010-2011    Network Discover in Wireless Communication Networks,

PI, IIPL-2010-010

Founder: Shanghai Key Laboratory of Intelligent Information Processing

 

2010-2011    Online Optimization Algorithms on Wireless Communication Networks, 

                     Co-I, Small Project Funding

                     Founder: The University of Hong Kong

 

 

Want to rent a house in Singapore? Try Nestia , a new key to your rental! 

说明: Macintosh HD:Users:abc:Dropbox:屏幕截图:屏幕截图 2015-07-14 10.34.08.png

 

说明: Macintosh HD:Users:abc:Dropbox:屏幕截图:屏幕截图 2015-07-14 10.40.09.png

 

说明: Macintosh HD:Users:abc:Dropbox:屏幕截图:屏幕截图 2015-07-14 10.40.26.png

 

 

说明: Macintosh HD:Users:abc:Dropbox:屏幕截图:屏幕截图 2015-07-14 10.40.38.png