1. Bannach, M., Berndt, S., Ehlers, T.: Jdrasil: a modular library for computing tree decompositions. In: Iliopoulos, C.S., Pissis, S.P., Puglisi, S.J., Raman, R. (eds.) 16th International Symposium on Experimental Algorithms, SEA 2017, London, UK, 21–23 June 2017, vol. 75, pp. 28:1–28:21. LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)
2. Berg, J., Järvisalo, M.: SAT-based approaches to treewidth computation: an evaluation. In: 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, 10–12 November 2014, pp. 328–335. IEEE Computer Society (2014)
3. Dechter, R., Mateescu, R.: AND/OR search spaces for graphical models. Artif. Intell. 171(2–3), 73–106 (2007)
4. Lecture Notes in Computer Science;JK Fichte,2018
5. Lecture Notes in Computer Science;JK Fichte,2017