Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. - Artur Czumaj; Andrzej Lingas; Hairong Zhao (ICALP, 2002)

Minimizing Mean Flowtime on Master-Slave Machines. - Joseph Y.-T. Leung; Hairong Zhao (PDPTA, 2004)

Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. - Artur Czumaj; Michelangelo Grigni; Papa A. Sissokho; Hairong Zhao (SODA, 2004)

Fault-Tolerant Geometric Spanners. - Artur Czumaj; Hairong Zhao (Discret. Comput. Geom., 2004)

Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. - André Berger; Artur Czumaj; Michelangelo Grigni; Hairong Zhao (ESA, 2005)

Minimizing mean flowtime and makespan on master-slave systems. - Joseph Y.-T. Leung; Hairong Zhao (J. Parallel Distributed Comput., 2005)

Minimizing Sum of Completion Times and Makespan in Master-Slave Systems. - Joseph Y.-T. Leung; Hairong Zhao (IEEE Trans. Computers, 2006)

Scheduling Coupled-Tasks on a Single Machine. - Haibing Li; Hairong Zhao (CISched, 2007)

Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness. - Yumei Huo; Joseph Y.-T. Leung; Hairong Zhao (Eur. J. Oper. Res., 2007)

Scheduling Two-Machine Flow shops with Exact Delays. - Joseph Y.-T. Leung; Haibing Li; Hairong Zhao (Int. J. Found. Comput. Sci., 2007)

Complexity of two dual criteria scheduling problems. - Yumei Huo; Joseph Y.-T. Leung; Hairong Zhao (Oper. Res. Lett., 2007)

Scheduling problems in master-slave model. - Joseph Y.-T. Leung; Hairong Zhao (Ann. Oper. Res., 2008)

Minimizing total completion time in two-machine flow shops with exact delays. - Yumei Huo; Haibing Li; Hairong Zhao (Comput. Oper. Res., 2009)

Makespan Minimization with Machine Availability Constraints. - Bin Fu; Yumei Huo; Hairong Zhao (Discret. Math. Algorithms Appl., 2009)

Exponential inapproximability and FPTAS for scheduling with availability constraints. - Bin Fu; Yumei Huo; Hairong Zhao (Theor. Comput. Sci., 2009)

Approximation Schemes for Scheduling with Availability Constraints. - Bin Fu; Yumei Huo; Hairong Zhao (FAW, 2010)

Approximation schemes for parallel machine scheduling with availability constraints. - Bin Fu; Yumei Huo; Hairong Zhao (Discret. Appl. Math., 2011)

Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints. - Yumei Huo; Hairong Zhao (Theor. Comput. Sci., 2011)

Energy Efficient and Cluster Based Routing Protocol for WSN. - Hairong Zhao; Wuneng Zhou; Yan Gao (CIS, 2012)

Minimizing Total Weighted Completion Time with Unexpected Machine Unavailability. - Yumei Huo; Boris Reznichenko; Hairong Zhao (COCOA, 2012)

Coordinated scheduling of production and delivery with production window and delivery capacity constraints. - Bin Fu; Yumei Huo; Hairong Zhao (Theor. Comput. Sci., 2012)

Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints. - Yumei Huo; Hairong Zhao (FAW-AAIM, 2013)

Minimizing total weighted completion time with an unexpected machine unavailable interval. - Yumei Huo; Boris Reznichenko; Hairong Zhao (J. Sched., 2014)

Evaluation of an auto-generated data structures and algorithms visualization approach at tri-state colleges. - Duo Helen Wei; Shuihui Yang; Sen Zhang; Hairong Zhao (CTS, 2015)

Total completion time minimization on multiple machines subject to machine availability and makespan constraints. - Yumei Huo; Hairong Zhao (Eur. J. Oper. Res., 2015)

Minimizing the Number of Late Multi-Task Jobs on Identical Machines in Parallel. - Lingxiang Li; Haibing Li; Hairong Zhao (FedCSIS, 2016)

Minimizing Total Completion Time in Flowshop with Availability Constraint on the First Machine. - Hairong Zhao; Yumei Huo (FedCSIS, 2016)

In memoriam: Dr. Joseph Leung. - Nicholas G. Hall; Yumei Huo; Benjamin Li; Michael L. Pinedo; Hairong Zhao (J. Sched., 2018)

Multitasking Scheduling with Shared Processing. - Bin Fu; Yumei Huo; Hairong Zhao (CoRR, 2022)

Streaming algorithms for multitasking scheduling with shared processing. - Bin Fu; Yumei Huo; Hairong Zhao (Discret. Appl. Math., 2022)

Sublinear Approximation Schemes for Scheduling Precedence Graphs of Bounded Depth. - Bin Fu; Yumei Huo; Hairong Zhao (CoRR, 2023)

Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity. - Bin Fu; Yumei Huo; Hairong Zhao (Theor. Comput. Sci., 2023)

Sublinear Algorithms for Scheduling with Chain Precedence Constraints. - Bin Fu; Yumei Huo; Hairong Zhao (COCOON (1), 2024)

Streaming Algorithms for Scheduling Jobs with Priorities. - Bin Fu; Yumei Huo; Hairong Zhao (IWOCA, 2025)

Sublinear time approximation schemes for makespan minimization on parallel machines. - Bin Fu; Yumei Huo; Hairong Zhao (Math. Methods Oper. Res., 2025)