Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function. - Klaus Jansen; Hu Zhang 004 (IFIP TCS, 2002)

Packing: Scheduling, Embedding, and Approximating Metrics. - Hu Zhang 004 (ICCSA (3), 2004)

Solving Packing Problem with Weaker Block Solvers. - Hu Zhang 004 (IFIP TCS, 2004)

The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces. - Deshi Ye; Hu Zhang 004 (SIROCCO, 2004)

Approximation algorithms for min-max resource sharing and malleable tasks scheduling. - Hu Zhang 004 (2004)

Implementation of Approximation Algorithms for the Multicast Congestion Problem. - Qiang Lu; Hu Zhang 004 (WEA, 2005)

Assign ranges in general ad-hoc networks. - Janka Chlebíková; Deshi Ye; Hu Zhang 004 (J. Parallel Distributed Comput., 2006)

An approximation algorithm for scheduling malleable tasks under general precedence constraints. - Klaus Jansen; Hu Zhang 004 (ACM Trans. Algorithms, 2006)

Scheduling Malleable Tasks. - Hu Zhang 004; Klaus Jansen (Handbook of Approximation Algorithms and Metaheuristics, 2007)

On routing in VLSI design and communication networks. - Tamás Terlaky; Anthony Vannelli; Hu Zhang 004 (Discret. Appl. Math., 2008)

Packing trees in communication networks. - Mohamed Saad 001; Tamás Terlaky; Anthony Vannelli; Hu Zhang 004 (J. Comb. Optim., 2008)

Approximation algorithms for general packing problems and their application to the multicast congestion problem. - Klaus Jansen; Hu Zhang 004 (Math. Program., 2008)

Scheduling malleable tasks with precedence constraints. - Klaus Jansen; Hu Zhang 004 (J. Comput. Syst. Sci., 2012)