My research interests include combinatorial optimization, approximation algorithms, online algorithms, parameterized algorithms, and graph theory.
Hello, I am Jongseo Lee, an undergraduate student in Computer Science at KAIST.
Research Projects
Improved Algorithms for Bounded-Degree (Subset) Traveling Salesman Problems
We develop improved bicriteria approximation algorithms for bounded-degree TSP variants, including the first additive degree-violation guarantees for path and subset path versions.
Optimal Learning-Augmented Algorithm for Online Bidding
We close the randomized robustness-consistency gap for learning-augmented online bidding with a Pareto-optimal algorithm, introducing bidding profiles as a tool for optimal randomized strategies. The framework also yields improved learning-augmented algorithms for linear search.
Awards/Honors
- 9th Place, Google Hash Code World Finals (2022)
- 5th Place, ICPC Asia Seoul Regional Contest (2020)
- Silver Medal, Korea Olympiad in Informatics (2018)
Teaching/Service
- Teaching
- Teaching Assistant, CS202: Problem Solving (Fall 2025)
- Programming Contests (Community Contribution)
- Problem Setter/Tester, Korea Olympiad in Informatics (2021 – )
- Student Coach, Korean IOI Training Camp (2021, 2025)
- Staff, ICPC Asia Seoul Regional Contest (2022)
Languages
- Korean — Native
- English — Fluent
Beyond research, I have over four years of professional experience as a Software Engineer. Most recently, I worked at Moloco, Inc. (2023 – 2025).
You can download my one-page resume here: [to be updated]