Follow
Matthias Lanzinger
Matthias Lanzinger
Assistant Professor, TU Wien
Verified email at tuwien.ac.at - Homepage
Title
Cited by
Cited by
Year
Complexity Analysis of Generalized and Fractional Hypertree Decompositions
G Gottlob, M Lanzinger, R Pichler, I Razgon
arXiv preprint arXiv:2002.05239, 2020
132020
Semantic width and the fixed-parameter tractability of constraint satisfaction problems
H Chen, G Gottlob, M Lanzinger, R Pichler
arXiv preprint arXiv:2007.14169, 2020
122020
Tractability beyond β-acyclicity for conjunctive queries with negation and SAT
M Lanzinger
Theoretical Computer Science 942, 276-296, 2023
6*2023
The hypertrac project: Recent progress and future research directions on hypergraph decompositions
G Gottlob, M Lanzinger, DM Longo, C Okulmus, R Pichler
International Conference on Integration of Constraint Programming …, 2020
52020
Fractional covers of hypergraphs with bounded multi-intersection
G Gottlob, M Lanzinger, R Pichler, I Razgon
Theoretical Computer Science 979, 114204, 2023
42023
The Complexity of Conjunctive Queries with Degree 2.
M Lanzinger
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022
4*2022
Fast parallel hypertree decompositions in logarithmic recursion depth
G Gottlob, M Lanzinger, C Okulmus, R Pichler
ACM Transactions on Database Systems 49 (1), 1-43, 2024
22024
On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters
M Lanzinger, P Barceló
arXiv preprint arXiv:2309.17053, 2023
22023
Generative datalog with stable negation
M Alviano, M Lanzinger, M Morak, A Pieris
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2023
22023
Mv-datalog+-: Effective rule-based reasoning with uncertain observations
M Lanzinger, S Sferrazza, G Gottlob
Theory and Practice of Logic Programming 22 (5), 678-692, 2022
22022
New perspectives for fuzzy datalog
M Lanzinger, S Sferrazza, G Gottlob
Datalog, 42-47, 2022
22022
Complexity analysis of general and fractional hypertree decompositions
G Gottlob, M Lanzinger, R Pichler, I Razgon
22020
Semantic Width Revisited
G Gottlob, M Lanzinger, R Pichler
AMW 2019, 2019
22019
The complexity of pattern counting in directed graphs, parameterised by the outdegree
M Bressan, M Lanzinger, M Roth
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 542-552, 2023
12023
Structure-Guided Query Evaluation: Towards Bridging the Gap from Theory to Practice
G Gottlob, M Lanzinger, DM Longo, C Okulmus, R Pichler, A Selzer
arXiv preprint arXiv:2303.02723, 2023
12023
Hypergraph invariants for computational complexity
MP Lanzinger
Technische Universität Wien, 2020
12020
Fuzzy Datalog over Arbitrary t-Norms
M Lanzinger, S Sferrazza, PA Wałęga, G Gottlob
arXiv preprint arXiv:2403.02933, 2024
2024
Homomorphism Counts for Graph Neural Networks: All About That Basis
E Jin, M Bronstein, II Ceylan, M Lanzinger
arXiv preprint arXiv:2402.08595, 2024
2024
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
M Lanzinger, I Razgon
arXiv preprint arXiv:2309.17049, 2023
2023
Incremental updates of generalized hypertree decompositions
G Gottlob, M Lanzinger, DM Longo, C Okulmus
ACM Journal of Experimental Algorithmics 27 (1), 1-28, 2023
2023
The system can't perform the operation now. Try again later.
Articles 1–20