Matthias Paul Lanzinger
Assistant Prof. Dipl.-Ing. Dr.techn. / BSc
Research Focus
- Logic and Computation: 80%
- Artificial Intelligence and Data Science: 20%
Research Areas
- Algorithms, Graph Neural Networks, Problem decomposition techniques based on graphs and hypergraphs, Parameterized Complexity, Computational Logic, Theoretical Compurter Science, Logic Programming
Role
- Assistant Professor
Databases and Artificial Intelligence, E192-02
Contact
- matthias.lanzinger@tuwien.ac.at
- +43-1-58801-192230
- 1040 Wien, Favoritenstrasse 9 / Room HD0305
- vCard from TISS
- orcid.org/0000-0002-7601-3727
- informatics.tuwien.ac.at/people/matthias-lanzinger
- tiss.tuwien.ac.at/person/230336
Courses
Summer 2027
- Advanced Database Systems / 184.780 VU
- Bachelor Thesis / 184.691 PR
- Doctoral & Master Students Seminar / 181.223 SE
- Knowledge Graphs / 192.116 VU
- Knowledge Graphs / 192.194 VU
- Project in Computer Science 1 / 192.021 PR
- Project in Computer Science 2 / 192.022 PR
Winter 2026
- Bachelor Thesis / 184.691 PR
- CAIML seminar / 192.138 SE
- 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
- Seminar for Master Students in Software Engineering (Foundations, Logic, and Security) Areas: Algorithms and Complexity; Verification and Automated Reasoning; Logic and Knowledge Representation; Security and Privacy / 180.010 SE
Projects
- 2023 – 2027 / Vienna Science and Technology Fund (WWTF) / Publications (34)
Publications
2026
- Lanzinger, M., Razgon, I. (2026). FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. ACM Transactions on Computation Theory, 18(2), 1–34. Peer-reviewed.DOI: 10.1145/3799232 / Project: DeConquer
- Lanzinger, M., Pichler, R., Selzer, A. (2026). Query Answering without Join Computation: An Interactive Exploration of Practical Techniques. In C. Binnig, S. Roy, J. Haritsa, S. Sudarshan (Eds.), SIGMOD Companion ’26 : Companion of the International Conference on Management of Data (pp. 66–69). Association for Computing Machinery, Inc. (ACM). Peer-reviewed.
- Barceló, P., Geerts, F., Lanzinger, M., Pakhomenko, K., Van den Bussche, J. (2026). A Logical View of GNN-Style Computation and the Role of Activation Functions. Proceedings of the ACM on Management of Data (PACMMOD), 4(2), 1–19. Peer-reviewed.DOI: 10.1145/3801914 / Project: DeConquer
- Lanzinger, M., Razgon, I., Unterberger, D. (2026). FPT Parameterisations of Fractional and Generalised Hypertree Width. Proceedings of the ACM on Management of Data (PACMMOD), 4(2), 1–17. Peer-reviewed.DOI: 10.1145/3801900 / Project: DeConquer
- Böhm, D., Gottlob, G., Lanzinger, M., Longo, D. M., Okulmus, C., Pichler, R., Selzer, A. (2026). Selective Use of Yannakakis’ Algorithm for Consistent Performance Gains. In E. Tzirita Zacharatou A. Maté (Eds.), Proceedings of the 28th International Workshop on Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026) co-located with the 29th International Conference on Extending Database Technology and the 28th International Conference on Database Theory (EDBT/ICDT 2026) : Tampere, Finland, March 24, 2026 (pp. 18–33). Peer-reviewed.
- Lanzinger, M., Pichler, R., Selzer, A. (2026). Database Theory in Action: Evaluation of Aggregate Queries Without Materialisation. In 29th International Conference on Database Theory (ICDT 2026) (pp. 24:1-24:5). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Peer-reviewed.
- Barcelo, P., Jogl, F., Kozachinskiy, A., Lanzinger, M. P., Neumann, S., Rojas, C. (2026). Message Passing on the Edge: Towards Scalable and Expressive {GNN}s. In Forty-third International Conference on Machine Learning : ICML 2026. Forty-Third International Conference on Machine Learning (ICML 2026), Seoul, Korea (the Republic of). Peer-reviewed.
2025
- 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. Peer-reviewed.DOI: 10.1145/3725251 / Project: DeConquer
- 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. Peer-reviewed.
- 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). Peer-reviewed.HDL: 20.500.12708/217250 / Project: DeConquer
- Lanzinger, M. P., Pichler, R., Selzer, A. (2025). Avoiding Materialisation for Guarded Aggregate Queries. Proceedings of the VLDB Endowment, 18(5), 1398–1411. Peer-reviewed.DOI: 10.14778/3718057.3718068 / Project: KnowledgeGraph
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) co-located with the 17th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2024) (Vol. 3801). CEUR-WS.org. Peer-reviewed.HDL: 20.500.12708/203907
- 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). Peer-reviewed.
- 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). Peer-reviewed.
- 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. Peer-reviewed.
- 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. Peer-reviewed.HDL: 20.500.12708/197724 / Project: DeConquer
- 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. Peer-reviewed.HDL: 20.500.12708/210485 / Project: DeConquer
- 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). Peer-reviewed.
2023
- Gottlob, G., Lanzinger, M., Pichler, R., Razgon, I. (2023). Fractional covers of hypergraphs with bounded multi-intersection. Theoretical Computer Science, 979, Article 114204. Peer-reviewed.
- 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. Peer-reviewed.
2022
- 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. Peer-reviewed.DOI: 10.1017/S1471068422000199 / Project: HyperTrac
- 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. Peer-reviewed.DOI: 10.1145/3517804.3524153 / Project: HyperTrac
- 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). Peer-reviewed.
2021
- 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).DOI: 10.1145/3452021.3458308 / Project: HyperTrac
- 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. Peer-reviewed.DOI: 10.24963/ijcai.2020/239 / Project: HyperTrac
2020
- 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). Peer-reviewed.
- 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. Peer-reviewed.DOI: 10.1007/978-3-030-58942-4_1 / Project: HyperTrac
- Gottlob, G., Lanzinger, M., Pichler, R., Razgon, I. (2020). Complexity Analysis of General and Fractional Hypertree Decompositions (p. 54). arXiv.
2019
- 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. Peer-reviewed.HDL: 20.500.12708/55515 / Project: HyperTrac
- 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). Peer-reviewed.HDL: 20.500.12708/57793
2013
- 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. Peer-reviewed.
Theses
- Selzer, A. (2026). A Structural Approach to Query Optimisation for Efficient Join and Aggregate Processing [Dissertation, Technische Universität Wien]. reposiTUm.DOI: 10.34726/hss.2026.138101 / Download: PDF
- Hausberger, B. (2026). Enhanced repository-level code comprehension through knowledge graphs for large language models [Diploma Thesis, Technische Universität Wien]. reposiTUm.DOI: 10.34726/hss.2026.137228 / Download: PDF
- Böhm, J. (2026). Message passing on the edge : going beyond triangles [Diploma Thesis, Technische Universität Wien]. reposiTUm.DOI: 10.34726/hss.2026.137416 / Download: PDF
- Lorenz, A. (2026). Graph Neural Networks for Simulating Lineup Changes and Team Performance in Football [Diploma Thesis, Technische Universität Wien]. reposiTUm.DOI: 10.34726/hss.2026.138965 / Download: PDF
- Olsiakova, T. (2025). Novel graph representations for improved transformer-based graph learning [Diploma Thesis, Technische Universität Wien]. reposiTUm.DOI: 10.34726/hss.2025.126461 / Download: PDF
- Sessa, V. (2022). Performance Analysis of Column-Store Extensions for Modern-Day Business Segments [Diploma Thesis, Technische Universität Wien]. reposiTUm.HDL: 20.500.12708/158484
- Klampfer, M. (2021). Analyse und Vergleich von gängigen Graph-Anfragesprachen [Diploma Thesis, Technische Universität Wien]. reposiTUm.DOI: 10.34726/hss.2021.79353 / Download: PDF
- Lanzinger, M. P. (2020). Hypergraph invariants for computational complexity [Dissertation, Technische Universität Wien]. reposiTUm.DOI: 10.34726/hss.2021.90042 / Download: PDF
- Lanzinger, M. P. (2017). Mehrwertige Logiken für Spiele [Diploma Thesis, Technische Universität Wien]. reposiTUm.DOI: 10.34726/hss.2017.33948 / Download: PDF
And more…
Soon, this page will include additional information such as reference projects, activities as journal reviewer and editor, memberships in councils and committees, and other research activities.
Until then, please visit Matthias Paul’s research profile in TISS.