Follow
Yixin Cao
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
1522015
Cluster editing: Kernelization based on edge cuts
Y Cao, J Chen
Algorithmica 64 (1), 152-169, 2012
852012
Chordal editing is fixed-parameter tractable
Y Cao, D Marx
Algorithmica 75 (1), 118-137, 2016
842016
Interval deletion is fixed-parameter tractable
Y Cao, D Marx
ACM Transactions on Algorithms 11 (3), 21, 2015
832015
Linear recognition of almost interval graphs
Y Cao
Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms …, 2016
682016
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
57*2017
Unit interval editing is fixed-parameter tractable
Y Cao
Information and Computation 253, 109-126, 2017
392017
Minimum fill-in: Inapproximability and almost tight lower bounds
Y Cao, RB Sandeep
Information and Computation 271, 104514, 2020
282020
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
262015
Approximate association via dissociation
J You, J Wang, Y Cao
Discrete Applied Mathematics 219, 202-209, 2017
252017
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
232014
Vertex deletion problems on chordal graphs
Y Cao, Y Ke, Y Otachi, J You
Theoretical Computer Science 745, 75-86, 2018
192018
A Naive Algorithm for Feedback Vertex Set
Y Cao
arXiv preprint arXiv:1707.08684, 2017
192017
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
17*2017
Unit interval vertex deletion: Fewer vertices are relevant
Y Ke, Y Cao, X Ouyang, J Wang
arXiv preprint arXiv:1607.01162, 2016
142016
Graph Searches and Their End Vertices
G Rong, Y Cao, J Wang, Z Wang
Algorithmica, 1-25, 2022
13*2022
Enumerating Maximal Induced Subgraphs
Y Cao
arXiv preprint arXiv:2004.09885, 2020
122020
A polynomial kernel for diamond-free editing
Y Cao, A Rai, RB Sandeep, J Ye
Algorithmica, 1-19, 2021
92021
Recognizing (Unit) Interval Graphs by Zigzag Graph Searches∗
Y Cao
Symposium on Simplicity in Algorithms (SOSA), 92-106, 2021
92021
End vertices of graph searches on bipartite graphs
M Zou, Z Wang, J Wang, Y Cao
Information Processing Letters 173, 106176, 2022
82022
The system can't perform the operation now. Try again later.
Articles 1–20