31 citations · 126 across the 26 of their papers we have counts for
4 papers · 1 filter
Minimum Sum Set Cover: Structures and Algorithm
Zhongyi Zhang, Yixin Cao
A set cover of a hypergraph is a set of vertices intersecting every hyperedge. In the minimum sum set cover problem, vertices are selected one by one; each edge pays the positi…
On Fork-free T-perfect Graphs
Yixin Cao, Shenghua Wang
In an attempt to understanding the complexity of the independent set problem, Chv{á}tal defined t-perfect graphs. While a full characterization of this class is still at large, pro…
Forbidden Induced Subgraphs of Normal Helly Circular-Arc Graphs: Characterization and Detection
Yixin Cao, Luciano N. Grippo, Martín D. Safe
A normal Helly circular-arc graph is the intersection graph of arcs on a circle of which no three or less arcs cover the whole circle. Lin, Soulignac, and Szwarcfiter [Discrete App…
Linear Recognition of Almost Interval Graphs
Yixin Cao
Let $\mbox{interval} + k v$, $\mbox{interval} + k e$, and $\mbox{interval} - k e$ denote the classes of graphs that can be obtained from some interval graph by adding vertices,…