| | Preview | Author(s) | Title | Type | Issue Date |
| 1 | | Fischl, Wolfgang ; Gottlob, Georg ; Pichler, Reinhard | General and Fractional Hypertree Decompositions: Hard and Easy Cases | Konferenzbeitrag Inproceedings | 2018 |
| 2 | | Csar, Theresa ; Lackner, Martin ; Pichler, Reinhard | Computing the Schulze Method for Large-Scale Preference Data Sets | Konferenzbeitrag Inproceedings | 2018 |
| 3 | | Creignou, Nadia ; Pichler, Reinhard ; Woltran, Stefan | Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? | Artikel Article | 2018 |
| 4 | | Gottlob, Georg ; Pichler, Reinhard ; Sallinger, Emanuel | Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability | Konferenzbeitrag Inproceedings | 2017 |
| 5 | | Csar, Theresa ; Lackner, Martin ; Pichler, Reinhard ; Sallinger, Emanuel | Computational Social Choice in the Clouds | Konferenzbeitrag Inproceedings | 2017 |
| 6 | | Kröll, Markus ; Pichler, Reinhard ; Woltran, Stefan | On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks | Konferenzbeitrag Inproceedings | 2017 |
| 7 | | Creignou, Nadia ; Kröll, Markus ; Pichler, Reinhard ; Skritek, Sebastian ; Vollmer, Heribert | On the Complexity of Hard Enumeration Problems | Konferenzbeitrag Inproceedings | 2017 |
| 8 | | Bliem, Bernhard ; Pichler, Reinhard ; Woltran, Stefan | Implementing Courcelle's Theorem in a declarative framework for dynamic programming | Artikel Article | 2017 |
| 9 | | Csar, Theresa ; Lackner, Martin ; Pichler, Reinhard ; Sallinger, Emanuel | Winner Determination in Huge Elections with MapReduce. AAAI 2017: 451-458 | Konferenzbeitrag Inproceedings | 2017 |
| 10 | | Csar, Theresa ; Lackner, Martin ; Pichler, Reinhard ; Sallinger, Emanuel | Winner Determination in Huge Elections with MapReduce | Konferenzbeitrag Inproceedings | 2016 |
| 11 | | Pfandler, A. ; Pichler, R. ; Woltran, S. | The complexity of handling minimal solutions in logic-based abduction | Artikel Article | 2015 |
| 12 | | Kronegger, Martin ; Lackner, Martin ; Pfandler, Andreas ; Pichler, Reinhard | On the Parameterized Complexity of Generalized CP-Nets | Präsentation Presentation | 2014 |
| 13 | | Kronegger, Martin ; Lackner, Martin ; Pfandler, Andreas ; Pichler, Reinhard | A Parameterized Complexity Analysis of Generalized CP-Nets | Konferenzbeitrag Inproceedings | 2014 |
| 14 | | Kronegger, Martin ; Lackner, Martin ; Pfandler, Andreas ; Pichler, Reinhard | A Parameterized Complexity Analysis of Generalized CP-Nets | Konferenzbeitrag Inproceedings | 2014 |
| 15 | | Creignou, Nadia ; Pichler, Reinhard ; Woltran, Stefan | Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? | Konferenzbeitrag Inproceedings | 2013 |
| 16 | | Kronegger, Martin ; Pfandler, Andreas ; Pichler, Reinhard | Parameterized Complexity of Optimal Planning: A Detailed Map | Konferenzbeitrag Inproceedings | 2013 |
| 17 | | Kronegger, Martin ; Pfandler, Andreas ; Pichler, Reinhard | Conformant Planning as a Benchmark for QBF-Solvers | Konferenzbeitrag Inproceedings | 2013 |
| 18 | | Bliem, Bernhard ; Pichler, Reinhard ; Woltran, Stefan | Applicability of ASP-based Problem Solving on Tree Decompositions | Präsentation Presentation | 2013 |
| 19 | | Kronegger, Martin ; Lackner, Martin ; Pfandler, Andreas ; Pichler, Reinhard | A Parameterized Complexity Analysis of Generalized CP-Nets | Konferenzbeitrag Inproceedings | 2013 |