Kolman, Petr. “On Algorithms Employing Treewidth for $L$-Bounded Cut Problems”. Journal of Graph Algorithms and Applications, vol. 22, no. 2, Jan. 2018, pp. 177-91, doi:10.7155/jgaa.00462.