Pakapim Eua-anant

Summer Undergraduate Research Fellow 2026

About:
I am Pakapim Eua-anant, and for the summer of 2026 I am working as a research fellow at INSAIT. My studies focus on the theory of computation and algorithms. Currently, my team and I are working on packet routing and cycle problems in graphs, trying to optimize algorithm complexity and find lower bounds for the problem under various constraints. My supervisors are Dr. Bundit Laekhanukit, Dr. Lazar Milenković and Dr. Bernhard Haeupler.

Education:
Chulalongkorn University, Thailand (August 2023 – present) – Bachelor of Computer Engineering

City University of Hong Kong, Hong Kong (January – May 2026) – Exchange Program, Computer Science

Demonstration school of Khon Kaen University, Thailand (June 2019 – March 2023) – Science Classroom in University – Affiliated School Project

Research Experience:
NP-Completeness proof of puzzles – Individual study under Ph. D. Suthee Ruangwise (August 2025 – March 2026)

Gaussian splatting on 3D morphable face model – Lumio 3D Co., Ltd. internship (May 2025 – August 2025)

Algorithm design for ICPC – Individual study under Dr. Nat Pavasant (August 2023 – December 2025)

Awards:
1st place, ICPC Thailand National Competition (September 2024)
2x finalist in the ICPC Asia – Pacific Championship (March 2024 – February 2025)
Silver medal, Thailand Olympiad in Informatics (June 2022)

Publications:
Eua-Anant, P., Apinyanon, P., Jirachaisri, T., Ruangsuksriwong, N., & Ruangwises, S. (2025, October 24). NP-Completeness Proofs of All or Nothing, Water Walk, and Remembered Length Using the T-Metacell Framework. https://www.arxiv.org/abs/2510.21938 – Accepted at the 42nd European Workshop on Computational Geometry (EuroCG 2026).