Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
A Refined Kernel for -Hitting Set
Yuxi Liu, Mingyu Xiao
The -Hitting Set problem is a fundamental problem in parameterized complexity, which asks whether a given hypergraph contains a vertex subset of size at most that inters…
cs.DS2024
Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than
Yuxi Liu, Mingyu Xiao
The \textsc{Co-Path/Cycle Packing} problem (resp. The \textsc{Co-Path Packing} problem) asks whether we can delete at most vertices from the input graph such that the remaining…