Marc Roth
Title
Cited by
Cited by
Year
The Weak call-by-value λ-Calculus is Reasonable for both Time and Space
Y Forster, F Kunze, M Roth
Proceedings of the ACM on Programming Languages 4 (POPL), 27:1-27:23, 2019
13*2019
Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices
M Roth
25th Annual European Symposium on Algorithms (ESA 2017), 63:1-63:14, 2017
112017
Fine-grained Dichotomies for the Tutte Plane and Boolean #CSP
C Brand, H Dell, M Roth
Algorithmica 81 (2), 541-556, 2019
82019
Counting Induced Subgraphs: A Topological Approach to #W[1]-Hardness
M Roth, J Schmitt
Algorithmica, 2020
52020
Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes
R Curticapean, H Dell, M Roth
Theory of Computing Systems 63 (5), 987-1026, 2019
52019
Counting Answers to Existential Questions
M Roth, H Dell, P Wellnitz
46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019
5*2019
Parameterized Counting of Trees, Forests and Matroid Bases
C Brand, M Roth
12th International Computer Science Symposium in Russia (CSR 2017), 85-98, 2017
52017
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness
J Dörfler, M Roth, J Schmitt, P Wellnitz
44th International Symposium on Mathematical Foundations of Computer Science …, 2019
32019
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory
M Roth, P Wellnitz
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA 2020 …, 2020
22020
Counting Problems on Quantum Graphs: Parameterized and Exact Complexity Classifications
M Roth
Saarland University, 2019
12019
Counting Homomorphisms to -minor-free Graphs, modulo 2
J Focke, LA Goldberg, M Roth, S Živný
arXiv preprint arXiv:2006.16632, 2020
2020
Counting Small Induced Subgraphs Satisfying Monotone Properties
M Roth, J Schmitt, P Wellnitz
arXiv preprint arXiv:2004.06595, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–12