Kyungjin Cho

Ph.D Student at Computer Science in POSTECH

About Me

I am a Ph.D student (5th year of integrative Program) at Computer Science and Engineering in POSTECH and advised by Eunjin Oh. My research interests lie in algorithms, data structures, and parameterized complexities. Recently, I am interested in sparsifiers of graphs and hypergraphs.

I would participate and present my research at AAAI 2025, Philadelphia, USA. My presentation would be on 1st March :)

Publications

Conferences

-Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs AAAI 2025 (with Shinwoo An, Yeonsu Chang, O-joung Kwon, Myounghwan Lee, Eunjin Oh, and Hyeonjun Shin)

-Mimicking Networks for Constrained Multicuts in Hypergraphs ISAAC 2024 (with Eunjin Oh)

-Dynamic Parameterized Problems on Unit Disk Graphs ISAAC 2024 (with Shinwoo An, Leo Jang, Byeonghyeon Jung, Yudam Lee, Eunjin Oh, Donghun Shin, Hyeonjun Shin, and Chanho Song)

-Optimal algorithm for the planar two-center problem SoCG 2024 (with Eunjin Oh, Haitao Wang, and Jie Xue)

-Approximate Distance and Shortest-Path Oracles for Fault-Tolerant Geometric Spanners AAAI 2024 (with Jihun Shin and Eunjin Oh)

-Parameterized Algorithms for the Planar Disjoint Paths Problem: Exponential in k^2 and Linear in n SODA 2023 (with Seunghyeok Oh and Eunjin Oh)

-Faster Algorithms for Cycle Hitting Problems on Disk Graphs WADS 2023 (with Shinwoo An and Eunjin Oh)

-Linear-time approximation scheme for k-means clustering of affine subspaces ISAAC 2021 (with Eunjin Oh)

Journals

-Optimal Algorithm for the Planar Two-Center Problem TheoretiCS (with Eunjin Oh, Haitao Wang, and Jie Xue)

-Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces Computational Geometry (with Eunjin Oh)

Academic Activities

Sub-Reviewer

MFCS 2021, SOSA 2023, ISAAC 2023, ESA 2023, ISAAC 2024, CGTA

Education

POSTECH

Bachelor of Mathematics

2016.03 - 2020.02

GPA: 3.95/4.3 (summa cum laude)