My current research focuses on the design and analysis of approximation algorithms for combinatorial optimization problems in Operations Research and Artificial Intelligence.

• Vehicle Routing Problems (VRPs)
  • Closely related to the Traveling Salesman Problem, VRPs have wide practical applications. I have designed improved approximation algorithms for the Capacitated VRP with small vehicle capacities.
• The Traveling Tournament Problem (TTP)
  • TTP is an interesting optimization problem in Sports Scheduling. I have designed improved approximation algorithms for TTP and its variants, including Linear Distance TTP and Bipartite TTP.
• Cycle/Path Partitions in Complete Graphs (CP/PP)
  • Closely related to the Weighted Perfect Matching Problem, CP/PP are interesting problems in Graph Theory. I have designed improved approximation algorithms for CP/PP where all cycles/paths have the same order.

Work Experience

• 2025.09 – Now: Postdoc, Kyung Hee University
  • Supervisor: Hyundong Shin (IEEE Fellow)
• 2025.03 – 2025.08: Postdoc, University of Electronic Science and Technology of China
  • Supervisor: Mingyu Xiao

Education

• 2020 – 2024: Ph.D., University of Electronic Science and Technology of China
  • Major: Computer Science and Technology
  • Supervisor: Mingyu Xiao
• 2016 – 2020: B.S., University of Electronic Science and Technology of China
  • Major: Computer Science and Technology
  • Supervisor: Mingyu Xiao

Project

• Young Scientists Fund of the National Natural Science Foundation of China (62502078)

Service

• Organizing Committee
  • COCOON 2025 (The 31st International Computing and Combinatorics Conference)
• Program Committee
  • AAAI 2026, IJCAI 2026
• Reviewer
  • Journal of Artificial Intelligence Research, Theoretical Computer Science, Information and Computation
  • AAAI 2026, IJCAI 2026
• External Reviewer
  • WALCOM 2022, WALCOM 2024, WALCOM 2025, COCOON 2025, STACS 2025