Publisher
Springer Nature Switzerland
Reference7 articles.
1. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial $$k$$-trees. Discret. Appl. Math. 23, 11–24 (1989)
2. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305–1317 (1996)
3. Borie, R.B., Parker, R.G., Tovey, C.A.: Solving problems on recursively constructed graphs. ACM Comput. Surv. 41, 4 (2008)
4. Korpelainen, N., Lozin, V., Malyshev, D., Tiskin, A.: Boundary properties of graphs for algorithmic graph problems. Theor. Comput. Sci. 412(29), 3545–3554 (2011)
5. Lozin, V., Razgon, I.: Tree-width dichotomy. Eur. J. Comb. 103, 103517 (2022)