Yannick Forster, Fabian Kunze and Marc Roth

The Weak Call-By-Value λ-Calculus is Reasonable for Both Time and Space

POPL 2020 / arxiv 2019

Marc Roth and Philip Wellnitz

Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory

SODA 2020 / arxiv 2019

Julian Dörfler, Marc Roth, Johannes Schmitt and Philip Wellnitz

Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness

MFCS 2019 / arxiv 2019

Holger Dell, Marc Roth and Philip Wellnitz

Counting Answers to Existential Questions

ICALP 2019 / arxiv 2019

Marc Roth and Johannes Schmitt

Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness

IPEC 2018 Best Paper Award and IPEC 2018 Excellent Student Paper Award

Algorithmica (to appear) / IPEC 2018 / arxiv 2018

Marc Roth

Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices

ESA 2017 Best Student Paper Award

ESA 2017 / arxiv 2017

Cornelius Brand and Marc Roth

Parameterized Counting of Trees, Forests and Matroid Bases

CSR 2017 / arxiv 2017

Radu Curticapean, Holger Dell and Marc Roth

Counting Edge-Injective Homomorphisms and Matchings in Restricted Graph Classes

Theory of Computing Systems 2019 / STACS 2017 / arxiv 2017

Cornelius Brand, Holger Dell and Marc Roth

Fine-Grained Dichotomies for the Tutte plane and Boolean #CSP

IPEC 2016 Best Paper Award

Algorithmica 2019 / IPEC 2016 / arxiv 2016



Marc Roth

Counting Problems on Quantum Graphs: Parameterized and Exact Complexity Classifications

Saarland University 2019