Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems. - Georg Gottlob; Matthias Lanzinger; Reinhard Pichler (CoRR, 2018)

Semantic Width Revisited (Extended Abstract). - Georg Gottlob; Matthias Lanzinger; Reinhard Pichler (AMW, 2019)

The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. - Georg Gottlob; Matthias Lanzinger; Davide Mario Longo; Cem Okulmus; Reinhard Pichler (CPAIOR, 2020)

Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. - Hubie Chen; Georg Gottlob; Matthias Lanzinger; Reinhard Pichler (IJCAI, 2020)

Complexity Analysis of General and Fractional Hypertree Decompositions. - Georg Gottlob; Matthias Lanzinger; Reinhard Pichler; Igor Razgon (CoRR, 2020)

Tractability Beyond β-Acyclicity for Conjunctive Queries with Negation. - Matthias Lanzinger (CoRR, 2020)

Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation. - Matthias Lanzinger (PODS, 2021)

On the Complexity of Inductively Learning Guarded Rules. - Andrei Draghici; Georg Gottlob; Matthias Lanzinger (CoRR, 2021)

Forbidden Substructures for Tractable Conjunctive Query Answering with Degree 2. - Matthias Lanzinger (CoRR, 2021)

Complexity Analysis of Generalized and Fractional Hypertree Decompositions. - Georg Gottlob; Matthias Lanzinger; Reinhard Pichler; Igor Razgon (J. ACM, 2021)

On the Complexity of Inductively Learning Guarded Clauses. - Andrei Draghici; Georg Gottlob; Matthias Lanzinger (AAAI, 2022)

New Perspectives for Fuzzy Datalog (Extended Abstract). - Matthias Lanzinger; Stefano Sferrazza; Georg Gottlob (Datalog, 2022)

Datalog with Existential Quantifiers and Temporal Operators (Extended Abstract). - Matthias Lanzinger; Przemyslaw Andrzej Walega (Datalog, 2022)

Family Link Detection in Uncertain Settings with MV-Datalog±. - Marta Bernardini; Matthias Lanzinger; Rosario Laurendi; Stefano Sferrazza (EDBT/ICDT Workshops, 2022)

The Complexity of Conjunctive Queries with Degree 2. - Matthias Lanzinger (PODS, 2022)

MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations. - Matthias Lanzinger; Stefano Sferrazza; Georg Gottlob (Theory Pract. Log. Program., 2022)

Incremental Updates of Generalized Hypertree Decompositions. - Georg Gottlob; Matthias Lanzinger; Davide Mario Longo; Cem Okulmus (ACM J. Exp. Algorithmics, 2022)

Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization (short paper). - Georg Gottlob; Matthias Lanzinger; Davide Mario Longo; Cem Okulmus; Reinhard Pichler; Alexander Selzer (AMW, 2023)

Temporal Datalog with Existential Quantification. - Matthias Lanzinger; Markus Nissl; Emanuel Sallinger; Przemyslaw Andrzej Walega (IJCAI, 2023)

MV-Datalog+/-: Effective Rule-based Reasoning with Uncertain Observations (Extended Abstract). - Matthias Lanzinger; Stefano Sferrazza; Georg Gottlob (IJCAI, 2023)

Generative Datalog with Stable Negation. - Mario Alviano; Matthias Lanzinger; Michael Morak; Andreas Pieris (PODS, 2023)

The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. - Marco Bressan 002; Matthias Lanzinger; Marc Roth (STOC, 2023)

Structure-Guided Query Evaluation: Towards Bridging the Gap from Theory to Practice. - Georg Gottlob; Matthias Lanzinger; Davide Mario Longo; Cem Okulmus; Reinhard Pichler; Alexander Selzer (CoRR, 2023)

Tractability beyond β-acyclicity for conjunctive queries with negation and SAT. - Matthias Lanzinger (Theor. Comput. Sci., 2023)

Fractional covers of hypergraphs with bounded multi-intersection. - Georg Gottlob; Matthias Lanzinger; Reinhard Pichler; Igor Razgon (Theor. Comput. Sci., 2023)

On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters. - Matthias Lanzinger; Pablo Barceló (ICLR, 2024)

Homomorphism Counts for Graph Neural Networks: All About That Basis. - Emily Jin; Michael M. Bronstein; Ismail Ilkan Ceylan; Matthias Lanzinger (ICML, 2024)

Fuzzy Datalog∃ over Arbitrary t-Norms. - Matthias Lanzinger; Stefano Sferrazza; Przemyslaw Andrzej Walega; Georg Gottlob (LPAR, 2024)

FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. - Matthias Lanzinger; Igor Razgon (STACS, 2024)

Fuzzy Datalog∃ over Arbitrary t-Norms. - Matthias Lanzinger; Stefano Sferrazza; Przemyslaw Andrzej Walega; Georg Gottlob (CoRR, 2024)

Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. - Georg Gottlob; Matthias Lanzinger; Cem Okulmus; Reinhard Pichler (ACM Trans. Database Syst., 2024)

Homomorphism Counts as Structural Encodings for Graph Learning. - Linus Bao; Emily Jin; Michael M. Bronstein; Ismail Ilkan Ceylan; Matthias Lanzinger (ICLR, 2025)

Enabling Generalized Zero-Shot Vulnerability Classification. - Jinghao Hu; Jinsong Guo; Chen Luo 003; Yang Hu; Matthias Lanzinger; Zhanshan Li (IEEE Trans. Dependable Secur. Comput., 2025)

Avoiding Materialisation for Guarded Aggregate Queries. - Matthias Lanzinger; Reinhard Pichler; Alexander Selzer (Proc. VLDB Endow., 2025)

Selective Use of Yannakakis' Algorithm to Improve Query Performance: Machine Learning to the Rescue. - Daniela Böhm; Georg Gottlob; Matthias Lanzinger; Davide M. Longo; Cem Okulmus; Reinhard Pichler; Alexander Selzer (CoRR, 2025)

Soft and Constrained Hypertree Width. - Matthias Lanzinger; Cem Okulmus; Reinhard Pichler; Alexander Selzer; Georg Gottlob (Proc. ACM Manag. Data, 2025)

FPT Parameterisations of Fractional and Generalised Hypertree Width. - Matthias Lanzinger; Igor Razgon; Daniel Unterberger (CoRR, 2025)