Author:
Lampis Michael,Mengel Stefan,Mitsou Valia
Publisher
Springer International Publishing
Reference38 articles.
1. Arieli, O., Caminada, M.W.A.: A general QBF-based formalization of abstract argumentation theory. In: Verheij, B., Szeider, S., Woltran, S. (eds.) Computational Models of Argument, COMMA 2012, pp. 105–116 (2012)
2. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23(1), 11–24 (1989)
3. Atserias, A., Oliva, S.: Bounded-width QBF is PSPACE-complete. J. Comput. Syst. Sci. 80(7), 1415–1429 (2014)
4. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)
5. Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: An o(c
$${}^{\wedge }$$
∧
k n) 5-approximation algorithm for treewidth. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, pp. 499–508 (2013)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Reasoning in Assumption-Based Argumentation Using Tree-Decompositions;Logics in Artificial Intelligence;2023
2. Default logic and bounded treewidth;Information and Computation;2020-12
3. Lower Bounds for QBFs of Bounded Treewidth;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08
4. Revisiting Graph Width Measures for CNF-Encodings;Lecture Notes in Computer Science;2019