Marc Roth
Marc Roth
School of Electronic Engineering and Computer Science, Queen Mary University of London
Verified email at - Homepage
Cited by
Cited by
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
Counting Answers to Existential Questions (Track B: Automata, Logic, Semantics, and Theory of Programming)
H Dell, M Roth, P Wellnitz
46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019
Counting Induced Subgraphs: A Topological Approach to #W[1]-Hardness
M Roth, J Schmitt
Algorithmica, 2020
Fine-grained Dichotomies for the Tutte Plane and Boolean #CSP
C Brand, H Dell, M Roth
Algorithmica 81 (2), 541-556, 2019
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
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
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
Exact and approximate pattern counting in degenerate graphs: New algorithms, hardness results, and complexity dichotomies
M Bressan, M Roth
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
Counting small induced subgraphs with hereditary properties
J Focke, M Roth
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
Parameterized Counting of Trees, Forests and Matroid Bases
C Brand, M Roth
12th International Computer Science Symposium in Russia (CSR 2017), 85-98, 2017
Counting small induced subgraphs satisfying monotone properties
M Roth, J Schmitt, P Wellnitz
SIAM Journal on Computing, FOCS20-139-FOCS20-174, 2022
Parameterized (Modular) Counting and Cayley Graph Expanders
N Peyerimhoff, M Roth, J Schmitt, J Stix, A Vdovina
arXiv preprint arXiv:2104.14596, 2021
Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders
M Roth, J Schmitt, P Wellnitz
arXiv preprint arXiv:2011.03433, 2020
Approximately counting answers to conjunctive queries with disequalities and negations
J Focke, LA Goldberg, M Roth, S Zivný
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022
Counting Problems on Quantum Graphs: Parameterized and Exact Complexity Classifications
M Roth
Saarland University, 2019
Counting Homomorphisms to -Minor-Free Graphs, Modulo 2
J Focke, LA Goldberg, M Roth, S Živný
SIAM Journal on Discrete Mathematics 35 (4), 2749-2814, 2021
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
Parameterized Counting of Partially Injective Homomorphisms
M Roth
Algorithmica 83 (6), 1829-1860, 2021
The Weisfeiler-Leman Dimension of Conjunctive Queries
A Göbel, LA Goldberg, M Roth
Proceedings of the ACM on Management of Data 2 (2), 1-17, 2024
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
J Focke, LA Goldberg, M Roth, S Zivný
Proceedings of the ACM on Management of Data 2 (2), 1-17, 2024
The system can't perform the operation now. Try again later.
Articles 1–20