The D-FLAT System for Dynamic Programming on Tree Decompositions. - Michael Abseher; Bernhard Bliem; Günther Charwat; Frederico Dusberger; Markus Hecher; Stefan Woltran (JELIA, 2014)

Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. - Michael Abseher; Frederico Dusberger; Nysret Musliu; Stefan Woltran (IJCAI, 2015)

Providing Built-In Counters in a Declarative Dynamic Programming Environment. - Michael Abseher; Marius Moldovan; Stefan Woltran (KI, 2016)

Shift Design with Answer Set Programming. - Michael Abseher; Martin Gebser; Nysret Musliu; Torsten Schaub; Stefan Woltran (Fundam. Informaticae, 2016)

htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond. - Michael Abseher; Nysret Musliu; Stefan Woltran (CPAIOR, 2017)

Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. - Michael Abseher; Nysret Musliu; Stefan Woltran (J. Artif. Intell. Res., 2017)

Dynamic Programming on Tree Decompositions with D-FLAT. - Michael Abseher; Bernhard Bliem; Markus Hecher; Marius Moldovan; Stefan Woltran (Künstliche Intell., 2018)

Computing secure sets in graphs using answer set programming. - Michael Abseher; Bernhard Bliem; Günther Charwat; Frederico Dusberger; Stefan Woltran (J. Log. Comput., 2020)