Yixin Cao

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6192481	2024-02-12	Paper
Self-complementary (Pseudo-)Split Graphs	2023-12-16	Paper
Graph Searches and Their End Vertices.	2023-02-03	Paper
Polynomial kernels for paw-free edge modification problems	2022-12-22	Paper
Characterization and linear-time recognition of paired threshold graphs	2022-12-21	Paper
On Fork-free T-perfect Graphs	2022-11-07	Paper
(Sub)linear kernels for edge modification problems toward structured graph classes	2022-10-27	Paper
Graph searches and their end vertices	2022-08-18	Paper
Complementation in T-perfect graphs	2022-06-08	Paper
A \(5k\)-vertex kernel for \(P_2\)-packing	2022-03-23	Paper
A polynomial kernel for diamond-free editing	2022-02-01	Paper
Polynomial kernels for paw-free edge modification problems	2021-10-21	Paper
End vertices of graph searches on bipartite graphs	2021-10-19	Paper
A Polynomial Kernel for Diamond-Free Editing	2021-08-04	Paper
Complementation in t-perfect graphs	2021-04-30	Paper
Vertex Deletion Problems on Chordal Graphs	2020-11-25	Paper
Kernelization for \(P_2\)-packing: a gerrymandering approach	2020-07-07	Paper
Polynomial Kernels for Paw-free Edge Modification Problems	2020-03-25	Paper
Minimum fill-in: inapproximability and almost tight lower bounds	2020-03-12	Paper
A naive algorithm for feedback vertex set	2019-10-25	Paper
Local coloring: new observations and new reductions	2019-10-11	Paper
Interval Deletion is Fixed-Parameter Tractable	2019-06-20	Paper
Interval Deletion Is Fixed-Parameter Tractable	2018-10-30	Paper
Vertex deletion problems on chordal graphs	2018-09-24	Paper
Local Coloring and its Complexity	2018-09-07	Paper
Linear Recognition of Almost Interval Graphs	2018-07-16	Paper
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds	2018-07-16	Paper
Unit interval vertex deletion: fewer vertices are relevant	2018-05-08	Paper
Unit interval editing is fixed-parameter tractable	2017-03-16	Paper
Chordal Editing is Fixed-Parameter Tractable	2017-03-03	Paper
Approximate association via dissociation	2017-01-23	Paper
Approximate association via dissociation	2016-12-22	Paper
Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree	2016-12-22	Paper
Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection	2016-11-24	Paper
Chordal editing is fixed-parameter tractable	2016-06-28	Paper
A 2k-vertex Kernel for Maximum Internal Spanning Tree	2015-10-30	Paper
Unit interval editing is fixed-parameter tractable	2015-10-27	Paper
On feedback vertex set: new measure and new structures	2015-09-03	Paper
Edge deletion problems: branching facilitated by modular decomposition	2015-02-24	Paper
Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time	2014-09-02	Paper
An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem	2014-04-15	Paper
An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem	2013-08-16	Paper
On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem	2013-05-28	Paper
Cluster editing: kernelization based on edge cuts	2012-11-21	Paper
Cluster Editing: Kernelization Based on Edge Cuts	2010-12-07	Paper
On Feedback Vertex Set New Measure and New Structures	2010-06-22	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Yixin Cao