Yixin Cao

According to our database, Yixin Cao authored at least 53 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Modification problems toward proper (Helly) circular-arc graphs.

Yixin Cao, Hanchun Yuan, Jianxin Wang

Inf. Comput., 2024

Characterization of Circular-arc Graphs: III. Chordal Graphs.

Yixin Cao, Tomasz Krawczyk

CoRR, 2024

Characterization of Circular-arc Graphs: II. McConnell Flipping.

Yixin Cao, Tomasz Krawczyk

CoRR, 2024

Minimum sum vertex cover: kernelization and parameterized algorithms.

Yixin Cao, Jingyi Liu, Jianxin Wang

CoRR, 2024

Characterization of Chordal Circular-arc Graphs: I. Split Graphs.

Yixin Cao, Jan Derbisz, Tomasz Krawczyk

CoRR, 2024

Switching Classes: Characterization and Computation.

Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Self-complementary (Pseudo-)Split Graphs.

Yixin Cao, Haowei Chen, Shenghua Wang

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better.

Vicente Balmaseda, Ying Xu, Yixin Cao, Nate Veldt

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

FedMKGC: Privacy-Preserving Federated Multilingual Knowledge Graph Completion.

Wei Tang, Zhiqian Wu, Yixin Cao, Yong Liao, Pengyuan Zhou

CoRR, 2023

Enumerating Maximal Induced Subgraphs.

Yixin Cao

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

A 5<i>k</i>-vertex kernel for <i>P</i>₂-packing.

Wenjun Li, Junjie Ye, Yixin Cao

Theor. Comput. Sci., 2022

End vertices of graph searches on bipartite graphs.

Meibiao Zou, Zhifeng Wang, Jianxin Wang, Yixin Cao

Inf. Process. Lett., 2022

On Fork-free T-perfect Graphs.

Yixin Cao, Shenghua Wang

CoRR, 2022

Graph Searches and Their End Vertices.

Guozhen Rong, Yixin Cao, Jian-xin Wang, Zhifeng Wang

Algorithmica, 2022

A Polynomial Kernel for Diamond-Free Editing.

Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye

Algorithmica, 2022

Preface to the Special Issue on Parameterized and Exact Computation.

Yixin Cao, Marcin Pilipczuk

Algorithmica, 2022

(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes.

Gabriel Bathie, Nicolas Bousquet, Yixin Cao, Yuping Ke, Théo Pierron

Algorithmica, 2022

2021

Polynomial kernels for paw-free edge modification problems.

Hanchun Yuan, Yuping Ke, Yixin Cao

Theor. Comput. Sci., 2021

Complementation in T-perfect Graphs.

Yixin Cao, Shenghua Wang

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Recognizing (Unit) Interval Graphs by Zigzag Graph Searches.

Yixin Cao

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Improved Kernels for Edge Modification Problems.

Yixin Cao, Yuping Ke

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

Preface to the special issue on Computing and Combinatorics.

Yixin Cao

Theor. Comput. Sci., 2020

Minimum fill-in: Inapproximability and almost tight lower bounds.

Yixin Cao, R. B. Sandeep

Inf. Comput., 2020

Characterization and Linear-Time Recognition of Paired Threshold Graphs.

Yixin Cao, Guozhen Rong, Jianxin Wang

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

2019

Preface to the Special Issue on Computing and Combinatorics.

Yixin Cao, Jianer Chen

Algorithmica, 2019

Local Coloring: New Observations and New Reductions.

Jie You, Yixin Cao, Jianxin Wang

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2018

Vertex deletion problems on chordal graphs.

Yixin Cao, Yuping Ke, Yota Otachi, Jie You

Theor. Comput. Sci., 2018

Unit interval vertex deletion: Fewer vertices are relevant.

Yuping Ke, Yixin Cao, Xiating Ouyang, Wenjun Li, Jianxin Wang

J. Comput. Syst. Sci., 2018

A 5k-vertex Kernel for P₂-packing.

Wenjun Li, Junjie Ye, Yixin Cao

CoRR, 2018

A Naive Algorithm for Feedback Vertex Set.

Yixin Cao

Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Kernelization for P₂-Packing: A Gerrymandering Approach.

Wenjun Li, Junjie Ye, Yixin Cao

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017

Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree.

Wenjun Li, Yixin Cao, Jianer Chen, Jianxin Wang

Inf. Comput., 2017

Unit interval editing is fixed-parameter tractable.

Yixin Cao

Inf. Comput., 2017

Approximate association via dissociation.

Jie You, Jianxin Wang, Yixin Cao

Discret. Appl. Math., 2017

Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection.

Yixin Cao, Luciano N. Grippo, Martín Darío Safe

Discret. Appl. Math., 2017

An O^*(1.84s^k) Parameterized Algorithm for the Multiterminal Cut Problem.

Yixin Cao, Jianer Chen, Jia-Hao Fan

CoRR, 2017

2016

Unit Interval Vertex Deletion: Fewer Vertices are Relevant.

Yuping Ke, Yixin Cao, Xiating Ouyang, Jianxin Wang

CoRR, 2016

Chordal Editing is Fixed-Parameter Tractable.

Yixin Cao, Dániel Marx

Algorithmica, 2016

Linear Recognition of Almost Interval Graphs.

Yixin Cao

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Edge deletion problems: Branching facilitated by modular decomposition.

Yunlong Liu, Jianxin Wang, Jie You, Jianer Chen, Yixin Cao

Theor. Comput. Sci., 2015

Interval Deletion Is Fixed-Parameter Tractable.

Yixin Cao, Dániel Marx

ACM Trans. Algorithms, 2015

On Feedback Vertex Set: New Measure and New Structures.

Yixin Cao, Jianer Chen, Yang Liu

Algorithmica, 2015

A 2k-vertex Kernel for Maximum Internal Spanning Tree.

Wenjun Li, Jianxin Wang, Jianer Chen, Yixin Cao

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014

An O(1.84^k) parameterized algorithm for the multiterminal cut problem.

Yixin Cao, Jianer Chen, Jia-Hao Fan

Inf. Process. Lett., 2014

Linear Recognition of Almost (Unit) Interval Graphs.

Yixin Cao

CoRR, 2014

The (un)supervised detection of overlapping communities as well as hubs and outliers via (bayesian) NMF.

Xiaochun Cao, Xiao Wang, Di Jin, Yixin Cao, Dongxiao He

Proceedings of the 23rd International World Wide Web Conference, 2014

Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time.

Yixin Cao

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

2013

Review of flows in networks by L. R. Ford Jr. and D. R. Fulkerson.

Yixin Cao

SIGACT News, 2013

An Efficient Branching Algorithm for Interval Completion.

Yixin Cao

CoRR, 2013

On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem.

Yixin Cao, Jianer Chen

Proceedings of the Theory and Applications of Models of Computation, 2013

An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem.

Yixin Cao, Jianer Chen, Jia-Hao Fan

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012

Cluster Editing: Kernelization Based on Edge Cuts.

Yixin Cao, Jianer Chen

Algorithmica, 2012

2010

Weighted Cluster Editing: Kernelization based on Edge Cuts

Yixin Cao, Jianer Chen

CoRR, 2010