%0 Journal Article
%A Petr Kolman
%T On Algorithms Employing Treewidth for $L$-bounded Cut Problems
%J Journal of Graph Algorithms and Applications
%D 2018
%P 177-191
%V 22
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00462/
%R 10.7155/jgaa.00462
%G en
%F JGAA_2018_22_2_a1