| | Preview | Author(s) | Title | Type | Issue Date |
| 21 | | Fichte, Johannes K. ; Hecher, Markus ; Pfandler, Andreas | Lower Bounds for QBFs of Bounded Treewidth | Konferenzbeitrag Inproceedings | 2020 |
| 22 | | Hecher, Markus | Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? | Konferenzbeitrag Inproceedings | 2020 |
| 23 | | Maly, Jan | Lifting Preferences over Alternatives to Preferences over Sets of Alternatives: The Complexity of Recognizing Desirable Families of Sets | Konferenzbeitrag Inproceedings | 2020 |
| 24 | | Bernreiter, Michael ; Maly, Jan ; Woltran, Stefan | Encoding Choice Logics in ASP | Konferenzbeitrag Inproceedings | 2020 |
| 25 | | Hecher, Markus ; Morak, Michael ; Woltran, Stefan | Structural Decompositions of Epistemic Logic Programs | Konferenzbeitrag Inproceedings | 2020 |
| 26 | | Dvořák, Wolfgang ; Woltran, Stefan | Complexity of abstract argumentation under a claim-centric view | Artikel Article | 2020 |
| 27 | | Woltran, Stefan | Computational Argumentation - Formal Models and Complexity Results | Konferenzbeitrag Inproceedings | 2020 |
| 28 | | Fandinno, Jorge ; Hecher, Markus | Treewidth-Aware Complexity in ASP:Not all Positive Cycles are Equally Hard | Konferenzbeitrag Inproceedings | 2020 |
| 29 | | Everardo, Flavio ; Hecher, Markus ; Shukla, Ankit | An Approximate Model Counter for ASP | Konferenzbeitrag Inproceedings | 2020 |
| 30 | | Hecher, Markus | Treewidth-Aware Reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? | Präsentation Presentation | 2020 |
| 31 | | Everardo, Flavio ; Hecher, Markus ; Shukla, Ankit | Extending XORRO with Approximate Model Counting | Präsentation Presentation | 2020 |
| 32 | | Hecher, Markus ; Thier, Patrick ; Woltran, Stefan | Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology | Präsentation Presentation | 2020 |
| 33 | | Gaggl, Sarah A. ; Linsbichler, Thomas ; Maratea, Marco ; Woltran, Stefan | Design and results of the Second International Competition on Computational Models of Argumentation | Artikel Article | 2020 |
| 34 | | Fichte, Johannes ; Hecher, Markus | Counting with Bounded Treewidth: Meta Algorithm and Runtime Guarantees | Konferenzbeitrag Inproceedings | 2020 |
| 35 | | Fichte, Johannes K. ; Hecher, Markus ; Szeider, Stefan | Breaking Symmetries with RootClique and LexTopSort | Konferenzbeitrag Inproceedings | 2020 |
| 36 | | Fichte, Johannes K. ; Hecher, Markus ; Szeider, Stefan | A Time Leap Challenge for SAT-Solving | Konferenzbeitrag Inproceedings | 2020 |
| 37 | | Fichte, Johannes K. ; Hecher, Markus ; Kieler, Maximilian F. I. | Treewidth-Aware Quantifier Elimination and Expansion for QCSP | Konferenzbeitrag Inproceedings | 2020 |
| 38 | | Fichte, Johannes K. ; Hecher, Markus ; Schidler, Andre | Solving the Steiner Tree Problem with few Terminals | Konferenzbeitrag Inproceedings | 2020 |
| 39 | | Hecher, Markus ; Morak, Michael ; Woltran, Stefan | Structural Decompositions of Epistemic Logic Programs | Konferenzbeitrag Inproceedings | 2020 |
| 40 | | FICHTE, JOHANNES K. ; HECHER, MARKUS ; THIER, PATRICK ; WOLTRAN, STEFAN | Exploiting Database Management Systems and Treewidth for Counting | Konferenzbeitrag Inproceedings | 2020 |