| 2026 | IWOCA | Minimizing Makespan in Sublinear Time via Weighted Random Sampling. | Bin Fu, Yumei Huo, Hairong Zhao |
| 2025 | IWOCA | Streaming Algorithms for Scheduling Jobs with Priorities. | Bin Fu, Yumei Huo, Hairong Zhao |
| 2024 | COCOON | Sublinear Algorithms for Scheduling with Chain Precedence Constraints. | Bin Fu, Yumei Huo, Hairong Zhao |
| 2016 | FedCSIS | Minimizing the Number of Late Multi-Task Jobs on Identical Machines in Parallel. | Lingxiang Li, Haibing Li, Hairong Zhao |
| 2016 | FedCSIS | Minimizing Total Completion Time in Flowshop with Availability Constraint on the First Machine. | Hairong Zhao, Yumei Huo |
| 2013 | AAIM | Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints. | Yumei Huo, Hairong Zhao |
| 2012 | CIS | Energy Efficient and Cluster Based Routing Protocol for WSN. | Hairong Zhao, Wuneng Zhou, Yan Gao |
| 2012 | COCOA | Minimizing Total Weighted Completion Time with Unexpected Machine Unavailability. | Yumei Huo, Boris Reznichenko, Hairong Zhao |
| 2010 | AAIM | Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints. | Bin Fu, Yumei Huo, Hairong Zhao |
| 2010 | FAW | Approximation Schemes for Scheduling with Availability Constraints. | Bin Fu, Yumei Huo, Hairong Zhao |
| 2009 | COCOA | Makespan Minimization with Machine Availability Constraints. | Bin Fu, Yumei Huo, Hairong Zhao |
| 2008 | COCOA | Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays. | Yumei Huo, Haibing Li, Hairong Zhao |
| 2005 | ESA | Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. | Andr Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao |
| 2004 | PDPTA | Minimizing Mean Flowtime on Master-Slave Machines. | Joseph Y.-T. Leung, Hairong Zhao |
| 2004 | SODA | Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. | Artur Czumaj, Michelangelo Grigni, Papa A. Sissokho, Hairong Zhao |
| 2002 | ICALP | Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. | Artur Czumaj, Andrzej Lingas, Hairong Zhao |