关注
Yixin Cao
标题
引用次数
引用次数
年份
On feedback vertex set new measure and new structures
Y Cao, J Chen, Y Liu
Algorithmica 73 (1), 63-86, 2015
1412015
Interval deletion is fixed-parameter tractable
Y Cao, D Marx
ACM Transactions on Algorithms 11 (3), 21, 2015
772015
Chordal editing is fixed-parameter tractable
Y Cao, D Marx
Algorithmica 75 (1), 118-137, 2016
742016
Cluster editing: Kernelization based on edge cuts
Y Cao, J Chen
Algorithmica 64 (1), 152-169, 2012
672012
Linear recognition of almost interval graphs
Y Cao
Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms …, 2016
562016
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
48*2017
Unit interval editing is fixed-parameter tractable
Y Cao
Information and Computation 253, 109-126, 2017
352017
Minimum fill-in: Inapproximability and almost tight lower bounds
Y Cao, RB Sandeep
Information and Computation 271, 104514, 2020
212020
Approximate association via dissociation
J You, J Wang, Y Cao
Discrete Applied Mathematics 219, 202-209, 2017
212017
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
202014
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
182015
A Naive Algorithm for Feedback Vertex Set
Y Cao
arXiv preprint arXiv:1707.08684, 2017
142017
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
14*2017
Unit interval vertex deletion: Fewer vertices are relevant
Y Ke, Y Cao, X Ouyang, J Wang
arXiv preprint arXiv:1607.01162, 2016
122016
Enumerating Maximal Induced Subgraphs
Y Cao
arXiv preprint arXiv:2004.09885, 2020
102020
Vertex deletion problems on chordal graphs
Y Cao, Y Ke, Y Otachi, J You
Theoretical Computer Science 745, 75-86, 2018
92018
A polynomial kernel for diamond-free editing
Y Cao, A Rai, RB Sandeep, J Ye
Algorithmica, 1-19, 2021
82021
Graph Searches and Their End Vertices
G Rong, Y Cao, J Wang, Z Wang
Algorithmica, 1-25, 2022
6*2022
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
62014
Polynomial kernels for paw-free edge modification problems
H Yuan, Y Ke, Y Cao
Theoretical Computer Science 891, 1-12, 2021
52021
系统目前无法执行此操作,请稍后再试。
文章 1–20