5 citations · 5 across the 5 of their papers we have counts for
5 papers
Layered tree-independence number and clique-based separators
Clément Dallard, Martin Milanič, Andrea Munaro +1
Motivated by a question of Galby, Munaro, and Yang (SoCG 2023) asking whether every graph class of bounded layered tree-independence number admits clique-based separators of sublin…
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…
Comparing Width Parameters on Graph Classes
Nick Brettell, Andrea Munaro, Daniël Paulusma +1
We study how the relationship between non-equivalent width parameters changes once we restrict to some special graph class. As width parameters, we consider treewidth, clique-width…
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…
On algorithmic applications of sim-width and mim-width of -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…