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. Lecture Notes in Computer Science;M Abseher,2014
3. Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Woltran, S.: Computing secure sets in graphs using answer set programming. J. Logic Comput. (2016). Accepted for publication
4. Abseher, M., Musliu, N., Woltran, S.: Improving the efficiency of dynamic programming on tree decompositions via machine learning. Technical report DBAI-TR-2016-94, TU Wien (2016). http://www.dbai.tuwien.ac.at/research/report/dbai-tr-2016-94.pdf
5. 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)