31 citations · 74 across the 13 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
cs.DS2010
FAST: Kernelization based on Graph Modular Decomposition
Yixin Cao, Jianer Chen
Kernelization algorithms, usually a preprocessing step before other more traditional algorithms, are very special in the sense that they return (reduced) instances, instead of fina…
cs.DS2010★ 5 cited
Cluster Editing: Kernelization based on Edge Cuts
Yixin Cao, Jianer Chen
Kernelization algorithms for the {\sc cluster editing} problem have been a popular topic in the recent research in parameterized computation. Thus far most kernelization algorithms…
cs.DS2010★ 31 cited
On Feedback Vertex Set: New Measure and New Structures
Yixin Cao, Jianer Chen, Yang Liu
We present a new parameterized algorithm for the {feedback vertex set} problem ({\sc fvs}) on undirected graphs. We approach the problem by considering a variation of it, the {disj…