Marc Roth

Marc Roth is a Lecturer in Theoretical Computer Science at the School of Electronic Engineering and Computer Science, Queen Mary University of London, and an Associate Member of the Department of Computer Science at the University of Oxford. He previously held research positions at Oxford, including Senior Research Associate in Algorithms and Complexity Theory and Junior Research Fellow at Merton College.

His research focuses on computational counting problems, particularly the multivariate and exact complexity of infeasible counting problems, with applications in network analysis, bioinformatics, and graph neural networks. Key areas include motif counting in higher-order networks, parameterized and fine-grained complexity, approximation algorithms, and descriptive complexity theory.

His recent work aims to extend motif counting beyond graphs to higher-arity relational structures, with implications for the expressive power of hypergraph neural networks. He is currently recruiting a PhD student to work on these topics.

Marc Roth earned his PhD in Computer Science from Saarland University and the Cluster of Excellence MMCI under the supervision of Holger Dell.

Scientific Awards:

• No scientific awards mentioned in the provided text.

Advising and Grants:
Marc Roth is actively involved in academic supervision, currently advertising a fully funded PhD studentship on motif counting in higher-order networks. The position includes tuition coverage and a UKRI-level stipend, indicating active grant support. He welcomes prospective PhD applicants and is engaged in mentoring and research guidance.

Labs and Teams:
Marc Roth is affiliated with the theoretical computer science group at Queen Mary University of London. He was previously part of the algorithms and complexity theory group at the University of Oxford under Leslie Ann Goldberg and associated with Merton College. His research is collaborative and theory-driven, focusing on algorithmic foundations of network analysis.