Yixin Cao

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 58

Top Topics

Bipartite Graph

Polynomial Kernels

Top Venues

Theor. Comput. Sci.

Publications

Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep
Switching Classes: Characterization and Computation. CoRR (2024)
Yixin Cao, Haowei Chen, Shenghua Wang
Self-complementary (Pseudo-)Split Graphs. LATIN (2) (2024)
Yixin Cao, Jan Derbisz, Tomasz Krawczyk
Characterization of Chordal Circular-arc Graphs: I. Split Graphs. CoRR (2024)
Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep
Switching Classes: Characterization and Computation. MFCS (2024)
Yixin Cao, Jingyi Liu, Jianxin Wang
Minimum sum vertex cover: kernelization and parameterized algorithms. CoRR (2024)
Yixin Cao, Hanchun Yuan, Jianxin Wang
Modification problems toward proper (Helly) circular-arc graphs. Inf. Comput. 301 (2024)
Vicente Balmaseda, Ying Xu, Yixin Cao, Nate Veldt
Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better. CoRR (2024)
Yixin Cao
Enumerating Maximal Induced Subgraphs. ESA (2023)
Yixin Cao, Hanchun Yuan, Jianxin Wang
Modification Problems Toward Proper (Helly) Circular-Arc Graphs. MFCS (2023)
Wei Tang, Zhiqian Wu, Yixin Cao, Yong Liao, Pengyuan Zhou
FedMKGC: Privacy-Preserving Federated Multilingual Knowledge Graph Completion. CoRR (2023)
Yixin Cao, Jianxin Wang, Hanchun Yuan
Modification Problems toward Proper (Helly) Circular-arc Graphs. CoRR (2022)
Gabriel Bathie, Nicolas Bousquet, Yixin Cao, Yuping Ke, Théo Pierron
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes. Algorithmica 84 (11) (2022)
Meibiao Zou, Zhifeng Wang, Jianxin Wang, Yixin Cao
End vertices of graph searches on bipartite graphs. Inf. Process. Lett. 173 (2022)
Yixin Cao, Marcin Pilipczuk
Preface to the Special Issue on Parameterized and Exact Computation. Algorithmica 84 (8) (2022)
Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye
A Polynomial Kernel for Diamond-Free Editing. Algorithmica 84 (1) (2022)
Wenjun Li, Junjie Ye, Yixin Cao
-packing. Theor. Comput. Sci. 910 (2022)
Yixin Cao, Shenghua Wang
On Fork-free T-perfect Graphs. CoRR (2022)
Guozhen Rong, Yixin Cao, Jian-xin Wang, Zhifeng Wang
Graph Searches and Their End Vertices. Algorithmica 84 (9) (2022)
Yixin Cao, Yuping Ke
Improved Kernels for Edge Modification Problems. IPEC (2021)
Hanchun Yuan, Yuping Ke, Yixin Cao
Polynomial kernels for paw-free edge modification problems. Theor. Comput. Sci. 891 (2021)
Yixin Cao, Shenghua Wang
Complementation in t-perfect graphs. CoRR (2021)
Yixin Cao
Recognizing (Unit) Interval Graphs by Zigzag Graph Searches. SOSA (2021)
Yixin Cao, Yuping Ke
Improved Kernels for Edge Modification Problems. CoRR (2021)
Yixin Cao, Shenghua Wang
Complementation in T-perfect Graphs. WG (2021)
Yixin Cao, Yuping Ke, Hanchun Yuan
Polynomial Kernels for Paw-Free Edge Modification Problems. TAMC (2020)
Yixin Cao
Recognizing (Unit) Interval Graphs by Zigzag Graph Searches. CoRR (2020)
Yixin Cao
Enumerating Maximal Induced Subgraphs. CoRR (2020)
Yixin Cao, R. B. Sandeep
Minimum fill-in: Inapproximability and almost tight lower bounds. Inf. Comput. 271 (2020)
Yixin Cao, Guozhen Rong, Jianxin Wang
Characterization and Linear-Time Recognition of Paired Threshold Graphs. WG (2020)
Yixin Cao, Yuping Ke, Hanchun Yuan
Polynomial Kernels for Paw-free Edge Modification Problems. CoRR (2020)
Yixin Cao
Preface to the special issue on Computing and Combinatorics. Theor. Comput. Sci. 818 (2020)
Yixin Cao, Jianer Chen
Preface to the special issue on computing and combinatorics. J. Comb. Optim. 37 (2) (2019)
Jie You, Yixin Cao, Jianxin Wang
Local Coloring: New Observations and New Reductions. FAW (2019)
Yixin Cao, Zhifeng Wang, Guozhen Rong, Jianxin Wang
Graph Searches and Their End Vertices. ISAAC (2019)
Yixin Cao, Guozhen Rong, Jianxin Wang, Zhifeng Wang
Graph Searches and Their End Vertices. CoRR (2019)
Yixin Cao, Jianer Chen
Preface to the Special Issue on Computing and Combinatorics. Algorithmica 81 (11-12) (2019)
Guozhen Rong, Yixin Cao, Jianxin Wang
Characterization and Linear-time Recognition of Paired Threshold Graphs. CoRR (2019)
Yixin Cao, Yuping Ke, Yota Otachi, Jie You
Vertex deletion problems on chordal graphs. Theor. Comput. Sci. 745 (2018)
Yuping Ke, Yixin Cao, Xiating Ouyang, Wenjun Li, Jianxin Wang
Unit interval vertex deletion: Fewer vertices are relevant. J. Comput. Syst. Sci. 95 (2018)
Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye
A Polynomial Kernel for Diamond-Free Editing. CoRR (2018)
Wenjun Li, Junjie Ye, Yixin Cao
-Packing: A Gerrymandering Approach. FAW (2018)
Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye
A Polynomial Kernel for Diamond-Free Editing. ESA (2018)
Yixin Cao
A Naive Algorithm for Feedback Vertex Set. SOSA (2018)
Wenjun Li, Junjie Ye, Yixin Cao
-packing. CoRR (2018)
Yixin Cao
Unit interval editing is fixed-parameter tractable. Inf. Comput. 253 (2017)
Yixin Cao
A Naive Algorithm for Feedback Vertex Set. CoRR (2017)
Yixin Cao, Jianer Chen, Jia-Hao Fan
) Parameterized Algorithm for the Multiterminal Cut Problem. CoRR (2017)
Wenjun Li, Yixin Cao, Jianer Chen, Jianxin Wang
Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree. Inf. Comput. 252 (2017)
Yixin Cao, Luciano N. Grippo, Martín Darío Safe
Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection. Discret. Appl. Math. 216 (2017)
Yixin Cao, R. B. Sandeep
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds. SODA (2017)
Jie You, Jianxin Wang, Yixin Cao
Approximate association via dissociation. Discret. Appl. Math. 219 (2017)
Yixin Cao, Yuping Ke, Yota Otachi, Jie You
Vertex Deletion Problems on Chordal Graphs. CoRR (2017)
Yixin Cao, Yuping Ke, Yota Otachi, Jie You
Vertex Deletion Problems on Chordal Graphs. FSTTCS (2017)
Yixin Cao, Dániel Marx
Chordal Editing is Fixed-Parameter Tractable. Algorithmica 75 (1) (2016)
Yixin Cao
Linear Recognition of Almost Interval Graphs. SODA (2016)
Jie You, Jianxin Wang, Yixin Cao
Approximate Association via Dissociation. WG (2016)
Yuping Ke, Yixin Cao, Xiating Ouyang, Jianxin Wang
Unit Interval Vertex Deletion: Fewer Vertices are Relevant. CoRR (2016)
Yixin Cao, R. B. Sandeep
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds. CoRR (2016)
Yixin Cao, Jianer Chen, Yang Liu
On Feedback Vertex Set: New Measure and New Structures. Algorithmica 73 (1) (2015)
Wenjun Li, Jianxin Wang, Jianer Chen, Yixin Cao
A 2k-vertex Kernel for Maximum Internal Spanning Tree. WADS (2015)
Yixin Cao
Unit Interval Editing is Fixed-Parameter Tractable. CoRR (2015)
Yixin Cao, Dániel Marx
Interval Deletion Is Fixed-Parameter Tractable. ACM Trans. Algorithms 11 (3) (2015)
Yunlong Liu, Jianxin Wang, Jie You, Jianer Chen, Yixin Cao
Edge deletion problems: Branching facilitated by modular decomposition. Theor. Comput. Sci. 573 (2015)
Jie You, Jianxin Wang, Yixin Cao
Approximate Association via Dissociation. CoRR (2015)
Yixin Cao
Unit Interval Editing is Fixed-Parameter Tractable. ICALP (1) (2015)
Yixin Cao, Luciano N. Grippo, Martín Darío Safe
Forbidden Induced Subgraphs of Normal Helly Circular-Arc Graphs: Characterization and Detection. CoRR (2014)
Xiaochun Cao, Xiao Wang, Di Jin, Yixin Cao, Dongxiao He
The (un)supervised detection of overlapping communities as well as hubs and outliers via (bayesian) NMF. WWW (Companion Volume) (2014)
Wenjun Li, Jianxin Wang, Jianer Chen, Yixin Cao
A $2k$-Vertex Kernel for Maximum Internal Spanning Tree. CoRR (2014)
Yixin Cao
Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time. FAW (2014)
Yixin Cao, Jianer Chen, Jia-Hao Fan
) parameterized algorithm for the multiterminal cut problem. Inf. Process. Lett. 114 (4) (2014)
Yixin Cao, Dániel Marx
Chordal Editing is Fixed-Parameter Tractable. CoRR (2014)
Yixin Cao, Dániel Marx
Chordal Editing is Fixed-Parameter Tractable. STACS (2014)
Yixin Cao, Dániel Marx
Interval Deletion is Fixed-Parameter Tractable. SODA (2014)
Yixin Cao
Linear Recognition of Almost (Unit) Interval Graphs. CoRR (2014)
Yixin Cao, Jianer Chen, Jia-Hao Fan
An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem. FCT (2013)
Yixin Cao
An Efficient Branching Algorithm for Interval Completion. CoRR (2013)
Yixin Cao
Review of flows in networks by L. R. Ford Jr. and D. R. Fulkerson. SIGACT News 44 (2) (2013)
Yixin Cao, Jianer Chen
On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem. TAMC (2013)
Yixin Cao, Jianer Chen
Cluster Editing: Kernelization Based on Edge Cuts. Algorithmica 64 (1) (2012)
Yixin Cao, Dániel Marx
Interval Deletion is Fixed-Parameter Tractable CoRR (2012)
Yixin Cao, Jianer Chen, Yang Liu
On Feedback Vertex Set New Measure and New Structures. SWAT (2010)
Yixin Cao, Jianer Chen
Weighted Cluster Editing: Kernelization based on Edge Cuts CoRR (2010)
Yixin Cao, Jianer Chen
Cluster Editing: Kernelization Based on Edge Cuts. IPEC (2010)
Yixin Cao, Jianer Chen, Yang Liu
On Feedback Vertex Set, New Measure and New Structures CoRR (2010)