2 citations · 3 across the 4 of their papers we have counts for
4 papers
A -vertex Kernel for -packing
Wenjun Li, Junjie Ye, Yixin Cao
The -packing problem asks for whether a graph contains vertex-disjoint paths each of length two. We continue the study of its kernelization algorithms, and develop a -…
A Polynomial Kernel for Diamond-Free Editing
Yixin Cao, Ashutosh Rai, R. B. Sandeep +1
An -free editing problem asks whether we can edit at most edges to make a graph contain no induced copy of the fixed graph . We obtain a polynomial kernel for this proble…
A Note on Finding Dual Feedback Vertex Set
Junjie Ye
For an edge-bicolored graph where each edge is colored either red or blue, a vertex set is a dual feedback vertex set if hits all blue cycles and red cycles of . In…
Finding Two Edge-Disjoint Paths with Length Constraints
Leizhen Cai, Junjie Ye
We consider the problem of finding, for two pairs and of vertices in an undirected graphs, an -path and an -path such that…