1. Bellenbaum, P., Diestel, R.: Two short proofs concerning tree-decompositions. Comb. Probab. Comput. 11(6), 541–547 (2002)
2. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)
3. Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21(2), 358–402 (1996)
4. Booth, H., Govindan, R., Langston, M.A., Ramachandramurthi, S.: Cutwidth approximation in linear time. In: Proceedings of the Second Great Lakes Symposium on VLSI, pp. 70–73. IEEE (1992)
5. Chatzidimitriou, D., Raymond, J., Sau, I., Thilikos, D.M.: An $${O}(\log {OPT})$$ O ( log OPT ) -approximation for covering/packing minor models of $$\theta _r$$ θ r . In: Proceedings of WAOA 2015, pp. 122–132 (2015). arXiv:1510.03945