1. Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Hecher, M., Woltran, S.: D-FLAT: Progress report. Technical Report DBAI-TR-2014-86, Vienna University of Technology (2014)
2. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods 8(2), 277–284 (1987)
3. Aschinger, M., Drescher, C., Gottlob, G., Jeavons, P., Thorstensen, E.: Structural decomposition methods and what they are good for. In: Proc. STACS. LIPIcs, vol. 9, pp. 12–28. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
4. Bliem, B., Morak, M., Woltran, S.: D-FLAT: Declarative problem solving using tree decompositions and answer-set programming. TPLP 12(4-5), 445–464 (2012)
5. Lecture Notes in Computer Science;B. Bliem,2013