| TISS: | Matthias Lanzinger |
| Room: | HD0305 |
| Phone: | +43/1/58801/1922-16 |
| Fax: | +43/1/58801/18493 |
| Email: | ![]() |
I am interested in a wide range of topics in theoretical computer science, database theory, and graph learning. I am currently particularly interested in the following areas, see the linked papers for details and full author lists.
When is conjunctive query evaluation polynomial-time tractable, and when does this coincide with fixed-parameter tractability?
How can Weisfeiler-Leman, graph neural networks, and homomorphism counts be combined in new ways, especially beyond graphs?
Which structural width measures for hypergraphs admit useful algorithms?
I am open to supervise student thesis in theoretical topics related to the areas described above.
If you're interested in conducting research under my guidance, please contact me for more information via email.
I generally do not supervise master's theses that are primarily focused on LLMs, surveys, or software engineering.