D-FLAT: Declarative problem solving using tree decompositions and answer-set programming. - Bernhard Bliem; Michael Morak; Stefan Woltran (Theory Pract. Log. Program., 2012)

Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem. - Bernhard Bliem; Reinhard Pichler; Stefan Woltran (IPEC, 2013)

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)

Subset Minimization in Dynamic Programming on Tree Decompositions. - Bernhard Bliem; Günther Charwat; Markus Hecher; Stefan Woltran (AAAI Workshop: Beyond NP, 2016)

On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. - Bernhard Bliem; Markus Hecher; Stefan Woltran (COMMA, 2016)

Clique-Width and Directed Width Measures for Answer-Set Programming. - Bernhard Bliem; Sebastian Ordyniak; Stefan Woltran (ECAI, 2016)

Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels. - Bernhard Bliem; Robert Bredereck; Rolf Niedermeier (IJCAI, 2016)

ASP for Anytime Dynamic Programming on Tree Decompositions. - Bernhard Bliem; Benjamin Kaufmann; Torsten Schaub; Stefan Woltran (IJCAI, 2016)

D-FLAT2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. - Bernhard Bliem; Günther Charwat; Markus Hecher; Stefan Woltran (Fundam. Informaticae, 2016)

Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs. - Bernhard Bliem (Ausgezeichnete Informatikdissertationen, 2017)

Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs. - Bernhard Bliem (ICLP (Technical Communications), 2017)

The Impact of Treewidth on ASP Grounding and Solving. - Bernhard Bliem; Marius Moldovan; Michael Morak; Stefan Woltran (IJCAI, 2017)

Implementing Courcelle's Theorem in a declarative framework for dynamic programming. - Bernhard Bliem; Reinhard Pichler; Stefan Woltran (J. Log. Comput., 2017)

ASP Programs with Groundings of Small Treewidth. - Bernhard Bliem (FoIKS, 2018)

Complexity of Secure Sets. - Bernhard Bliem; Stefan Woltran (Algorithmica, 2018)

Equivalence between answer-set programs under (partially) fixed input. - Bernhard Bliem; Stefan Woltran (Ann. Math. Artif. Intell., 2018)

Defensive alliances in graphs of bounded treewidth. - Bernhard Bliem; Stefan Woltran (Discret. Appl. Math., 2018)

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

Centrality Heuristics for Exact Model Counting. - Bernhard Bliem; Matti Järvisalo (ICTAI, 2019)

The Impact of Treewidth on Grounding and Solving of Answer Set Programs. - Bernhard Bliem; Michael Morak; Marius Moldovan; Stefan Woltran (J. Artif. Intell. Res., 2020)

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