Marc Roth

Dr. Marc Roth is a Lecturer in Theoretical Computer Science at Queen Mary University of London (QMUL), affiliated with the School of Electronic Engineering and Computer Science. He is also an Associate Member of the Department of Computer Science at the University of Oxford. Previously, he served as a Senior Research Associate at Oxford (until 2023) and held a Junior Research Fellowship at Merton College, Oxford. He earned his PhD in Computer Science from Saarland University under Prof. Holger Dell.

His research focuses on computational counting problems, particularly in the context of graph theory and algorithmic complexity. Key interests include parameterized and fine-grained complexity, exact and approximate counting algorithms, and applications in network analysis. He has contributed to foundational work on subgraph counting, constraint satisfaction, and the theoretical limits of computational problems.

Dr. Roth’s work bridges theoretical computer science and practical algorithm design, addressing challenges in analyzing large networks and understanding complexity hierarchies. He actively collaborates with institutions like the Centre for Fundamental Computer Science at QMUL and has supervised a PhD studentship exploring motif counting in higher-order networks.