| 2009 |
|---|
| 28 | EE | Deshi Ye,
Xin Han,
Guochuan Zhang:
A note on online strip packing.
J. Comb. Optim. 17(4): 417-423 (2009) |
| 2008 |
|---|
| 27 | EE | Joseph Timoney,
Stephen Brown,
Deshi Ye:
Experiences in Software Testing Education: Some Observations from an International Cooperation.
ICYCS 2008: 2686-2691 |
| 26 | 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) |
| 25 | EE | Yongqiang Shi,
Deshi Ye:
Online bin packing with arbitrary release times.
Theor. Comput. Sci. 390(1): 110-119 (2008) |
| 2007 |
|---|
| 24 | EE | Xin Han,
Kazuo Iwama,
Deshi Ye,
Guochuan Zhang:
Strip Packing vs. Bin Packing.
AAIM 2007: 358-367 |
| 23 | EE | Yongqiang Shi,
Deshi Ye:
On-Line Bin Packing with Arbitrary Release Times.
ESCAPE 2007: 340-349 |
| 22 | EE | Joseph Wun-Tat Chan,
Francis Y. L. Chin,
Deshi Ye,
Yong Zhang:
Online frequency allocation in cellular networks.
SPAA 2007: 241-249 |
| 21 | EE | Joseph 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) |
| 20 | EE | Deshi Ye,
Guochuan Zhang:
Maximizing the throughput of parallel jobs on hypercubes.
Inf. Process. Lett. 102(6): 259-263 (2007) |
| 19 | EE | Wun-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) |
| 18 | EE | Leah Epstein,
Deshi Ye:
Semi-online scheduling with "end of sequence" information.
J. Comb. Optim. 14(1): 45-61 (2007) |
| 17 | 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) |
| 16 | EE | Deshi Ye,
Guochuan Zhang:
On-line scheduling of parallel jobs in a list.
J. Scheduling 10(6): 407-413 (2007) |
| 15 | EE | Deshi Ye,
Guochuan Zhang:
On-line scheduling mesh jobs with dependencies.
Theor. Comput. Sci. 372(1): 94-102 (2007) |
| 2006 |
|---|
| 14 | EE | Joseph Wun-Tat Chan,
Francis Y. L. Chin,
Deshi Ye,
Yong Zhang,
Hong Zhu:
Frequency Allocation Problems for Linear Cellular Networks.
ISAAC 2006: 61-70 |
| 13 | EE | Xin Han,
Deshi Ye,
Yong Zhou:
Improved Online Hypercube Packing.
WAOA 2006: 226-239 |
| 12 | EE | Xin Han,
Deshi Ye,
Yong Zhou:
Improved online hypercube packing
CoRR abs/cs/0607045: (2006) |
| 11 | EE | Xin Han,
Kazuo Iwama,
Deshi Ye,
Guochuan Zhang:
Strip Packing vs. Bin Packing
CoRR abs/cs/0607046: (2006) |
| 10 | EE | Xin Han,
Kazuo Iwama,
Deshi Ye,
Guochuan Zhang:
Strip Packing vs. Bin Packing.
Electronic Colloquium on Computational Complexity (ECCC) 13(112): (2006) |
| 9 | EE | Janka Chlebíková,
Deshi Ye,
Hu Zhang:
Assign ranges in general ad-hoc networks.
J. Parallel Distrib. Comput. 66(4): 489-498 (2006) |
| 2005 |
|---|
| 8 | EE | Janka Chlebíková,
Deshi Ye,
Hu Zhang:
Assign Ranges in General Ad-Hoc Networks.
AAIM 2005: 411-421 |
| 7 | EE | Wun-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 |
| 6 | 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 |
| 2004 |
|---|
| 5 | EE | Deshi Ye,
Guochuan Zhang:
On-Line Scheduling of Parallel Jobs.
SIROCCO 2004: 279-290 |
| 4 | EE | Deshi Ye,
Hu Zhang:
The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces.
SIROCCO 2004: 291-302 |
| 2003 |
|---|
| 3 | EE | Deshi Ye,
Guochuan Zhang:
Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes.
ISAAC 2003: 329-338 |
| 2 | EE | Deshi Ye,
Guochuan Zhang:
On-Line Extensible Bin Packing with Unequal Bin Sizes.
WAOA 2003: 235-247 |
| 1 | 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) |
