Online Makespan Minimization: The Power of Restart. - Zhiyi Huang 002; Ning Kang 001; Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (APPROX-RANDOM, 2018)

Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. - Zhiyi Huang 002; Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (ICALP, 2018)

How to match when all vertices arrive online. - Zhiyi Huang 002; Ning Kang 001; Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001; Xue Zhu (STOC, 2018)

Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. - Zhiyi Huang 002; Binghui Peng; Zhihao Gavin Tang; Runzhou Tao; Xiaowei Wu 001; Yuhao Zhang 001 (SODA, 2019)

Perturbed Greedy on Oblivious Matching Problems. - Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (CoRR, 2019)

Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. - Zhiyi Huang 002; Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (ACM Trans. Algorithms, 2019)

Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs. - Chun-Hsiang Chan; Bundit Laekhanukit; Hao-Ting Wei; Yuhao Zhang 001 (APPROX-RANDOM, 2020)

Fully Online Matching II: Beating Ranking and Water-filling. - Zhiyi Huang 002; Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (FOCS, 2020)

Towards a better understanding of randomized greedy matching. - Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (STOC, 2020)

A Simple 1-1/e Approximation for Oblivious Bipartite Matching. - Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (CoRR, 2020)

Fully Online Matching. - Zhiyi Huang 002; Ning Kang 001; Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001; Xue Zhu (J. ACM, 2020)

Online Selection Problems against Constrained Adversary. - Zhihao Jiang; Pinyan Lu; Zhihao Gavin Tang; Yuhao Zhang 001 (ICML, 2021)

Online Food Delivery to Minimize Maximum Flow Time. - Xiangyu Guo; Shi Li 001; Kelin Luo; Yuhao Zhang 001 (CoRR, 2021)

Survivable Network Design Revisited: Group-Connectivity. - Qingyun Chen; Bundit Laekhanukit; Chao Liao; Yuhao Zhang 001 (FOCS, 2022)

Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity. - Chao Liao; Qingyun Chen; Bundit Laekhanukit; Yuhao Zhang 001 (ICALP, 2022)

The online food delivery problem on stars. - Xiangyu Guo; Kelin Luo; Zhihao Gavin Tang; Yuhao Zhang 001 (Theor. Comput. Sci., 2022)

On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching. - Jingxun Liang; Zhihao Gavin Tang; Yixuan Even Xu; Yuhao Zhang 001; Renfei Zhou (ESA, 2023)

Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs. - Enze Sun 001; Zonghan Yang; Yuhao Zhang 001 (ESA, 2023)

Fair k-Center: a Coreset Approach in Low Dimensions. - Jinxiang Gan; Mordecai J. Golin; Zonghan Yang; Yuhao Zhang 001 (CoRR, 2023)

Toward a Better Understanding of Randomized Greedy Matching. - Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (J. ACM, 2023)

Algorithms for the Generalized Poset Sorting Problem. - Shaofeng H.-C. Jiang; Wenqian Wang; Yubo Zhang; Yuhao Zhang 001 (ICALP, 2024)

Improved Bounds for Fractional Online Matching Problems. - Zhihao Gavin Tang; Yuhao Zhang 001 (EC, 2024)

AdWords in a Panorama. - Zhiyi Huang 002; Qiankun Zhang; Yuhao Zhang 001 (SIAM J. Comput., 2024)

Minimizing the Maximum Flow Time in the Online Food Delivery Problem. - Xiangyu Guo; Shi Li 001; Kelin Luo; Yuhao Zhang 001 (Algorithmica, 2024)

The Subinterval Cover Problem. - Kelin Luo; Chenran Yang; Zonghan Yang; Yuhao Zhang 001 (IJTCS-FAW, 2025)