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.
@article{arxiv.2008.07968,
title = {Four short stories on surprising algorithmic uses of treewidth},
author = {Dániel Marx},
journal= {arXiv preprint arXiv:2008.07968},
year = {2020}
}