@article{JGAA_2018_22_2_a1,
     author = {Petr Kolman},
     title = {On {Algorithms} {Employing} {Treewidth} for $L$-bounded {Cut} {Problems}},
     journal = {Journal of graph algorithms and applications},
     pages = {177--191},
     year = {2018},
     volume = {22},
     number = {2},
     doi = {10.7155/jgaa.00462},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00462/}
}