Matthias Lanzinger

60 papers A* 12A 2B 3C 1Journal 35Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Database Theory in Action: Evaluation of Aggregate Queries Without Materialisation. ICDT Matthias Lanzinger, Reinhard Pichler, Alexander Selzer
2026	C	`conf`	Selective Use of Yannakakis' Algorithm for Consistent Performance Gains. DOLAP Daniela Böhm, Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer
2025	J	`jnl`	A Logical View of GNN-Style Computation and the Role of Activation Functions. CoRR Pablo Barceló, Floris Geerts, Matthias Lanzinger, Klara Pakhomenko, Jan Van den Bussche
2025	J	`jnl`	Avoiding Materialisation for Guarded Aggregate Queries. Proc. VLDB Endow. Matthias Lanzinger, Reinhard Pichler, Alexander Selzer
2025	J	`jnl`	Enabling Generalized Zero-Shot Vulnerability Classification. IEEE Trans. Dependable Secur. Comput. Jinghao Hu, Jinsong Guo, Chen Luo, Yang Hu, Matthias Lanzinger, Zhanshan Li
2025	J	`jnl`	FPT Parameterisations of Fractional and Generalised Hypertree Width. CoRR Matthias Lanzinger, Igor Razgon, Daniel Unterberger
2025	J	`jnl`	From Alternation to FPRAS: Toward a Complexity Classification of Approximate Counting. CoRR Markus Hecher, Matthias Lanzinger
2025	A*	`conf`	Homomorphism Counts as Structural Encodings for Graph Learning. ICLR Linus Bao, Emily Jin, Michael M. Bronstein, Ismail Ilkan Ceylan, Matthias Lanzinger
2025	J	`jnl`	Message Passing on the Edge: Towards Scalable and Expressive GNNs. CoRR Pablo Barceló, Fabian Jogl, Alexander Kozachinskiy, Matthias Lanzinger, Stefan Neumann, Cristóbal Rojas
2025	J	`jnl`	Selective Use of Yannakakis' Algorithm to Improve Query Performance: Machine Learning to the Rescue. CoRR Daniela Böhm, Georg Gottlob, Matthias Lanzinger, Davide M. Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer
2025	J	`jnl`	Soft and Constrained Hypertree Width. Proc. ACM Manag. Data Matthias Lanzinger, Cem Okulmus, Reinhard Pichler, Alexander Selzer, Georg Gottlob
2024	—	`conf`	Avoiding Materialisation for Guarded Aggregate Queries. AMW Matthias Lanzinger, Reinhard Pichler, Alexander Selzer
2024	J	`jnl`	Avoiding Materialisation for Guarded Aggregate Queries. CoRR Matthias Lanzinger, Reinhard Pichler, Alexander Selzer
2024	A	`conf`	FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. STACS Matthias Lanzinger, Igor Razgon
2024	J	`jnl`	Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. ACM Trans. Database Syst. Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler
2024	J	`jnl`	Fuzzy Datalog CoRR Matthias Lanzinger, Stefano Sferrazza, Przemyslaw Andrzej Walega, Georg Gottlob
2024	B	`conf`	Fuzzy Datalog∃ over Arbitrary t-Norms. LPAR Matthias Lanzinger, Stefano Sferrazza, Przemyslaw Andrzej Walega, Georg Gottlob
2024	J	`jnl`	Homomorphism Counts as Structural Encodings for Graph Learning. CoRR Linus Bao, Emily Jin, Michael M. Bronstein, Ismail Ilkan Ceylan, Matthias Lanzinger
2024	A*	`conf`	Homomorphism Counts for Graph Neural Networks: All About That Basis. ICML Emily Jin, Michael M. Bronstein, Ismail Ilkan Ceylan, Matthias Lanzinger
2024	J	`jnl`	Homomorphism Counts for Graph Neural Networks: All About That Basis. CoRR Emily Jin, Michael M. Bronstein, Ismail Ilkan Ceylan, Matthias Lanzinger
2024	A*	`conf`	On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters. ICLR Matthias Lanzinger, Pablo Barceló
2024	—	`ed.`	Proceedings 5th International Workshop on the Resurgence of Datalog in Academia and Industry (Datalog-2.0 2024) co-located with the 17th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2024), Dallas, Texas, USA, October 11, 2024. Datalog Mario Alviano, Matthias Lanzinger
2024	J	`jnl`	Soft and Constrained Hypertree Width. CoRR Matthias Lanzinger, Cem Okulmus, Reinhard Pichler, Alexander Selzer, Georg Gottlob
2023	J	`jnl`	FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. CoRR Matthias Lanzinger, Igor Razgon
2023	J	`jnl`	Fractional covers of hypergraphs with bounded multi-intersection. Theor. Comput. Sci. Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
2023	A*	`conf`	Generative Datalog with Stable Negation. PODS Mario Alviano, Matthias Lanzinger, Michael Morak, Andreas Pieris
2023	A*	`conf`	MV-Datalog+/-: Effective Rule-based Reasoning with Uncertain Observations (Extended Abstract). IJCAI Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob
2023	J	`jnl`	On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters. CoRR Matthias Lanzinger, Pablo Barceló
2023	—	`conf`	Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization (short paper). AMW Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer
2023	J	`jnl`	Structure-Guided Query Evaluation: Towards Bridging the Gap from Theory to Practice. CoRR Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer
2023	A*	`conf`	Temporal Datalog with Existential Quantification. IJCAI Matthias Lanzinger, Markus Nissl, Emanuel Sallinger, Przemyslaw Andrzej Walega
2023	A*	`conf`	The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. STOC Marco Bressan, Matthias Lanzinger, Marc Roth
2023	J	`jnl`	Tractability beyond Theor. Comput. Sci. Matthias Lanzinger
2022	—	`conf`	Datalog with Existential Quantifiers and Temporal Operators (Extended Abstract). Datalog Matthias Lanzinger, Przemyslaw Andrzej Walega
2022	—	`conf`	Family Link Detection in Uncertain Settings with MV-Datalog±. EDBT/ICDT Workshops Marta Bernardini, Matthias Lanzinger, Rosario Laurendi, Stefano Sferrazza
2022	A*	`conf`	Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. PODS Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler
2022	J	`jnl`	Generative Datalog with Stable Negation. CoRR Mario Alviano, Matthias Lanzinger, Michael Morak, Andreas Pieris
2022	J	`jnl`	Incremental Updates of Generalized Hypertree Decompositions. CoRR Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus
2022	J	`jnl`	Incremental Updates of Generalized Hypertree Decompositions. ACM J. Exp. Algorithmics Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus
2022	J	`jnl`	MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations. CoRR Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob
2022	J	`jnl`	MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations. Theory Pract. Log. Program. Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob
2022	—	`conf`	New Perspectives for Fuzzy Datalog (Extended Abstract). Datalog Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob
2022	A*	`conf`	On the Complexity of Inductively Learning Guarded Clauses. AAAI Andrei Draghici, Georg Gottlob, Matthias Lanzinger
2022	A*	`conf`	The Complexity of Conjunctive Queries with Degree 2. PODS Matthias Lanzinger
2022	J	`jnl`	The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. CoRR Marco Bressan, Matthias Lanzinger, Marc Roth
2021	J	`jnl`	Complexity Analysis of Generalized and Fractional Hypertree Decompositions. J. ACM Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
2021	J	`jnl`	Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. CoRR Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler
2021	J	`jnl`	Forbidden Substructures for Tractable Conjunctive Query Answering with Degree 2. CoRR Matthias Lanzinger
2021	J	`jnl`	On the Complexity of Inductively Learning Guarded Rules. CoRR Andrei Draghici, Georg Gottlob, Matthias Lanzinger
2021	A*	`conf`	Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation. PODS Matthias Lanzinger
2020	J	`jnl`	Complexity Analysis of General and Fractional Hypertree Decompositions. CoRR Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
2020	B	`conf`	Fractional Covers of Hypergraphs with Bounded Multi-Intersection. MFCS Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
2020	J	`jnl`	Fractional Covers of Hypergraphs with Bounded Multi-Intersection. CoRR Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
2020	A*	`conf`	Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. IJCAI Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler
2020	J	`jnl`	Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. CoRR Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler
2020	B	`conf`	The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. CPAIOR Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler
2020	J	`jnl`	The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. CoRR Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler
2020	J	`jnl`	Tractability Beyond β-Acyclicity for Conjunctive Queries with Negation. CoRR Matthias Lanzinger
2019	—	`conf`	Semantic Width Revisited (Extended Abstract). AMW Georg Gottlob, Matthias Lanzinger, Reinhard Pichler
2018	J	`jnl`	Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems. CoRR Georg Gottlob, Matthias Lanzinger, Reinhard Pichler