My research interests lie in algorithmic and structural graph theory.
In an algorithmic sense, I'm interested in NP-hardness, parameterized complexity, fixed-parameter algorithms, and kernelizations of graph problems.
In a structural sense, I'm interested in graph classes and their forbidden structures and graph parameters like twin-width, rank-width, and tree-width.
The picture was taken in a beautiful city, Firenze.
Here is my CV (Revised in Sep. 2023).
Ph.D. in Mathematical Sciences, KAIST (Mar. 2020 - Aug. 2023)
Thesis: Algorithmic and structural aspects of graph parameters (Advisor: Sang-il Oum)
B.S. in Mathematics, Sungkyunkwan University (Mar. 2014 - Feb. 2018)