Yixin Cao

Orcid: 0000-0002-6927-438X

Affiliations:
  • Hong Kong Polytechnic University, Department of Computing
  • Hungarian Academy of Sciences, Institute for Computer Science and Control
  • Texas A&M University, Department of Computer Science and Engineering


According to our database1, Yixin Cao authored at least 47 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Self-complementary (Pseudo-)Split Graphs.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023
FedMKGC: Privacy-Preserving Federated Multilingual Knowledge Graph Completion.
CoRR, 2023

Modification Problems Toward Proper (Helly) Circular-Arc Graphs.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Enumerating Maximal Induced Subgraphs.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
A 5<i>k</i>-vertex kernel for <i>P</i><sub>2</sub>-packing.
Theor. Comput. Sci., 2022

End vertices of graph searches on bipartite graphs.
Inf. Process. Lett., 2022

On Fork-free T-perfect Graphs.
CoRR, 2022

Graph Searches and Their End Vertices.
Algorithmica, 2022

A Polynomial Kernel for Diamond-Free Editing.
Algorithmica, 2022

Preface to the Special Issue on Parameterized and Exact Computation.
Algorithmica, 2022

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

2021
Polynomial kernels for paw-free edge modification problems.
Theor. Comput. Sci., 2021

Complementation in T-perfect Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Recognizing (Unit) Interval Graphs by Zigzag Graph Searches.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Improved Kernels for Edge Modification Problems.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020
Preface to the special issue on Computing and Combinatorics.
Theor. Comput. Sci., 2020

Minimum fill-in: Inapproximability and almost tight lower bounds.
Inf. Comput., 2020

Characterization and Linear-Time Recognition of Paired Threshold Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

2019
Preface to the Special Issue on Computing and Combinatorics.
Algorithmica, 2019

Local Coloring: New Observations and New Reductions.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2018
Vertex deletion problems on chordal graphs.
Theor. Comput. Sci., 2018

Unit interval vertex deletion: Fewer vertices are relevant.
J. Comput. Syst. Sci., 2018

A 5k-vertex Kernel for P<sub>2</sub>-packing.
CoRR, 2018

A Naive Algorithm for Feedback Vertex Set.
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Kernelization for P<sub>2</sub>-Packing: A Gerrymandering Approach.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017
Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree.
Inf. Comput., 2017

Unit interval editing is fixed-parameter tractable.
Inf. Comput., 2017

Approximate association via dissociation.
Discret. Appl. Math., 2017

Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection.
Discret. Appl. Math., 2017

An O<sup>*</sup>(1.84s<sup>k</sup>) Parameterized Algorithm for the Multiterminal Cut Problem.
CoRR, 2017

2016
Unit Interval Vertex Deletion: Fewer Vertices are Relevant.
CoRR, 2016

Chordal Editing is Fixed-Parameter Tractable.
Algorithmica, 2016

Linear Recognition of Almost Interval Graphs.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Edge deletion problems: Branching facilitated by modular decomposition.
Theor. Comput. Sci., 2015

Interval Deletion Is Fixed-Parameter Tractable.
ACM Trans. Algorithms, 2015

On Feedback Vertex Set: New Measure and New Structures.
Algorithmica, 2015

A 2k-vertex Kernel for Maximum Internal Spanning Tree.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014
An O(1.84<sup>k</sup>) parameterized algorithm for the multiterminal cut problem.
Inf. Process. Lett., 2014

Linear Recognition of Almost (Unit) Interval Graphs.
CoRR, 2014

The (un)supervised detection of overlapping communities as well as hubs and outliers via (bayesian) NMF.
Proceedings of the 23rd International World Wide Web Conference, 2014

Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time.
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.
SIGACT News, 2013

An Efficient Branching Algorithm for Interval Completion.
CoRR, 2013

On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem.
Proceedings of the Theory and Applications of Models of Computation, 2013

An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012
Cluster Editing: Kernelization Based on Edge Cuts.
Algorithmica, 2012

2010
Weighted Cluster Editing: Kernelization based on Edge Cuts
CoRR, 2010


  Loading...