| | Preview | Author(s) | Title | Type | Issue Date |
| 21 | | Dvořák, Wolfgang ; König, Matthias ; Woltran, Stefan | Treewidth for Argumentation Frameworks with Collective Attacks | Inproceedings Konferenzbeitrag | 2022 |
| 22 | | König, Matthias ; Rapberger, Anna ; Ulbricht, Markus | Just a Matter of Perspective | Inproceedings Konferenzbeitrag | 2022 |
| 23 | | Dvořák, Wolfgang ; König, Matthias ; Woltran, Stefan | Graph-Classes of Argumentation Frameworks with Collective Attacks | Konferenzbeitrag Inproceedings | 2021 |
| 24 | | Fichte, Johannes K. ; Hecher, Markus ; Morak, Michael ; Woltran, Stefan | DynASP2.5: Dynamic Programming on Tree Decompositions in Action | Artikel Article | 2021 |
| 25 | | Dvorak, Wolfgang ; König, Matthias ; Ulbricht, Markus ; Woltran, Stefan | A Reduct-Driven Study of Argumentation Frameworks With Collective Attacks | Präsentation Presentation | 2021 |
| 26 | | Eiter, Thomas ; Hecher, Markus ; Kiesel, Rafael | Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting | Konferenzbeitrag Inproceedings | 2021 |
| 27 | | Dvořák, Wolfgang ; König, Matthias ; Woltran, Stefan | On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length | Konferenzbeitrag Inproceedings | 2021 |
| 28 | | Eiter, Thomas ; Hecher, Markus ; Kiesel, Rafael | Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting | Konferenzbeitrag Inproceedings | 2021 |
| 29 | | Hecher, Markus | Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? | Konferenzbeitrag Inproceedings | 2020 |
| 30 | | Hecher, Markus ; Morak, Michael ; Woltran, Stefan | Structural Decompositions of Epistemic Logic Programs | Konferenzbeitrag Inproceedings | 2020 |
| 31 | | Woltran, Stefan | Computational Argumentation - Formal Models and Complexity Results | Konferenzbeitrag Inproceedings | 2020 |
| 32 | | Hecher, Markus | Treewidth-Aware Reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? | Präsentation Presentation | 2020 |
| 33 | | Everardo, Flavio ; Hecher, Markus ; Shukla, Ankit | Extending XORRO with Approximate Model Counting | Präsentation Presentation | 2020 |
| 34 | | Hecher, Markus ; Thier, Patrick ; Woltran, Stefan | Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology | Präsentation Presentation | 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 | | FICHTE, JOHANNES K. ; HECHER, MARKUS ; THIER, PATRICK ; WOLTRAN, STEFAN | Exploiting Database Management Systems and Treewidth for Counting | Konferenzbeitrag Inproceedings | 2020 |
| 40 | | Bliem, Bernhard ; Morak, Michael ; Moldovan, Marius ; Woltran, Stefan | The Impact of Treewidth on Grounding and Solving of Answer Set Programs | Artikel Article | 2020 |