Weighted Cluster Editing: Kernelization based on Edge Cuts - Yixin Cao 001; Jianer Chen (CoRR, 2010)

Cluster Editing: Kernelization Based on Edge Cuts. - Yixin Cao 001; Jianer Chen (Algorithmica, 2012)

An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem. - Yixin Cao 001; Jianer Chen; Jia-Hao Fan (FCT, 2013)

On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem. - Yixin Cao 001; Jianer Chen (TAMC, 2013)

An Efficient Branching Algorithm for Interval Completion. - Yixin Cao 001 (CoRR, 2013)

Review of flows in networks by L. R. Ford Jr. and D. R. Fulkerson. - Yixin Cao 001 (SIGACT News, 2013)

Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time. - Yixin Cao 001 (FAW, 2014)

The (un)supervised detection of overlapping communities as well as hubs and outliers via (bayesian) NMF. - Xiaochun Cao; Xiao Wang 017; Di Jin 001; Yixin Cao 001; Dongxiao He (WWW (Companion Volume), 2014)

Linear Recognition of Almost (Unit) Interval Graphs. - Yixin Cao 001 (CoRR, 2014)

An O(1.84k) parameterized algorithm for the multiterminal cut problem. - Yixin Cao 001; Jianer Chen; Jia-Hao Fan (Inf. Process. Lett., 2014)

A 2k-vertex Kernel for Maximum Internal Spanning Tree. - Wenjun Li 001; Jianxin Wang 001; Jianer Chen; Yixin Cao 001 (WADS, 2015)

On Feedback Vertex Set: New Measure and New Structures. - Yixin Cao 001; Jianer Chen; Yang Liu 002 (Algorithmica, 2015)

Interval Deletion Is Fixed-Parameter Tractable. - Yixin Cao 001; Dániel Marx (ACM Trans. Algorithms, 2015)

Edge deletion problems: Branching facilitated by modular decomposition. - Yunlong Liu 001; Jianxin Wang 001; Jie You; Jianer Chen; Yixin Cao 001 (Theor. Comput. Sci., 2015)

Linear Recognition of Almost Interval Graphs. - Yixin Cao 001 (SODA, 2016)

Chordal Editing is Fixed-Parameter Tractable. - Yixin Cao 001; Dániel Marx (Algorithmica, 2016)

Unit Interval Vertex Deletion: Fewer Vertices are Relevant. - Yuping Ke; Yixin Cao 001; Xiating Ouyang; Jianxin Wang 001 (CoRR, 2016)

An O*(1.84sk) Parameterized Algorithm for the Multiterminal Cut Problem. - Yixin Cao 001; Jianer Chen; Jia-Hao Fan (CoRR, 2017)

Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection. - Yixin Cao 001; Luciano N. Grippo; Martín Darío Safe (Discret. Appl. Math., 2017)

Approximate association via dissociation. - Jie You; Jianxin Wang 001; Yixin Cao 001 (Discret. Appl. Math., 2017)

Unit interval editing is fixed-parameter tractable. - Yixin Cao 001 (Inf. Comput., 2017)

Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree. - Wenjun Li 001; Yixin Cao 001; Jianer Chen; Jianxin Wang 001 (Inf. Comput., 2017)

Kernelization for P2-Packing: A Gerrymandering Approach. - Wenjun Li 001; Junjie Ye; Yixin Cao 001 (FAW, 2018)

A Naive Algorithm for Feedback Vertex Set. - Yixin Cao 001 (SOSA, 2018)

A 5k-vertex Kernel for P2-packing. - Wenjun Li 001; Junjie Ye; Yixin Cao 001 (CoRR, 2018)

Unit interval vertex deletion: Fewer vertices are relevant. - Yuping Ke; Yixin Cao 001; Xiating Ouyang; Wenjun Li 001; Jianxin Wang 001 (J. Comput. Syst. Sci., 2018)

Vertex deletion problems on chordal graphs. - Yixin Cao 001; Yuping Ke; Yota Otachi; Jie You (Theor. Comput. Sci., 2018)

Local Coloring: New Observations and New Reductions. - Jie You; Yixin Cao 001; Jianxin Wang 001 (FAW, 2019)

Preface to the Special Issue on Computing and Combinatorics. - Yixin Cao 001; Jianer Chen (Algorithmica, 2019)

Characterization and Linear-Time Recognition of Paired Threshold Graphs. - Yixin Cao 001; Guozhen Rong; Jianxin Wang 001 (WG, 2020)

Minimum fill-in: Inapproximability and almost tight lower bounds. - Yixin Cao 001; R. B. Sandeep (Inf. Comput., 2020)

Preface to the special issue on Computing and Combinatorics. - Yixin Cao 001 (Theor. Comput. Sci., 2020)

Improved Kernels for Edge Modification Problems. - Yixin Cao 001; Yuping Ke (IPEC, 2021)

Recognizing (Unit) Interval Graphs by Zigzag Graph Searches. - Yixin Cao 001 (SOSA, 2021)

Complementation in T-perfect Graphs. - Yixin Cao 001; Shenghua Wang (WG, 2021)

Polynomial kernels for paw-free edge modification problems. - Hanchun Yuan; Yuping Ke; Yixin Cao 001 (Theor. Comput. Sci., 2021)

(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes. - Gabriel Bathie; Nicolas Bousquet 001; Yixin Cao 001; Yuping Ke; Théo Pierron (Algorithmica, 2022)

Preface to the Special Issue on Parameterized and Exact Computation. - Yixin Cao 001; Marcin Pilipczuk (Algorithmica, 2022)

A Polynomial Kernel for Diamond-Free Editing. - Yixin Cao 001; Ashutosh Rai 001; R. B. Sandeep; Junjie Ye (Algorithmica, 2022)

Graph Searches and Their End Vertices. - Guozhen Rong; Yixin Cao 001; Jian-xin Wang 001; Zhifeng Wang (Algorithmica, 2022)

On Fork-free T-perfect Graphs. - Yixin Cao 001; Shenghua Wang (CoRR, 2022)

End vertices of graph searches on bipartite graphs. - Meibiao Zou; Zhifeng Wang; Jianxin Wang 001; Yixin Cao 001 (Inf. Process. Lett., 2022)

A 5k-vertex kernel for P2-packing. - Wenjun Li 001; Junjie Ye; Yixin Cao 001 (Theor. Comput. Sci., 2022)

Enumerating Maximal Induced Subgraphs. - Yixin Cao 001 (ESA, 2023)

FedMKGC: Privacy-Preserving Federated Multilingual Knowledge Graph Completion. - Wei Tang 015; Zhiqian Wu; Yixin Cao 001; Yong Liao; Pengyuan Zhou (CoRR, 2023)

Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better. - Vicente Balmaseda; Ying Xu; Yixin Cao 001; Nate Veldt (ICML, 2024)

Self-complementary (Pseudo-)Split Graphs. - Yixin Cao 001; Haowei Chen; Shenghua Wang (LATIN (2), 2024)

Switching Classes: Characterization and Computation. - Dhanyamol Antony; Yixin Cao 001; Sagartanu Pal; R. B. Sandeep (MFCS, 2024)

Characterization of Chordal Circular-arc Graphs: I. Split Graphs. - Yixin Cao 001; Jan Derbisz; Tomasz Krawczyk (CoRR, 2024)

Minimum sum vertex cover: kernelization and parameterized algorithms. - Yixin Cao 001; Jingyi Liu; Jianxin Wang 001 (CoRR, 2024)

Characterization of Circular-arc Graphs: II. McConnell Flipping. - Yixin Cao 001; Tomasz Krawczyk (CoRR, 2024)

Characterization of Circular-arc Graphs: III. Chordal Graphs. - Yixin Cao 001; Tomasz Krawczyk (CoRR, 2024)

Modification problems toward proper (Helly) circular-arc graphs. - Yixin Cao 001; Hanchun Yuan; Jianxin Wang 001 (Inf. Comput., 2024)

Minimum sum vertex cover: Difficulty of ordering. - Jingyi Liu; Yixin Cao 001; Ling Gai; Jianxin Wang (Theor. Comput. Sci., 2025)

On well (edge) dominated and equimatchable strong product graphs. - Yixin Cao 001; Guiqiang Mou; Jianxin Wang (Discret. Math., 2026)