The following pages link to Yixin Cao (Q300458):
Displaying 48 items.
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Approximate association via dissociation (Q505447) (← links)
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- Kernelization for \(P_2\)-packing: a gerrymandering approach (Q777283) (← links)
- Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
- Cluster editing: kernelization based on edge cuts (Q1759680) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- A polynomial kernel for diamond-free editing (Q2072105) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- Characterization and linear-time recognition of paired threshold graphs (Q2110631) (← links)
- A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← links)
- Graph searches and their end vertices (Q2165035) (← links)
- End vertices of graph searches on bipartite graphs (Q2234808) (← links)
- Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
- Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
- Local coloring: new observations and new reductions (Q2327086) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- Complementation in T-perfect graphs (Q2672429) (← links)
- An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem (Q2842775) (← links)
- Chordal Editing is Fixed-Parameter Tractable (Q2965485) (← links)
- Cluster Editing: Kernelization Based on Edge Cuts (Q3058692) (← links)
- Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time (Q3188829) (← links)
- A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
- On Feedback Vertex Set New Measure and New Structures (Q3569882) (← links)
- Linear Recognition of Almost Interval Graphs (Q4575657) (← links)
- Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds (Q4575794) (← links)
- On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem (Q4922138) (← links)
- Interval Deletion Is Fixed-Parameter Tractable (Q4962179) (← links)
- A Polynomial Kernel for Diamond-Free Editing (Q5009567) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
- A naive algorithm for feedback vertex set (Q5240414) (← links)
- Interval Deletion is Fixed-Parameter Tractable (Q5383968) (← links)
- Graph Searches and Their End Vertices. (Q5875561) (← links)
- Polynomial kernels for paw-free edge modification problems (Q5918603) (← links)
- Polynomial kernels for paw-free edge modification problems (Q5919117) (← links)
- (Q6192481) (← links)
- Characterization of Chordal Circular-arc Graphs: I. Split Graphs (Q6524490) (← links)
- Switching Classes: Characterization and Computation (Q6524983) (← links)
- Recognizing (unit) interval graphs by zigzag graph searches (Q6538748) (← links)
- Modification problems toward proper (Helly) circular-arc graphs (Q6647659) (← links)
- Modification problems toward proper (Helly) circular-arc graphs (Q6647753) (← links)
- Enumerating maximal induced subgraphs (Q6656975) (← links)
- On well (edge) dominated and equimatchable strong product graphs (Q6734659) (← links)
- Characterization of Circular-arc Graphs: II. McConnell Flipping (Q6741118) (← links)
- Characterization of Circular-arc Graphs: III. Chordal Graphs (Q6743033) (← links)
