|
| | Preview | Author(s) | Title | Type | Issue Date |
| 1 | | Abseher, Michael ; Bliem, Bernhard ; Charwat, Günther ; Dusberger, Frederico ; Woltran, Stefan | Computing Secure Sets in Graphs using Answer Set Programming | Artikel Article  | Jun-2020 |
| 2 | | Bliem, Bernhard ; Morak, Michael ; Moldovan, Marius ; Woltran, Stefan | The Impact of Treewidth on Grounding and Solving of Answer Set Programs | Artikel Article | 2020 |
| 3 | | Bliem, Bernhard ; Woltran, Stefan | Defensive alliances in graphs of bounded treewidth | Artikel Article | 31-Dec-2018 |
| 4 | | Bliem, Bernhard ; Woltran, Stefan | Complexity of Secure Sets | Artikel Article | 2018 |
| 5 | | Bliem, Bernhard | ASP Programs with Groundings of Small Treewidth | Konferenzbeitrag Inproceedings | 2018 |
| 6 | | Bliem, Bernhard ; Woltran, Stefan | Equivalence between answer-set programs under (partially) fixed input | Artikel Article | 2018 |
| 7 | | Abseher, Michael ; Hecher, Markus ; Moldovan, Marius ; Woltran, Stefan ; Bliem, Bernhard | Dynamic Programming on Tree Decompositions with {D-FLAT} | Artikel Article | 2018 |
| 8 | | Bliem, Bernhard ; Moldovan, Marius ; Morak, Michael ; Woltran, Stefan | The Impact of Treewidth on ASP Grounding and Solving | Konferenzbeitrag Inproceedings | 2017 |
| 9 | | Moldovan, Marius ; Bliem, Bernhard ; Morak, Michael ; Woltran, Stefan ; Bliem, Bernhard | The Impact of Treewidth on {ASP} Grounding and Solving | Konferenzbeitrag Inproceedings | 2017 |
| 10 | | Bichler, Manuel ; Bliem, Bernhard ; Moldovan, Marius ; Morak, Michael ; Woltran, Stefan | Treewidth-Preserving Modeling in ASP | Bericht Report | 2016 |
| 11 | | Bliem, Bernhard ; Woltran, Stefan | Equivalence Between Answer-Set Programs Under (Partially) Fixed Input | Konferenzbeitrag Inproceedings | 2016 |
| 12 | | Bliem, Bernhard ; Bredereck, Robert ; Niedermeier, Rolf | Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels | Konferenzbeitrag Inproceedings | 2016 |
| 13 | | Bliem, Bernhard ; Kaufmann, Benjamin ; Schaub, Torsten ; Woltran, Stefan | ASP for Anytime Dynamic Programming on Tree Decompositions | Konferenzbeitrag Inproceedings | 2016 |
| 14 | | Bliem, Bernhard ; Hecher, Markus ; Woltran, Stefan | On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions | Konferenzbeitrag Inproceedings | 2016 |
| 15 | | Bliem, Bernhard ; Woltran, Stefan | Complexity of Secure Sets | Konferenzbeitrag Inproceedings | 2016 |
| 16 | | Bliem, Bernhard ; Charwat, Günther ; Hecher, Markus ; Woltran, Stefan | Subset Minimization in Dynamic Programming on Tree Decompositions | Konferenzbeitrag Inproceedings | 2016 |
| 17 | | Bliem, Bernhard ; Charwat, Günther ; Hecher, Markus ; Woltran, Stefan | D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy | Artikel Article | 2016 |
| 18 | | Bliem, Bernhard ; Ordyniak, Sebastian ; Woltran, Stefan | Clique-Width and Directed Width Measures for Answer-Set Programming | Konferenzbeitrag Inproceedings | 2016 |
| 19 | | Bliem, Bernhard ; Ordyniak, Sebastian ; Woltran, Stefan | Clique-Width and Directed Width Measures for Answer-Set Programming | Konferenzbeitrag Inproceedings | 2016 |
| 20 | | Bliem, Bernhard ; Kaufmann, Benjamin ; Schaub, Torsten ; Woltran, Stefan | ASP for Anytime Dynamic Programming on Tree Decompositions (Extended Abstract) | Konferenzbeitrag Inproceedings | 2016 |
