2 citations · 2 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
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…
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 with a parameter . It is a hypergraph preserving the minimum multicut values of a…
cs.DS2024
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…