Kyungjin Cho

activity

20212024

collaborators

4 papers

cs.DS2024

Dynamic parameterized problems on unit disk graphs

Shinwoo An, Kyungjin Cho, Leo Jang +6

In this paper, we study fundamental parameterized problems such as $k$ -Path/Cycle, Vertex Cover, Triangle Hitting Set, Feedback Vertex Set, and Cycle Packing for dynamic unit disk…

cs.DS2024

Mimicking Networks for Constrained Multicuts in Hypergraphs

Kyungjin Cho, Eunjin Oh

In this paper, we study a \emph{multicut-mimicking network} for a hypergraph over terminals $T$ with a parameter $c$ . It is a hypergraph preserving the minimum multicut values of a…

cs.DS2022

Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in $k^{2}$ and Linear in $n$

Kyungjin Cho, Eunjin Oh, Seunghyeok Oh

In this paper, we study the \textsf{Planar Disjoint Paths} problem: Given an undirected planar graph $G$ with $n$ vertices and a set $T$ of $k$ pairs $(s_{i}, t_{i})_{i = 1}^{k}$ of vertice…

cs.CG2021

Linear-Time Approximation Scheme for k-Means Clustering of Affine Subspaces

Kyungjin Cho, Eunjin Oh

In this paper, we present a linear-time approximation scheme for $k$ -means clustering of \emph{incomplete} data points in $d$ -dimensional Euclidean space. An \emph{incomplete} data…

Dynamic parameterized problems on unit disk graphs

Mimicking Networks for Constrained Multicuts in Hypergraphs

Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in k2 and Linear in n

Linear-Time Approximation Scheme for k-Means Clustering of Affine Subspaces

Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in $k^{2}$ and Linear in $n$