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