Tight Competitive Analyses of Online Car-Sharing Problems. - Ya-Chun Liang; Kuan-Yun Lai; Ho-Lin Chen; Kazuo Iwama (ISAAC, 2021)

Topological Interference Management with Adversarial Perturbation. - Ya-Chun Liang; Chung-Shou Liao; Xinping Yi (ISIT, 2021)

Randomized Scheduling for the Online Car-sharing Problem. - Kuan-Yun Lai; Ya-Chun Liang; Ho-Lin Chen; Kazuo Iwama; Chung-Shou Liao (CoRR, 2021)

Improving the Bounds of the Online Dynamic Power Management Problem. - Ya-Chun Liang; Kazuo Iwama; Chung-Shou Liao (ISAAC, 2022)

Topological Interference Management With Adversarial Topology Perturbation: An Algorithmic Perspective. - Ya-Chun Liang; Chung-Shou Liao; Xinping Yi (IEEE Trans. Commun., 2022)

Tight competitive analyses of online car-sharing problems. - Ya-Chun Liang; Kuan-Yun Lai; Ho-Lin Chen; Kazuo Iwama; Chung-Shou Liao (Theor. Comput. Sci., 2022)

A Primal-Dual Algorithmic Aspect of Link Scheduling in Dynamic Wireless Networks. - Ya-Chun Liang; Chung-Shou Liao; Xinping Yi (ISIT, 2023)

Online Predictions for Online TSP on the Line. - Jian-Xi Shao; Ya-Chun Liang; Chung-Shou Liao (Int. J. Found. Comput. Sci., 2023)

Scheduling with Obligatory Tests. - Konstantinos Dogeas; Thomas Erlebach; Ya-Chun Liang (ESA, 2024)

Waiting is worth it and can be improved with predictions. - Ya-Chun Liang; Meng-Hsi Li; Chung-Shou Liao; Clifford Stein 001 (CoRR, 2025)