2 papers
math.CO2026
Trade-off between spread and width for tree decompositions
Hans L. Bodlaender, Carla Groenland
We study the trade-off between (average) spread and width in tree decompositions, answering several questions from Wood [arXiv:2509.01140]. The spread of a vertex in a tree dec…
cs.DM2025
On the parameterized complexity of computing tree-partitions
Hans L. Bodlaender, Carla Groenland, Hugo Jacob
We study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree. On one hand, we can obta…