Author:
Kontinen Juha,Meier Arne,Mahmood Yasir
Publisher
Springer International Publishing
Reference28 articles.
1. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a $$k$$-tree. SIAM J. Algebraic Discrete Meth. (1987). https://doi.org/10.1137/0608024
2. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern., 11(1–2), 1–21 (1993). https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3417
3. Bodlaender, H.L.: Discovering treewidth. In: SOFSEM, vol. 3381 of Lecture Notes in Computer Science, pp. 1–16. Springer (2005). https://doi.org/10.1007/978-3-540-30577-4_1
4. Fundamentals of Parameterized Complexity. TCS. Springer, London (2013). https://doi.org/10.1007/978-1-4471-5559-1
5. Durand, A., Kontinen, J.: Hierarchies in dependence logic. ACM Trans. Comput. Logic (TOCL) 13(4), 31 (2012). https://doi.org/10.1145/2362355.2362359