Kolman, P. (2018). On Algorithms Employing Treewidth for $L$-bounded Cut Problems. Journal of Graph Algorithms and Applications, 22(2), 177–191. https://doi.org/10.7155/jgaa.00462