4 papers
Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width
Panagiotis Aivasiliotis, Andreas Göbel, Matthias Lanzinger +1
The Weisfeiler--Leman (WL) algorithm is one of the most influential heuristics for the graph isomorphism problem. The expressive power of WL has been extensively studied in the con…
Symmetric Parameterised Holants on Hypergraphs: Towards a Classification for Parameterised VCSPs
Panagiotis Aivasiliotis, Andreas Göbel, Marc Roth
We study the complexity of the parameterised counting constraint satisfaction problem: given a set of constraints over a set of variables and a positive integer , how many ways…
Parameterised Holant Problems
Panagiotis Aivasiliotis, Andreas Göbel, Marc Roth +1
We investigate the complexity of parameterised holant problems p- for families of signatures . The parameterised holant framework was int…
On the Approximability of External-Influence-Driven Problems
Panagiotis Aivasiliotis, Aris Pagourtzis
Domination problems in general can capture situations in which some entities have an effect on other entities (and sometimes on themselves). The usual goal is to select a minimum n…