| 2026 | DOLAP | Selective Use of Yannakakis' Algorithm for Consistent Performance Gains. | Daniela Bhm, Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer |
| 2026 | ICDT | Query Decompositions and All That (Invited Talk). | Kyle Deeds, Timo Camillo Merkl, Reinhard Pichler, Dan Suciu |
| 2026 | ICDT | Database Theory in Action: Evaluation of Aggregate Queries Without Materialisation. | Matthias Lanzinger, Reinhard Pichler, Alexander Selzer |
| 2026 | PODS | Enumeration Theory through the Lens of Database Challenges. | Florent Capelli, Nofar Carmeli, Alessio Conte, Benny Kimelfeld, Reinhard Pichler, Nikolaos Tziavelis |
| 2026 | SIGMOD | Query Answering without Join Computation: An Interactive Exploration of Practical Techniques. | Matthias Lanzinger, Reinhard Pichler, Alexander Selzer |
| 2024 | KR | Consistent Query Answering over SHACL Constraints. | Shqiponja Ahmetaj, Timo Camillo Merkl, Reinhard Pichler |
| 2023 | EDBT | Integration of Skyline Queries into Spark SQL. | Lukas Grasmann, Reinhard Pichler, Alexander Selzer |
| 2023 | ICDT | Diversity of Answers to Conjunctive Queries. | Timo Camillo Merkl, Reinhard Pichler, Sebastian Skritek |
| 2022 | PODS | Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. | Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler |
| 2022 | PODS | Convergence of Datalog over (Pre-) Semirings. | Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu, Yisu Remy Wang |
| 2022 | SIGMOD | Optimizing Recursive Queries with Progam Synthesis. | Yisu Remy Wang, Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu |
| 2020 | CPAIOR | The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. | Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler |
| 2020 | IJCAI | Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. | Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler |
| 2020 | IJCAI | Fast and Parallel Decomposition of Constraint Satisfaction Problems. | Georg Gottlob, Cem Okulmus, Reinhard Pichler |
| 2020 | MFCS | Fractional Covers of Hypergraphs with Bounded Multi-Intersection. | Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon |
| 2019 | ICDT | Datalog: Bag Semantics via Set Semantics. | Leopoldo E. Bertossi, Georg Gottlob, Reinhard Pichler |
| 2019 | PODS | HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings. | Wolfgang Fischl, Georg Gottlob, Davide Mario Longo, Reinhard Pichler |
| 2018 | IJCAI | Computing the Schulze Method for Large-Scale Preference Data Sets. | Theresa Csar, Martin Lackner, Reinhard Pichler |
| 2018 | PODS | General and Fractional Hypertree Decompositions: Hard and Easy Cases. | Wolfgang Fischl, Georg Gottlob, Reinhard Pichler |
| 2017 | AAAI | Winner Determination in Huge Elections with MapReduce. | Theresa Csar, Martin Lackner, Reinhard Pichler, Emanuel Sallinger |
| 2017 | BTW | Computational Social Choice in the Clouds. | Theresa Csar, Martin Lackner, Reinhard Pichler, Emanuel Sallinger |
| 2017 | IJCAI | On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks. | Markus Krll, Reinhard Pichler, Stefan Woltran |
| 2017 | LATA | On the Complexity of Hard Enumeration Problems. | Nadia Creignou, Markus Krll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer |
| 2016 | ICDT | Complexity of Repair Checking and Consistent Query Answering. | Sebastian Arming, Reinhard Pichler, Emanuel Sallinger |
| 2016 | ICDT | Limits of Schema Mappings. | Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov |
| 2016 | ICDT | On the Complexity of Enumerating the Answers to Well-designed Pattern Trees. | Markus Krll, Reinhard Pichler, Sebastian Skritek |
| 2015 | PODS | Efficient Evaluation and Approximation of Well-designed Pattern Trees. | Pablo Barcel, Reinhard Pichler, Sebastian Skritek |
| 2015 | PODS | Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability. | Georg Gottlob, Reinhard Pichler, Emanuel Sallinger |
| 2015 | WWW | Towards Reconciling SPARQL and Certain Answers. | Shqiponja Ahmetaj, Wolfgang Fischl, Reinhard Pichler, Mantas Simkus, Sebastian Skritek |
| 2014 | AAAI | Capturing Relational Schemas and Functional Dependencies in RDFS. | Diego Calvanese, Wolfgang Fischl, Reinhard Pichler, Emanuel Sallinger, Mantas Simkus |
| 2014 | AAAI | A Parameterized Complexity Analysis of Generalized CP-Nets. | Martin Kronegger, Martin Lackner, Andreas Pfandler, Reinhard Pichler |
| 2014 | IPMU | A Fuzzy Extension of Data Exchange. | Jess Medina, Reinhard Pichler |
| 2014 | PODS | Nested dependencies: structure and reasoning. | Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov |
| 2014 | PODS | Containment and equivalence of well-designed SPARQL. | Reinhard Pichler, Sebastian Skritek |
| 2013 | IJCAI | Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? | Nadia Creignou, Reinhard Pichler, Stefan Woltran |
| 2013 | IJCAI | Parameterized Complexity of Optimal Planning: A Detailed Map. | Martin Kronegger, Andreas Pfandler, Reinhard Pichler |
| 2012 | COCOA | Multicut on Graphs of Bounded Clique-Width. | Martin Lackner, Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2012 | KR | Belief Revision within Fragments of Propositional Logic. | Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran |
| 2012 | PODS | Static analysis and optimization of semantic web queries. | Andrs Letelier, Jorge Prez, Reinhard Pichler, Sebastian Skritek |
| 2011 | ICDT | The complexity of evaluating tuple generating dependencies. | Reinhard Pichler, Sebastian Skritek |
| 2011 | ICDT | Relaxed notions of schema mapping equivalence revisited. | Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov |
| 2011 | ICTAI | A New Tree-Decomposition Based Algorithm for Answer Set Programming. | Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2010 | CIAC | Multicut Algorithms via Tree Decompositions. | Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2010 | ECAI | The Complexity of Handling Minimal Solutions in Logic-Based Abduction. | Reinhard Pichler, Stefan Woltran |
| 2010 | JELIA | A Dynamic-Programming Based ASP-Solver. | Michael Morak, Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2010 | KR | Towards Fixed-Parameter Tractable Algorithms for Argumentation. | Wolfgang Dvork, Reinhard Pichler, Stefan Woltran |
| 2010 | KR | Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. | Reinhard Pichler, Stefan Rmmele, Stefan Szeider, Stefan Woltran |
| 2010 | LPAR | Counting and Enumeration Problems with Bounded Treewidth. | Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2009 | IJCAI | Answer-Set Programming with Bounded Treewidth. | Michael Jakl, Reinhard Pichler, Stefan Woltran |
| 2009 | ICWE | On Using Distributed Extended XQuery for Web Data Sources as Services. | Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar |
| 2009 | LPNMR | Belief Revision with Bounded Treewidth. | Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2009 | PPDP | Alternation as a programming paradigm. | Wolfgang Dvork, Georg Gottlob, Reinhard Pichler, Stefan Woltran |
| 2008 | AAAI | Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation. | Georg Gottlob, Reinhard Pichler, Fang Wei |
| 2008 | COCOON | Complexity of Counting the Optimal Solutions. | Miki Hermann, Reinhard Pichler |
| 2008 | JELIA | Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. | Miki Hermann, Reinhard Pichler |
| 2008 | LPAR | Fast Counting with Bounded Treewidth. | Michael Jakl, Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2008 | LPAR | Towards Practical Feasibility of Core Computation in Data Exchange. | Reinhard Pichler, Vadim Savenkov |
| 2007 | AAAI | Efficient Datalog Abduction through Bounded Treewidth. | Georg Gottlob, Reinhard Pichler, Fang Wei |
| 2007 | IJCAI | Counting Complexity of Propositional Abduction. | Miki Hermann, Reinhard Pichler |
| 2007 | LPNMR | Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. | Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran |
| 2007 | PODS | Monadic datalog over finite structures with bounded treewidth. | Georg Gottlob, Reinhard Pichler, Fang Wei |
| 2006 | AAAI | Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. | Georg Gottlob, Reinhard Pichler, Fang Wei |
| 2006 | JELIA | Model Representation over Finite and Infinite Signatures. | Christian G. Fermller, Reinhard Pichler |
| 2006 | PODS | Tractable database design through bounded treewidth. | Georg Gottlob, Reinhard Pichler, Fang Wei |
| 2005 | CADE | Model Representation via Contexts and Implicit Generalizations. | Christian G. Fermller, Reinhard Pichler |
| 2003 | ICDE | XPath Query Evaluation: Improving Time and Space Efficiency. | Georg Gottlob, Christoph Koch, Reinhard Pichler |
| 2003 | PODS | The complexity of XPath query evaluation. | Georg Gottlob, Christoph Koch, Reinhard Pichler |
| 2002 | CADE | Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. | Bernhard Gramlich, Reinhard Pichler |
| 2002 | VLDB | Efficient Algorithms for Processing XPath Queries. | Georg Gottlob, Christoph Koch, Reinhard Pichler |
| 2001 | ICALP | Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. | Georg Gottlob, Reinhard Pichler |
| 2000 | ICALP | Negation Elimination from Simple Equational Formulae. | Reinhard Pichler |
| 1999 | CADE | Solving Equational Problems Efficiently. | Reinhard Pichler |
| 1999 | LICS | Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. | Georg Gottlob, Reinhard Pichler |
| 1998 | CSL | On the Complexity of H-Subsumption. | Reinhard Pichler |
| 1998 | JELIA | Algorithms on Atomic Representations of Herbrand Models. | Reinhard Pichler |