Complexity Analysis of Generalized and Fractional Hypertree Decompositions G Gottlob, M Lanzinger, R Pichler, I Razgon Journal of the ACM (JACM), 2020 | 19* | 2020 |
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 | 12 | 2020 |
Tractability beyond β-acyclicity for conjunctive queries with negation and sat M Lanzinger Theoretical Computer Science 942, 276-296, 2023 | 9* | 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 | 6 | 2020 |
Fractional covers of hypergraphs with bounded multi-intersection G Gottlob, M Lanzinger, R Pichler, I Razgon Theoretical Computer Science 979, 114204, 2023 | 5 | 2023 |
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 | 5 | 2023 |
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 | 4 | 2023 |
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 | 3 | 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 | 3 | 2024 |
On the power of the Weisfeiler-Leman test for graph motif parameters M Lanzinger, P Barceló arXiv preprint arXiv:2309.17053, 2023 | 3 | 2023 |
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 | 3 | 2023 |
New perspectives for fuzzy datalog M Lanzinger, S Sferrazza, G Gottlob Datalog, 42-47, 2022 | 3 | 2022 |
Incremental updates of generalized hypertree decompositions G Gottlob, M Lanzinger, DM Longo, C Okulmus ACM Journal of Experimental Algorithmics 27 (1), 1-28, 2023 | 2 | 2023 |
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 | 2 | 2022 |
Semantic Width Revisited G Gottlob, M Lanzinger, R Pichler AMW 2019, 2019 | 2 | 2019 |
FPT approximation of generalised hypertree width for bounded intersection hypergraphs M Lanzinger, I Razgon arXiv preprint arXiv:2309.17049, 2023 | 1 | 2023 |
Temporal datalog with existential quantification M Lanzinger, N Markus, S Emanuel, PA Walega IJCAI, 2023 | 1 | 2023 |
Datalog with Existential Quantifiers and Temporal Operators M Lanzinger, PA Walega Datalog, 139-144, 2022 | 1 | 2022 |
Hypergraph invariants for computational complexity MP Lanzinger Technische Universität Wien, 2020 | 1 | 2020 |