San Diego, Dec 2025.

Yongho Shin

List of Publications

Changyeol Lee, Dahoon Lee, Jongseo Lee, Yongho Shin, and Changki Yun. Optimal learning-augmented algorithm for online bidding. arXiv preprint arXiv:2605.07349, 2026. To appear in NeurIPS 2026. [arXiv]
Fateme Abbasi, Martin Böhm, Jarosław Byrka, Matin Mohammadi, and Yongho Shin. Servicing matched client pairs with facilities. arXiv preprint arXiv:2602.19680, 2026. Appeared in WAOA 2026. [arXiv]
Jarosław Byrka and Yongho Shin. Online rounding schemes for edge cover. arXiv preprint arXiv:2507.13159, 2025. Appeared in WAOA 2026. [arXiv]
Fateme Abbasi, Hyung-Chan An, Jarosław Byrka, Changyeol Lee, and Yongho Shin. Approximating (weighted) chromatic correlation clustering via cluster LP. In APPROX/RANDOM 2026: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 13:1-13:20, 2026. [Link] [arXiv]
Yongho Shin and Phanu Vajanopath. Parsimonious learning-augmented online metric matching. In ICML 2026: Proceedings of the 43rd International Conference on Machine Learning, PMLR 306, pages 112669-112688, 2023. [Link] [arXiv]

Davin Choo, Billy Jin, and Yongho Shin. Learning-augmented online bipartite fractional matching. In NeurIPS 2025: Advances in Neural Information Processing Systems 38, pages 7671-7686, 2025. [Link] [arXiv]
Changyeol Lee, Yongho Shin, and Hyung-Chan An. Improved algorithms for overlapping and robust clustering of edge-colored hypergraphs: An LP-based combinatorial approach. In NeurIPS 2025: Advances in Neural Information Processing Systems 38, pages 70823-70855, 2025. [Link] [arXiv]
Yongho Shin, Changyeol Lee, Gukryeol Lee, and Hyung-Chan An. Improved learning-augmented algorithms and (tight) lower bounds for multi-option ski rental problem. ACM Transactions on Algorithms 22(1), 11:1-30, 2025. Conference version in ICML 2023. [Link]

Yongho Shin, Changyeol Lee, Gukryeol Lee, and Hyung-Chan An. Improved learning-augmented algorithms for the multi-option ski rental problem via best-possible competitive analysis. In ICML 2023: Proceedings of the 40th International Conference on Machine Learning, PMLR 202, pages 31539-31561, 2023. [Link]
Kangsan Kim, Yongho Shin, and Hyung-Chan An. Constant-factor approximation algorithms for parity-constrained facility location and k-center. Algorithmica 85, pages 1883–1911, 2023. Conference version in ISAAC 2020. [Link]

Yongho Shin and Hyung-Chan An. Making three out of two: Three-way online correlated selection. In ISAAC 2021: Proceedings of the 32nd International Symposium on Algorithms and Computation, pages 49:1-49:17, 2021. [Link]

Kangsan Kim, Yongho Shin, and Hyung-Chan An. Constant-factor approximation algorithms for the parity-constrained facility location problem. In ISAAC 2020: Proceedings of the 31st International Symposium on Algorithms and Computation, pages 21:1-21:17, 2020. [Link]

Jarosław Byrka, Yuhao Guo, Yang Hu, Shi Li, Yongho Shin, Phanu Vajanopath, Chengzhang Wan, and Zaixuan Wang. Iterative randomized rounding for better-than-2 k-median approximation. arXiv preprint arXiv:2610.31229, 2026. [arXiv]
Mateusz Basiak, Marcin Bieńkowski, Yongho Shin, and Agnieszka Tatarczuk. Pure tail constraints for online problems. arXiv preprint arXiv:2609.35337, 2026. [arXiv]
Yongho Shin, Changyeol Lee, and Hyung-Chan An. On optimal consistency-robustness trade-off for learning-augmented multi-option ski rental. arXiv preprint arXiv:2312.02547, 2023. Merged to Shin et al. (TALG 2025). [arXiv]
Yongho Shin, Kangsan Kim, Seungmin Lee, and Hyung-Chan An. Online graph matching problems with a worst-case reassignment budget. arXiv preprint arXiv:2003.05175, 2020. [arXiv]