2009 |
14 | EE | Yumei Huo,
Haibing Li,
Hairong Zhao:
Minimizing total completion time in two-machine flow shops with exact delays.
Computers & OR 36(6): 2018-2030 (2009) |
2008 |
13 | EE | Yumei Huo,
Haibing Li,
Hairong Zhao:
Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays.
COCOA 2008: 427-437 |
12 | EE | Joseph Y.-T. Leung,
Hairong Zhao:
Scheduling problems in master-slave model.
Annals OR 159(1): 215-231 (2008) |
2007 |
11 | EE | Yumei Huo,
Joseph Y.-T. Leung,
Hairong Zhao:
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness.
European Journal of Operational Research 177(1): 116-134 (2007) |
10 | EE | Joseph Y.-T. Leung,
Haibing Li,
Hairong Zhao:
Scheduling Two-Machine Flow shops with Exact Delays.
Int. J. Found. Comput. Sci. 18(2): 341-359 (2007) |
9 | EE | Yumei Huo,
Joseph Y.-T. Leung,
Hairong Zhao:
Complexity of two dual criteria scheduling problems.
Oper. Res. Lett. 35(2): 211-220 (2007) |
2006 |
8 | EE | Joseph Y.-T. Leung,
Hairong Zhao:
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems.
IEEE Trans. Computers 55(8): 985-999 (2006) |
2005 |
7 | EE | André Berger,
Artur Czumaj,
Michelangelo Grigni,
Hairong Zhao:
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs.
ESA 2005: 472-483 |
6 | EE | Joseph Y.-T. Leung,
Hairong Zhao:
Minimizing mean flowtime and makespan on master-slave systems.
J. Parallel Distrib. Comput. 65(7): 843-856 (2005) |
2004 |
5 | | Joseph Y.-T. Leung,
Hairong Zhao:
Minimizing Mean Flowtime on Master-Slave Machines.
PDPTA 2004: 939-945 |
4 | EE | Artur Czumaj,
Michelangelo Grigni,
Papa Sissokho,
Hairong Zhao:
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs.
SODA 2004: 496-505 |
3 | EE | Artur Czumaj,
Hairong Zhao:
Fault-Tolerant Geometric Spanners.
Discrete & Computational Geometry 32(2): 207-230 (2004) |
2003 |
2 | EE | Artur Czumaj,
Hairong Zhao:
Fault-tolerant geometric spanners.
Symposium on Computational Geometry 2003: 1-10 |
2002 |
1 | EE | Artur Czumaj,
Andrzej Lingas,
Hairong Zhao:
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem.
ICALP 2002: 973-984 |