Matthias Lanzinger

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
FPT approximation of generalised hypertree width for bounded intersection hypergraphs ACM Transactions on Computation Theory	2026-08-04	Paper
FPT approximation of generalised hypertree width for bounded intersection hypergraphs	2025-11-10	Paper
Fuzzy Datalog^ over arbitrary t-norms	2025-02-19	Paper
The complexity of pattern counting in directed graphs, parameterised by the outdegree	2024-05-08	Paper
Fast parallel hypertree decompositions in logarithmic recursion depth ACM Transactions on Database Systems	2024-04-30	Paper
Incremental Updates of Generalized Hypertree Decompositions ACM Journal of Experimental Algorithmics	2024-04-14	Paper
Fractional covers of hypergraphs with bounded multi-intersection Theoretical Computer Science	2023-10-26	Paper
Tractability beyond -acyclicity for conjunctive queries with negation and SAT Theoretical Computer Science	2022-12-21	Paper
The HyperTrac project: recent progress and future research directions on hypergraph decompositions (available as arXiv preprint)	2022-12-21	Paper
Complexity Analysis of Generalized and Fractional Hypertree Decompositions Journal of the ACM	2022-12-08	Paper
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations Theory and Practice of Logic Programming	2022-09-30	Paper
scientific article; zbMATH DE number 7559412 (Why is no real title available?) (available as arXiv preprint)	2022-07-18	Paper

Research outcomes over time

This page was built for person: Matthias Lanzinger