2025W

• Bachelor Thesis / 184.691 / PR
• CAIML seminar / 192.138 / SE
• Database Theory / 181.140 / VU
• Database Theory / 192.175 / VU
• Doctoral & Master Students Seminar / 181.223 / SE
• Project in Computer Science 1 / 192.021 / PR
• Project in Computer Science 2 / 192.022 / PR
• Scientific Research and Writing / 193.052 / SE

2026S

• Knowledge Graphs / 192.116 / VU
• Project in Computer Science 1 / 192.021 / PR
• Project in Computer Science 2 / 192.022 / PR

• Decompose and Conquer: Fast Query Processing via Decomposition
  2023 – 2027 / Vienna Science and Technology Fund (WWTF)
  Publications: 191698 / 192942 / 192932 / 193572 / 193568 / 193083 / 195921 / 195923 / 197724 / 203905 / 210485 / 209324 / 209322 / 209312 / 210135 / 217250 / 217465 / 221007 / 221602 / 221241

2025

• Soft and Constrained Hypertree Width / Lanzinger, M., Okulmus, C., Pichler, R., Selzer, A., & Gottlob, G. (2025). Soft and Constrained Hypertree Width. Proceedings of the ACM on Management of Data (PACMMOD), 3(2), 1–25. https://doi.org/10.1145/3725251
  Project: DeConquer (2023–2027)
• Enabling Generalized Zero-Shot Vulnerability Classification / Hu, J., Guo, J., Luo, C., Hu, Y., Lanzinger, M., & Li, Z. (2025). Enabling Generalized Zero-Shot Vulnerability Classification. IEEE Transactions on Dependable and Secure Computing, 22(4), 3465–3482. https://doi.org/10.1109/TDSC.2025.3532487
• Avoiding Materialisation for Guarded Aggregate Queries / Lanzinger, M. P., Pichler, R., & Selzer, A. (2025). Avoiding Materialisation for Guarded Aggregate Queries. Proceedings of the VLDB Endowment, 18(5), 1398–1411. https://doi.org/10.14778/3718057.3718068
  Project: KnowledgeGraph (2020–2028)
• Homomorphism Counts as Structural Encodings for Graph Learning / Bao, L., Jin, E., Bronstein, M. M., Ceylan, I. I., & Lanzinger, M. P. (2025). Homomorphism Counts as Structural Encodings for Graph Learning. In The Thirteenth International Conference on Learning Representations : ICLR 2025 (pp. 1–29). http://hdl.handle.net/20.500.12708/217250
  Project: DeConquer (2023–2027)

2024

• Proceedings 5th International Workshop on the Resurgence of Datalog in Academia and Industry (Datalog-2.0 2024) / Alviano, M., & Lanzinger, M. P. (Eds.). (2024). Proceedings 5th International Workshop on the Resurgence of Datalog in Academia and Industry (Datalog-2.0 2024) (Vol. 3801). http://hdl.handle.net/20.500.12708/203907
• Fuzzy Datalog∃ over Arbitrary t-Norms / Lanzinger, M., Sferrazza, S., Wałęga, P., & Gottlob, G. (2024). Fuzzy Datalog∃ over Arbitrary t-Norms. In N. Bjørner, M. Heule, & A. Voronkov (Eds.), Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning (pp. 426–444). https://doi.org/10.29007/cngw
  Projects: DeConquer (2023–2027) / KnowledgeGraph (2020–2028) / SustainGraph (2023–2025)
• FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs / Lanzinger, M. P., & Razgon, I. (2024). FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. In O. Beyersdorff, M. M. Kanté, O. Kupferman, & D. Lokshtanov (Eds.), 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). https://doi.org/10.4230/LIPICS.STACS.2024.48
  Download: OA PDF (915 KB)
  Project: DeConquer (2023–2027)
• Fast parallel hypertree decompositions in logarithmic recursion depth / Gottlob, G., Lanzinger, M., Okulmus, C., & Pichler, R. (2024). Fast parallel hypertree decompositions in logarithmic recursion depth. ACM Transactions on Database Systems, 49(1), 1–43. https://doi.org/10.1145/3638758
  Download: OA PDF (1.11 MB)
  Projects: DeConquer (2023–2027) / HyperTrac (2018–2022) / KnowledgeGraph (2020–2028) / SustainGraph (2023–2025)
• On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters / Lanzinger, M. P., & Barceló, P. (2024). On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters. In The Twelth International Conference on Learning Representations, ICLR 2024, Vienna, Austria, May 7-11, 2024. The Twelfth International Conference on Learning Representations (ICLR 2024), Austria. http://hdl.handle.net/20.500.12708/197724
  Project: DeConquer (2023–2027)
• LLM-based DatalogMTL Modelling of MiCAR-compliant Crypto-Assets Markets / Colombo, A., Baldazzi, T., Bellomarini, L., Gentili, A., & Sallinger, E. (2024). LLM-based DatalogMTL Modelling of MiCAR-compliant Crypto-Assets Markets. In M. Alviano & M. P. Lanzinger (Eds.), 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) (pp. 17–22). https://doi.org/10.34726/8523
  Download: PDF (2.48 MB)
  Project: KnowledgeGraph (2020–2028)
• Homomorphism Counts for Graph Neural Networks: All About That Basis / Jin, E., Bronstein, M. M., Ceylan, I. I., & Lanzinger, M. (2024). Homomorphism Counts for Graph Neural Networks: All About That Basis. In Forty-first International Conference on Machine Learning. Forty-first International Conference on Machine Learning, Austria. http://hdl.handle.net/20.500.12708/210485
  Project: DeConquer (2023–2027)

2023

• Fractional covers of hypergraphs with bounded multi-intersection / Gottlob, G., Lanzinger, M., Pichler, R., & Razgon, I. (2023). Fractional covers of hypergraphs with bounded multi-intersection. Theoretical Computer Science, 979, Article 114204. https://doi.org/10.1016/j.tcs.2023.114204
  Download: Paper (460 KB)
  Projects: DeConquer (2023–2027) / HyperTrac (2018–2022)
• Temporal Datalog with Existential Quantification / Lanzinger, M., Nissl, M., Sallinger, E., & Wałęga, P. (2023). Temporal Datalog with Existential Quantification. In E. Elkind (Ed.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI 2023) (pp. 3277–3285). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2023/365

2022

• MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations / Lanzinger, M., Sferrazza, S., & Gottlob, G. (2022). MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations. Theory and Practice of Logic Programming, 22(5), 678–692. https://doi.org/10.1017/S1471068422000199
  Project: HyperTrac (2018–2022)
• New Perspectives for Fuzzy Datalog (Extended Abstract) / Lanzinger, M., Sferrazza, S., & Gottlob, G. (2022). New Perspectives for Fuzzy Datalog (Extended Abstract). In Proceedings of the 4th International Workshop on the Resurgence of Datalog in Academia and Industry (Datalog-2.0 2022) co-located with the 16th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR} 2022) (pp. 42–47). http://hdl.handle.net/20.500.12708/175762
  Download: PDF (1.17 MB)
  Project: HyperTrac (2018–2022)
• Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth / Gottlob, G., Lanzinger, M., Okulmus, C., & Pichler, R. (2022). Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. In Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (pp. 325–336). Association for Computing Machinery. https://doi.org/10.1145/3517804.3524153
  Project: HyperTrac (2018–2022)

2021

• Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation / Lanzinger, M. (2021). Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation. In L. Libkin (Ed.), Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (pp. 355–369). https://doi.org/10.1145/3452021.3458308
  Project: HyperTrac (2018–2022)
• Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems / Chen, H., Gottlob, G., Lanzinger, M., & Pichler, R. (2021). Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI 2020, Yokohama, Japan. https://doi.org/10.24963/ijcai.2020/239
  Project: HyperTrac (2018–2022)

2020

• Fractional Covers of Hypergraphs with BoundedMulti-Intersection / Gottlob, G., Lanzinger, M., Pichler, R., & Razgon, I. (2020). Fractional Covers of Hypergraphs with BoundedMulti-Intersection. In 45th International Symposium on Mathematical Foundations of Computer Science August 24-28, 2020, Prague (Czech Republic) (pp. 1–14). https://doi.org/10.4230/LIPIcs.MFCS.2020.41
• Complexity Analysis of General and Fractional Hypertree Decompositions / Gottlob, G., Lanzinger, M., Pichler, R., & Razgon, I. (2020). Complexity Analysis of General and Fractional Hypertree Decompositions (p. 54). arXiv. https://doi.org/10.48550/arXiv.2002.05239
• Hypergraph invariants for computational complexity / Lanzinger, M. P. (2020). Hypergraph invariants for computational complexity [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.90042
  Download: PDF (2.17 MB)
• The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions / Gottlob, G., Lanzinger, M., Longo, D. M., Okulmus, C., & Pichler, R. (2020). The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 3–21). Springer. https://doi.org/10.1007/978-3-030-58942-4_1
  Project: HyperTrac (2018–2022)

2019

• Semantic Width Revisited (Extended Abstract) / Gottlob, G., Lanzinger, M., & Pichler, R. (2019). Semantic Width Revisited (Extended Abstract). In Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, Asunci{’{o}}n, Paraguay, June 3-7, 2019 (pp. 1–5). CEUR-WS.org. http://hdl.handle.net/20.500.12708/55515
  Project: HyperTrac (2018–2022)
• Fixed-Parameter Tractable Fragments Of Conjunctive Queries And Constraint Satisfaction Problems / Lanzinger, M., Gottlob, G., & Pichler, R. (2019). Fixed-Parameter Tractable Fragments Of Conjunctive Queries And Constraint Satisfaction Problems. In noch nicht bekannt (pp. 1–2). http://hdl.handle.net/20.500.12708/57793

2017

• Mehrwertige Logiken für Spiele / Lanzinger, M. P. (2017). Mehrwertige Logiken für Spiele [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.33948
  Download: PDF (781 KB)

2013

• Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization / Gottlob, G., Lanzinger, M. P., Longo, D. M., Okulmus, C., Pichler, R., & Selzer, A. (2013). Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization. In B. Kimelfeld, M. V. Martinez, & R. Angles (Eds.), Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023). CEUR-WS.org. https://doi.org/10.34726/5396
  Download: PDF (932 KB)
  Projects: DeConquer (2023–2027) / KnowledgeGraph (2020–2028) / SustainGraph (2023–2025)

• Novel graph representations for improved transformer-based graph learning / Olsiakova, T. (2025). Novel graph representations for improved transformer-based graph learning [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2025.126461
  Download: PDF (1.58 MB)
• Performance Analysis of Column-Store Extensions for Modern-Day Business Segments / Sessa, V. (2022). Performance Analysis of Column-Store Extensions for Modern-Day Business Segments [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/158484
• Analyse und Vergleich von gängigen Graph-Anfragesprachen / Klampfer, M. (2021). Analyse und Vergleich von gängigen Graph-Anfragesprachen [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.79353
  Download: PDF (2.33 MB)