5 citations · 17 across the 20 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
Matthias Lanzinger, Igor Razgon
Generalised hypertree width () is a hypergraph parameter that is central to the tractability of many prominent problems with natural hypergraph structure. Computing of a…
cs.DB2023★ 3 cited
Structure-Guided Query Evaluation: Towards Bridging the Gap from Theory to Practice
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo +3
Join queries involving many relations pose a severe challenge to today's query optimisation techniques. To some extent, this is due to the fact that these techniques do not pay suf…