Hanchun Yuan

collaborators

2 papers

cs.DS2022

Modification Problems toward Proper (Helly) Circular-arc Graphs

Yixin Cao, Jianxin Wang, Hanchun Yuan

We present a $9^{k} \cdot n^{O (1)}$ -time algorithm for the proper circular-arc vertex deletion problem, resolving an open problem of van 't Hof and Villanger [Algorithmica 2013] and C…

cs.DS2020

Polynomial Kernels for Paw-free Edge Modification Problems

Yixin Cao, Yuping Ke, Hanchun Yuan

Let $H$ be a fixed graph. Given a graph $G$ and an integer $k$ , the $H$ -free edge modification problem asks whether it is possible to modify at most $k$ edges in $G$ to make it $H$ …