4 citations · 9 across the 11 of their papers we have counts for
23 papers
Faster Algorithms for Cycle Hitting Problems on Disk Graphs
Shinwoo An, Kyungjin Cho, Eunjin Oh
In this paper, we consider three hitting problems on a disk intersection graph: Triangle Hitting Set, Feedback Vertex Set, and Odd Cycle Transversal. Given a disk intersection grap…
Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs
Eunjin Oh, Seunghyeok Oh
In this paper, we study the maximum clique problem on hyperbolic random graphs. A hyperbolic random graph is a mathematical model for analyzing scale-free networks since it effecti…
Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in and Linear in
Kyungjin Cho, Eunjin Oh, Seunghyeok Oh
In this paper, we study the \textsf{Planar Disjoint Paths} problem: Given an undirected planar graph with vertices and a set of pairs of vertice…
Feedback Vertex Set on Geometric Intersection Graphs
Shinwoo An, Eunjin Oh
In this paper, we present an algorithm for computing a feedback vertex set of a unit disk graph of size , if it exists, which runs in time , where and…
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 -means clustering of \emph{incomplete} data points in -dimensional Euclidean space. An \emph{incomplete} data…
Reachability Problems for Transmission Graphs
Shinwoo An, Eunjin Oh
Let be a set of points in the plane where each point of is associated with a radius .The transmission graph of is defined as the directed graph…