2009 |
44 | EE | Deshi Ye,
Xin Han,
Guochuan Zhang:
A note on online strip packing.
J. Comb. Optim. 17(4): 417-423 (2009) |
2008 |
43 | EE | Guosong Yu,
Guochuan Zhang:
Bin Packing of Selfish Items.
WINE 2008: 446-453 |
42 | EE | Xin Han,
Kazuo Iwama,
Guochuan Zhang:
On Two Dimensional Orthogonal Knapsack Problem
CoRR abs/0803.4260: (2008) |
41 | EE | Ling Gai,
Guochuan Zhang:
On lazy bureaucrat scheduling with common deadlines.
J. Comb. Optim. 15(2): 191-199 (2008) |
40 | EE | Wun-Tat Chan,
Francis Y. L. Chin,
Deshi Ye,
Guochuan Zhang,
Yong Zhang:
On-line scheduling of parallel jobs on two machines.
J. Discrete Algorithms 6(1): 3-10 (2008) |
39 | EE | Xin Han,
Kazuo Iwama,
Guochuan Zhang:
Online Removable Square Packing.
Theory Comput. Syst. 43(1): 38-55 (2008) |
2007 |
38 | | Bo Chen,
Mike Paterson,
Guochuan Zhang:
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers
Springer 2007 |
37 | EE | Xin Han,
Kazuo Iwama,
Deshi Ye,
Guochuan Zhang:
Strip Packing vs. Bin Packing.
AAIM 2007: 358-367 |
36 | EE | Kazuo Iwama,
Guochuan Zhang:
Optimal Resource Augmentations for Online Knapsack.
APPROX-RANDOM 2007: 180-188 |
35 | EE | Jihuan Ding,
Tomás Ebenlendr,
Jiri Sgall,
Guochuan Zhang:
Online Scheduling of Equal-Length Jobs on Parallel Machines.
ESA 2007: 427-438 |
34 | EE | Nikhil Bansal,
Xin Han,
Kazuo Iwama,
Maxim Sviridenko,
Guochuan Zhang:
Harmonic algorithm for 3-dimensional strip packing problem.
SODA 2007: 1197-1206 |
33 | EE | Haiyang Hou,
Guochuan Zhang:
The Hardness of Selective Network Design for Bottleneck Routing Games.
TAMC 2007: 58-66 |
32 | EE | Klaus Jansen,
Guochuan Zhang:
Maximizing the Total Profit of Rectangles Packed into a Rectangle.
Algorithmica 47(3): 323-342 (2007) |
31 | EE | Deshi Ye,
Guochuan Zhang:
Maximizing the throughput of parallel jobs on hypercubes.
Inf. Process. Lett. 102(6): 259-263 (2007) |
30 | EE | Wun-Tat Chan,
Francis Y. L. Chin,
Deshi Ye,
Guochuan Zhang,
Yong Zhang:
Online bin packing of fragile objects with application in cellular networks.
J. Comb. Optim. 14(4): 427-435 (2007) |
29 | EE | Deshi Ye,
Guochuan Zhang:
On-line scheduling of parallel jobs in a list.
J. Scheduling 10(6): 407-413 (2007) |
28 | EE | Deshi Ye,
Guochuan Zhang:
On-line scheduling mesh jobs with dependencies.
Theor. Comput. Sci. 372(1): 94-102 (2007) |
2006 |
27 | EE | Jihuan Ding,
Guochuan Zhang:
Online Scheduling with Hard Deadlines on Parallel Machines.
AAIM 2006: 32-42 |
26 | EE | Ling Gai,
Guochuan Zhang:
Common Deadline Lazy Bureaucrat Scheduling Revisited.
LATIN 2006: 515-523 |
25 | EE | Xin Han,
Kazuo Iwama,
Deshi Ye,
Guochuan Zhang:
Strip Packing vs. Bin Packing
CoRR abs/cs/0607046: (2006) |
24 | EE | Xin Han,
Kazuo Iwama,
Guochuan Zhang:
New Upper Bounds on The Approximability of 3D Strip Packing
CoRR abs/cs/0607100: (2006) |
23 | EE | Xin Han,
Kazuo Iwama,
Deshi Ye,
Guochuan Zhang:
Strip Packing vs. Bin Packing.
Electronic Colloquium on Computational Complexity (ECCC) 13(112): (2006) |
2005 |
22 | EE | Xin Han,
Kazuo Iwama,
Guochuan Zhang:
Online Removable Square Packing.
WAOA 2005: 216-229 |
21 | EE | Wun-Tat Chan,
Francis Y. L. Chin,
Deshi Ye,
Guochuan Zhang,
Yong Zhang:
Online Bin Packing of Fragile Objects with Application in Cellular Networks.
WINE 2005: 564-573 |
20 | EE | Guochuan Zhang:
A 3-approximation algorithm for two-dimensional bin packing.
Oper. Res. Lett. 33(2): 121-126 (2005) |
2004 |
19 | EE | Deshi Ye,
Guochuan Zhang:
On-Line Scheduling of Parallel Jobs.
SIROCCO 2004: 279-290 |
18 | EE | Klaus Jansen,
Guochuan Zhang:
On rectangle packing: maximizing benefits.
SODA 2004: 204-213 |
17 | EE | Klaus Jansen,
Guochuan Zhang:
Maximizing the Number of Packed Rectangles.
SWAT 2004: 362-371 |
2003 |
16 | EE | Deshi Ye,
Guochuan Zhang:
Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes.
ISAAC 2003: 329-338 |
15 | EE | Deshi Ye,
Guochuan Zhang:
On-Line Extensible Bin Packing with Unequal Bin Sizes.
WAOA 2003: 235-247 |
14 | EE | Deshi Ye,
Guochuan Zhang:
On-line scheduling with extendable working time on a small number of machines.
Inf. Process. Lett. 85(4): 171-177 (2003) |
13 | EE | Aleksei V. Fishkin,
Guochuan Zhang:
On maximizing the throughput of multiprocessor tasks.
Theor. Comput. Sci. 302(1-3): 319-335 (2003) |
2002 |
12 | EE | Aleksei V. Fishkin,
Guochuan Zhang:
On Maximizing the Throughput of Multiprocessor Tasks.
MFCS 2002: 269-279 |
2001 |
11 | | Guochuan Zhang:
An on-line bin-batching problem.
Discrete Applied Mathematics 108(3): 329-333 (2001) |
2000 |
10 | EE | Guangting Chen,
Guochuan Zhang:
A constrained minimum spanning tree problem.
Computers & OR 27(9): 867-875 (2000) |
9 | EE | Guochuan Zhang,
Xiaoqiang Cai,
C. K. Wong:
Linear time-approximation algorithms for bin packing.
Oper. Res. Lett. 26(5): 217-222 (2000) |
1999 |
8 | EE | Yong He,
Guochuan Zhang:
Semi On-Line Scheduling on Two Identical Machines.
Computing 62(3): 179-187 (1999) |
7 | EE | Gerhard J. Woeginger,
Guochuan Zhang:
Optimal on-line algorithms for variable-sized bin covering.
Oper. Res. Lett. 25(1): 47-50 (1999) |
1998 |
6 | EE | Jiye Han,
Jianjun Wen,
Guochuan Zhang:
A new approximation algorithm for UET-Scheduling with chain-type precedence constraints.
Computers & OR 25(9): 767-771 (1998) |
5 | EE | Guochuan Zhang:
Parameterized On-Line Open-End Bin Packing.
Computing 60(3): 267-274 (1998) |
1997 |
4 | EE | Rainer E. Burkard,
Guochuan Zhang:
Bounded Space On-Line Variable-Sized Bin Packing.
Acta Cybern. 13(1): 63-76 (1997) |
3 | EE | Guochuan Zhang:
A New Version of On-line Variable-sized Bin Packing.
Discrete Applied Mathematics 72(3): 193-197 (1997) |
2 | EE | Guochuan Zhang:
A Simple Semi On-Line Algorithm for P2//C_{max} with a Buffer.
Inf. Process. Lett. 61(3): 145-148 (1997) |
1996 |
1 | EE | Guochuan Zhang:
Short Communication: Worst-Case Analysis of the FFH Algorithm for Online Variable-Sized Bin Packing.
Computing 56(2): 165-172 (1996) |