Shizhou Yang

activity

20222025

most citedOn algorithmic applications of sim-width and mim-width of

(H_{1}, H_{2})

-free graphs

5 citations · 5 across the 5 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2024

Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs

Esther Galby, Andrea Munaro, Shizhou Yang

We investigate a relaxation of the notion of fractional treewidth-fragility, namely fractional tree-independence-number-fragility. In particular, we obtain polynomial-time approxim…

cs.DS2023

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs

Esther Galby, Andrea Munaro, Shizhou Yang

We investigate a relaxation of the notion of treewidth-fragility, namely tree-independence-number-fragility. In particular, we obtain polynomial-time approximation schemes for inde…

cs.DS2022★ 5 cited

On algorithmic applications of sim-width and mim-width of $(H_{1}, H_{2})$ -free graphs

Andrea Munaro, Shizhou Yang

Mim-width and sim-width are among the most powerful graph width parameters, with sim-width more powerful than mim-width, which is in turn more powerful than clique-width. While sev…

Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs

On algorithmic applications of sim-width and mim-width of (H1​,H2​)-free graphs

On algorithmic applications of sim-width and mim-width of $(H_{1}, H_{2})$ -free graphs