| 2019 | ICTAI | Centrality Heuristics for Exact Model Counting. | Bernhard Bliem, Matti Jrvisalo |
| 2017 | ICLP | Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs. | Bernhard Bliem |
| 2017 | IJCAI | The Impact of Treewidth on ASP Grounding and Solving. | Bernhard Bliem, Marius Moldovan, Michael Morak, Stefan Woltran |
| 2016 | AAAI | Subset Minimization in Dynamic Programming on Tree Decompositions. | Bernhard Bliem, Gnther Charwat, Markus Hecher, Stefan Woltran |
| 2016 | COMMA | On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. | Bernhard Bliem, Markus Hecher, Stefan Woltran |
| 2016 | ECAI | Clique-Width and Directed Width Measures for Answer-Set Programming. | Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran |
| 2016 | IJCAI | Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels. | Bernhard Bliem, Robert Bredereck, Rolf Niedermeier |
| 2016 | IJCAI | ASP for Anytime Dynamic Programming on Tree Decompositions. | Bernhard Bliem, Benjamin Kaufmann, Torsten Schaub, Stefan Woltran |
| 2015 | WG | Complexity of Secure Sets. | Bernhard Bliem, Stefan Woltran |
| 2014 | JELIA | The D-FLAT System for Dynamic Programming on Tree Decompositions. | Michael Abseher, Bernhard Bliem, Gnther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran |