Marc Roth

This webpage will no longer be updated as I left MMCI in September 2019, please visit my personal homepage.


I am a PhD student in the Independent Research Group Foundations of Exact Algorithms of Holger Dell.

Short CV

Research interests

Research areas I consider most fascinating and in which I worked so far include, but are not limited to:

  • Parameterized and classical counting complexity
  • Fine grained complexity theory, e.g. lower bounds under ETH or #ETH
  • Computational Logic
  • Interactive theorem proving



  • 08/2018: Our paper "Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness" won both, the IPEC 2018 Excellent Student Paper Award and the IPEC 2018 Best Paper Award
  • 09/2017: ESA Best Student Paper Award for the paper "Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices"
  • 08/2016: Our paper "Fine-grained dichotomies for the Tutte plane and Boolean #CSP" won one of the IPEC Best Paper Awards
  • 11/2015: FdSI-Bachelor-Preis, award for the best Bachelor degrees by the computer science faculty of Saarland University
  • 10/2014 - 06/2016: Scholarship from the Graduate School of Computer Science at Saarland University


Marc Roth

Marc Roth

Saarland University
Cluster of Excellence
Multimodal Computing and Interaction

Campus E1 3, Room 426
66123, Saarbrücken



Computer Science Department, Saarland University Saarland University International Graduate School for Computer Science, Saarland University Cluster of Excellence