2 citations · 2 across the 3 of their papers we have counts for
6 papers
Linear-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting
Kyungjin Cho, Eunjin Oh, Sebastian Wiederrecht
We study the \textsc{-Disjoint Paths} problem on a graph embedded on a surface with bounded Euler genus. Given a graph with vertices and vertex pairs embedded on a s…
Visibility Queries in Simple Polygons
Sujoy Bhore, Chih-Hung Liu, Anurag Murty Naredla +6
Given a simple polygon with vertices, we consider the problem of constructing a data structure for visibility queries: for any query point , compute the visibility…
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 with a parameter . It is a hypergraph preserving the minimum multicut values of a…
Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
Shinwoo An, Yeonsu Chang, Kyungjin Cho +4
Horiyama et al. (AAAI 2024) considered the problem of generating instances with a unique minimum vertex cover under certain conditions. The Minimum Pre-assignment for Uniquificatio…
Approximate Distance and Shortest-Path Oracles for Fault-Tolerant Geometric Spanners
Kyungjin Cho, Jihun Shin, Eunjin Oh
In this paper, we present approximate distance and shortest-path oracles for fault-tolerant Euclidean spanners motivated by the routing problem in real-world road networks. An -…
Learning Symmetric Rules with SATNet
Sangho Lim, Eun-Gyeol Oh, Hongseok Yang
SATNet is a differentiable constraint solver with a custom backpropagation algorithm, which can be used as a layer in a deep-learning system. It is a promising proposal for bridgin…