activity
20132026
most citedBounding the Mim-Width of Hereditary Graph Classes

12 citations · 46 across the 17 of their papers we have counts for

collaborators
Showing 2026Show all

3 papers · 1 filter

cs.DS2026

Odd Cycle Transversal on -free graphs

Esther Galby, Paloma T. de Lima, Andrea Munaro +1

\textsc{Odd Cycle Transversal} is a classic -hard graph optimization problem asking for a minimum-weight set of vertices whose deletion makes the input graph bipartite…

math.CO2026

Clique-dependent strongly sublinear treewidth and strongly sublinear tree-independence number

Andrea Munaro

We establish a strongly sublinear counterpart of a recent result of Chudnovsky, E S, and Lokshtanov (arXiv 2025) on treewidth and tree-independence number. Namely, we prove that a…

math.CO2026

Subdivided expanders and counterexamples to the Tree Product Conjecture

Andrea Munaro

Distel, Gollin, Harvey, Hendrey, Hickingbotham, Mohar and Wood (2023) conjectured that graphs of degree- polynomial growth can be embedded into the strong product of trees,…