CAO Yixin
Title
Cited by
Cited by
Year
On feedback vertex set new measure and new structures
Y Cao, J Chen, Y Liu
Algorithmica 73 (1), 63-86, 2015
1202015
Interval deletion is fixed-parameter tractable
Y Cao, D Marx
ACM Transactions on Algorithms 11 (3), 21, 2015
562015
Chordal editing is fixed-parameter tractable
Y Cao, D Marx
Algorithmica 75 (1), 118-137, 2016
532016
Cluster editing: Kernelization based on edge cuts
Y Cao, J Chen
Algorithmica 64 (1), 152-169, 2012
452012
Linear recognition of almost interval graphs
Y Cao
Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms …, 2016
39*2016
Unit interval editing is fixed-parameter tractable
Y Cao
Information and Computation 253, 109-126, 2017
252017
Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
W Li, Y Cao, J Chen, J Wang
Information and Computation 252, 187–200, 2017
25*2017
Minimum fill-in: Inapproximability and almost tight lower bounds
Y Cao, RB Sandeep
Information and Computation 271, 104514, 2020
152020
Approximate association via dissociation
J You, J Wang, Y Cao
Discrete Applied Mathematics 219, 202-209, 2017
142017
An O⁎(1.84 k) parameterized algorithm for the multiterminal cut problem
Y Cao, J Chen, JH Fan
Information Processing Letters 114 (4), 167-173, 2014
142014
Edge deletion problems: Branching facilitated by modular decomposition
Y Liu, J Wang, J You, J Chen, Y Cao
Theoretical Computer Science 573, 63-70, 2015
112015
Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection
Y Cao, LN Grippo, MD Safe
Discrete Applied Mathematics 216, 67–83, 2017
10*2017
A Naive Algorithm for Feedback Vertex Set
Y Cao
arXiv preprint arXiv:1707.08684, 2017
92017
Unit interval vertex deletion: Fewer vertices are relevant
Y Ke, Y Cao, X Ouyang, J Wang
arXiv preprint arXiv:1607.01162, 2016
82016
Vertex deletion problems on chordal graphs
Y Cao, Y Ke, Y Otachi, J You
Theoretical Computer Science 745, 75-86, 2018
72018
A Polynomial Kernel for Diamond-Free Editing
Y Cao, A Rai, RB Sandeep, J Ye
arXiv preprint arXiv:1803.03358, 2018
62018
The (un) supervised detection of overlapping communities as well as hubs and outliers via (bayesian) NMF
X Cao, X Wang, D Jin, Y Cao, D He
Proceedings of the 23rd International Conference on World Wide Web, 233-234, 2014
52014
Enumerating Maximal Induced Subgraphs
Y Cao
arXiv preprint arXiv:2004.09885, 2020
42020
A -vertex Kernel for -packing
W Li, J Ye, Y Cao
arXiv preprint arXiv:1804.02801, 2018
3*2018
An efficient branching algorithm for interval completion
Y Cao
arXiv preprint arXiv:1306.3181, 2013
32013
The system can't perform the operation now. Try again later.
Articles 1–20