Books Edited:

• B. Chen, M. Paterson, and G. Zhang: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, LNCS 4614, Springer 2007.

Research Papers:

• J. Ding and G. Zhang, A note on online scheduling for jobs with arbitrary release times. Proceedings of the 3rd Annual International Conference on Combinatorial Optimization and Applications (COCOA), Springer LNCS 5573, 354-362, 2009.

• D. Ye, Xin Han, G. Zhang, On-line multiple-strip packing. Proceedings of the 3rd Annual International Conference on Combinatorial Optimization and Applications (COCOA), Springer LNCS 5573, 155-165, 2009.

• J.J. Paulus, D. Ye, and G. Zhang, Optimal online-list batch scheduling. Information Processing Letters 109, 1125-1128, 2009.

• G. Yu and G. Zhang, Scheduling with a minimum number of machines. Operations Research Letters 37, 97-101, 2009.

• L. Gai and G. Zhang, Hardness of lazy packing and covering. Operations Research Letters 37, 89-92, 2009.
  

• D. Ye, X. Han, and G. Zhang, A note on online strip packing. Journal of Combinatorial Optimization 17, 417-423, 2009.

• G. Yu and G. Zhang, Bin packing of selfish items. Proceedings of the 4th Workshop on Internet and Network Economics (WINE), Springer LNCS 5385, 446-453, 2008.

• J. Ding, T. Ebenlendr, J. Sgall, and G. Zhang, Online scheduling of equal-length jobs on parallel machines. Proceedings of the 15th Annual European Symposium on Algorithms (ESA), Springer LNCS 4698, 427-438, 2007.

• K. Iwama and G. Zhang, Optimal resource augmentations for online knapsack. Proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Springer LNCS 4627, 180-188, 2007.

• Y. Hou and G. Zhang, The hardness of selective network design for bottleneck routing games. Proceedings of the 4th Annual Conference on Theory and Applications of Models of Computation (TAMC), Springer LNCS 4484, 58-66, 2007.

• X. Han, K. Iwama, D. Ye, and G. Zhang, Strip packing vs. bin packing. Proceedings of the 3rd International Conference on
  Algorithmic Aspects in Information and Management (AAIM), Springer LNCS 4508, 358-367, 2007.

• N. Bansal, X. Han, K. Iwama, M. Sviridenko, and G. Zhang, Harmonic algorithm for 3-dimensional strip packing problem. Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1197-1206, 2007.

• D. Ye and G. Zhang, Maximizing the throughput of parallel jobs on hypercubes. Information Processing Letters 102, 259-263, 2007.
  

• J. Ding and G. Zhang, Online scheduling with hard deadlines on parallel machines.  Proceedings of the 2nd International Conference on Algorithmic Aspects in  Information and Management (AAIM), Springer LNCS 4041, 32-42, 2006.

• L. Gai and G. Zhang, Common deadline lazy bureaucrat scheduling revisited. Proceedings of the 7th Latin American Symposium on Theoretical Informatics, (LATIN), Springer LNCS 3887, 515-523, 2006. Full version in Journal of Combinatorial Optimization 15, 191-199, 2008.
  

• X. Han, K. Iwama, and G. Zhang, Online removable square packing. Proceedings of the 3rd International Workshop on Approximation and Online Algorithms (WAOA),  Springer LNCS 3879, 216-229, 2005. Full version in Theory of Computing Systems 43, 38-55, 2008.

• W.-T. Chan, F.Y.L. Chin, D.Ye, G. Zhang, and Y. Zhang, Online bin packing of fragile objects with application in cellular networks. Proceedings of the 1st International Workshop on Internet and Network Economics (WINE), Springer LNCS 3828, 564-573, 2005. Full version in Journal of Combinatorial Optimization 14, 427-435, 2007.

• D. Ye, W.-T. Chan, F. Chin, G. Zhang, and Y. Zhang, On-line scheduling of parallel jobs on two machines. Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA), Victoria, Australia, September 18-21, 2005, 369-380. Full version in Journal of Discrete Algorithms 6, 3-10, 2008.

• G. Zhang, A 3-approximation algorithm for two-dimensional bin packing. Operations Research Letters 33, 121-126, 2005.

• D. Du, X. Jiang, and G. Zhang, Optimal preemptive  online scheduling to minimize lp norm on two processors. Journal of Industrial and Management Optimization 1, 345-351, 2005.

• K. Jansen and G. Zhang, Maximizing the number of packed rectangles. Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT), Springer LNCS 3111, 362-371, 2004.

• D. Ye and G. Zhang, On-line scheduling of parallel jobs. Proceedings of the 11th Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer LNCS 3104, 279-290, 2004. Full version in Journal of Scheduling 10, 407-413, 2007 .

• K. Jansen and G. Zhang, On rectangle packing: maximizing benefits. Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), 197-206, 2004. Full version in Algorithmica 47, 323-342, 2007.

• G. Zhang, X. Cai and C.K. Wong, Some results on resource constrained scheduling. IIE Transactions on Scheduling and Logistics 36, 1-9, 2004.

• D. Ye and G. Zhang, On-line scheduling of parallel jobs with dependencies on 2-dimensional meshes. Proceedings of the 14th International Symposium on Algorithms and Computation (ISAAC), Springer LNCS 2906, 329-338, 2003. Full version in Theoretical Computer Science 372, 94-102, 2007.

• D. Ye and G. Zhang, On-line extensible bin packing with unequal bin sizes. Proceedings of the First Workshop on Approximation and Online Algorithms (WAOA), Springer LNCS 2909, 235-247, 2003. Full version in Discrete Mathematics & Theoretical Computer Science 11, 141-152, 2009.

• K. Iwama and G. Zhang, Removable online knapsack - weighted case. Proceedings of the 7th Japan-Korea Workshop on Algorithms and Computation (WAAC),  223-227, 2003.

• G. Zhang, X. Cai and C.K. Wong, Optimal on-line algorithms for scheduling on parallel batch processing machines.  IIE Transactions on Scheduling and Logistics 35, 175-181, 2003.

• D. Ye and G. Zhang, On-line scheduling with extendable working time on a small number of machines. Information Processing Letters 85, 171-177, 2003.

• G. Zhang, On variable-sized bin packing. Proceedings of the 3rd International Workshop on ARANCE, Carleton Scientific,  117-126, 2002.

• A. Fishkin and G. Zhang, On maximizing the throughput  of multiprocessor tasks. Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS), Springer LNCS 2420,  269-279, 2002. Full version in Theoretical Computer Science 302, 319-335, 2003.

• G. Zhang and D. Ye, A note on on-line scheduling with partial information. Computer and Mathematics with Applications 44, 539-543, 2002.

• G. Zhang, X. Cai, C.-Y. Lee and C.K. Wong, Minimizing makespan on a single batch processing machine with nonidentical job sizes. Naval Research Logistics 48, 226-240, 2001.

• G. Zhang, X. Cai and C.K. Wong, On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics 48, 241-258, 2001.

• G. Zhang, An on-line bin-batching problem. Discrete Applied Mathematics 108, 329-333, 2001.

• G. Zhang, X. Cai and C.K. Wong, Linear time approximation algorithms for bin packing. Operations Research Letters 26, 217-222, 2000.

• G. Chen and G. Zhang, A constrained minimum spanning tree problem. Computers and Operations Research 27, 867-875, 2000.

• G.J. Woeginger and G. Zhang, Optimal on-line algorithm for variable-sized bin covering. Operations Research Letters 25, 47-50, 1999.

• Y. He and G. Zhang, Semi on-line scheduling on two identical machines. Computing 62, 179-187, 1999.

• G. Zhang, Parameterized on-line open-end bin packing. Computing 60, 267-273, 1998.

• J. Han, J. Wen and G. Zhang, A new approximation algorithm for UET-scheduling with chain-type precedence constraints.  Computers and Operations Research 25, 767-771, 1998.

• G. Zhang, A new version of online variable-sized bin packing. Discrete Applied Mathematics 72, 193-197, 1997.

• G. Zhang, A simple semi on-line algorithm for P2//Cmax. Information Processing Letters 61, 145-148, 1997.

• R.E. Burkard and G. Zhang, Bounded space on-line variable-sized bin packing. Acta Cybernetica 13, 63-76, 1997.

• G. Zhang and M. Yue, Tight worst-case performance bound of the AFBk bin packing. Acta Mathematicae Applicatae Sinica (English series) 13, 443-446, 1997.

• G. Zhang, Worst-case analysis of the  FFH algorithm for online variable-sized bin packing. Computing 56, 165-173, 1996.

• G. Rote and G. Zhang, Optimal logistics for expeditions - the jeep problem with complete refilling. ''Spezialforschungsbereich F 003'' Technical Report No. 71, TU Graz, Austria, 1996.