Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. - Benjamin Scheidt; Nicole Schweikardt (MFCS, 2023)

On Homomorphism Indistinguishability and Hypertree Depth. - Benjamin Scheidt (ICALP, 2024)

Using Color Refinement to Boost Enumeration and Counting for Acyclic CQs of Binary Schemas. - Cristian Riveros; Benjamin Scheidt; Nicole Schweikardt (CoRR, 2024)

Reaching New Limits: Discovery of Multi-Dimensional Disjunctive Subsequence-Queries with Intervals. - André Frochaux; Sarah Kleest-Meißner; Benjamin Scheidt (BTW, 2025)

Color Refinement for Relational Structures. - Benjamin Scheidt; Nicole Schweikardt (MFCS, 2025)