Ya-Chun Liang

According to our database, Ya-Chun Liang authored at least 9 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Scheduling with Obligatory Tests.

Konstantinos Dogeas, Thomas Erlebach, Ya-Chun Liang

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Online Predictions for Online TSP on the Line.

Jian-Xi Shao, Ya-Chun Liang, Chung-Shou Liao

Int. J. Found. Comput. Sci., November, 2023

A Primal-Dual Algorithmic Aspect of Link Scheduling in Dynamic Wireless Networks.

Ya-Chun Liang, Chung-Shou Liao, Xinping Yi

Proceedings of the IEEE International Symposium on Information Theory, 2023

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

Topological Interference Management With Adversarial Topology Perturbation: An Algorithmic Perspective.

Ya-Chun Liang, Chung-Shou Liao, Xinping Yi

IEEE Trans. Commun., 2022

Improving the Bounds of the Online Dynamic Power Management Problem.

Ya-Chun Liang, Kazuo Iwama, Chung-Shou Liao

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

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

Topological Interference Management with Adversarial Perturbation.

Ya-Chun Liang, Chung-Shou Liao, Xinping Yi

Proceedings of the IEEE International Symposium on Information Theory, 2021

Tight Competitive Analyses of Online Car-Sharing Problems.

Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021