Marc Roth
Scholar

Marc Roth

Google Scholar ID: dbyXNRsAAAAJ
School of Electronic Engineering and Computer Science, Queen Mary University of London
complexity theorycounting problemsparameterized algorithmsfine-grained complexity
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
520
 
H-index
13
 
i10-index
17
 
Publications
20
 
Co-authors
15
list available
Contact
No contact links provided.
Publications
7 items
The Parameterised Complexity of Temporal Motif Counting, and a Lovász-Style Isomorphism Theorem
2026
Cited
0
Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width
2026
Cited
0
The Fine-Grained Complexity of Counting Hypergraph Motifs
2026
Cited
0
COMPOSITE-Stem
2026
Cited
0
Parameterised Counting Constraint Satisfaction Problems via Holants on Hypergraphs
2025
Cited
0
Parameterised Holant Problems
arXiv.org · 2024
Cited
0
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
Proc. ACM Manag. Data · 2023
Cited
2
Resume (English only)
Co-authors
15 total
Philip Wellnitz
Philip Wellnitz
National Institute of Informatics and The Graduate University for Advanced Studies, SOKENDAI
Johannes Schmitt
Johannes Schmitt
Postdoc in Mathematics, ETH Zurich
Leslie Ann Goldberg
Leslie Ann Goldberg
Professor of Computer Science, University of Oxford
Holger Dell
Holger Dell
IT University of Copenhagen
Co-author 5
Co-author 5
Marco Bressan
Marco Bressan
Associate Professor, Department of Computer Science, University of Milan
Yannick Forster
Yannick Forster
Cambium Team, Inria Paris
Stanislav Živný
Stanislav Živný
Professor of Computer Science, University of Oxford