Vaz, Daniel Algorithms and Complexity, MPI for Informatics, Max Planck Society; International Max Planck Research School, MPI for Informatics, Max Planck Society;
https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/30394 (Any fulltext)
Vaz, D. (2020). Approximation Algorithms for Network Design and Cut Problems in Bounded-Treewidth. PhD Thesis, Universität des Saarlandes, Saarbrücken. doi:10.22028/D291-32983.