| 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 | Database Theory in Action: Evaluation of Aggregate Queries Without Materialisation. | Matthias Lanzinger, Reinhard Pichler, Alexander Selzer |
| 2026 | SIGMOD | Query Answering without Join Computation: An Interactive Exploration of Practical Techniques. | Matthias Lanzinger, Reinhard Pichler, Alexander Selzer |
| 2025 | ICLR | Homomorphism Counts as Structural Encodings for Graph Learning. | Linus Bao, Emily Jin, Michael M. Bronstein, Ismail Ilkan Ceylan, Matthias Lanzinger |
| 2024 | ICLR | On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters. | Matthias Lanzinger, Pablo Barcel |
| 2024 | ICML | Homomorphism Counts for Graph Neural Networks: All About That Basis. | Emily Jin, Michael M. Bronstein, Ismail Ilkan Ceylan, Matthias Lanzinger |
| 2024 | LPAR | Fuzzy Datalog∃ over Arbitrary t-Norms. | Matthias Lanzinger, Stefano Sferrazza, Przemyslaw Andrzej Walega, Georg Gottlob |
| 2024 | STACS | FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. | Matthias Lanzinger, Igor Razgon |
| 2023 | IJCAI | Temporal Datalog with Existential Quantification. | Matthias Lanzinger, Markus Nissl, Emanuel Sallinger, Przemyslaw Andrzej Walega |
| 2023 | IJCAI | MV-Datalog+/-: Effective Rule-based Reasoning with Uncertain Observations (Extended Abstract). | Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob |
| 2023 | PODS | Generative Datalog with Stable Negation. | Mario Alviano, Matthias Lanzinger, Michael Morak, Andreas Pieris |
| 2023 | STOC | The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. | Marco Bressan, Matthias Lanzinger, Marc Roth |
| 2022 | AAAI | On the Complexity of Inductively Learning Guarded Clauses. | Andrei Draghici, Georg Gottlob, Matthias Lanzinger |
| 2022 | EDBT | Family Link Detection in Uncertain Settings with MV-Datalog±. | Marta Bernardini, Matthias Lanzinger, Rosario Laurendi, Stefano Sferrazza |
| 2022 | PODS | Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. | Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler |
| 2022 | PODS | The Complexity of Conjunctive Queries with Degree 2. | Matthias Lanzinger |
| 2021 | PODS | Tractability Beyond -Acyclicity for Conjunctive Queries with Negation. | Matthias Lanzinger |
| 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 | MFCS | Fractional Covers of Hypergraphs with Bounded Multi-Intersection. | Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon |