Four short stories on surprising algorithmic uses of treewidth

TL;DR

This paper explores four algorithmic problems where leveraging treewidth, despite not being directly related, enables the development of elegant and high-level solutions by combining existing results.

Contribution

It introduces four novel algorithmic applications of treewidth to solve problems in a simplified and unified manner.

Findings

Treewidth-based techniques simplify complex algorithms.

Combining known results yields high-level solutions.

Four new applications demonstrate the versatility of treewidth.

Abstract

This article briefly describes four algorithmic problems where the notion of treewidth is very useful. Even though the problems themselves have nothing to do with treewidth, it turns out that combining known results on treewidth allows us to easily describe very clean and high-level algorithms.