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