[1]
P. Kolman, “On Algorithms Employing Treewidth for $L$-bounded Cut Problems”, JGAA, vol. 22, no. 2, pp. 177–191, Jan. 2018.