Parameterized Counting of Trees, Forests and Matroid Bases. - Cornelius Brand; Marc Roth (CSR, 2017)

Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices. - Marc Roth (ESA, 2017)

Counting Answers to Existential Questions. - Holger Dell; Marc Roth; Philip Wellnitz (ICALP, 2019)

Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. - Cornelius Brand; Holger Dell; Marc Roth (Algorithmica, 2019)

Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes. - Radu Curticapean; Holger Dell; Marc Roth (Theory Comput. Syst., 2019)

Counting problems on quantum graphs. - Marc Roth (2019)

Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. - Marc Roth; Philip Wellnitz (SODA, 2020)

Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. - Marc Roth; Johannes Schmitt 002 (Algorithmica, 2020)

The weak call-by-value λ-calculus is reasonable for both time and space. - Yannick Forster 002; Fabian Kunze; Marc Roth (Proc. ACM Program. Lang., 2020)

Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies. - Marco Bressan 002; Marc Roth (FOCS, 2021)

Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. - Marc Roth; Johannes Schmitt 002; Philip Wellnitz (ICALP, 2021)

Parameterized (Modular) Counting and Cayley Graph Expanders. - Norbert Peyerimhoff; Marc Roth; Johannes Schmitt 002; Jakob Stix; Alina Vdovina (MFCS, 2021)

Counting Homomorphisms to K4-minor-free Graphs, modulo 2. - Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Zivný (SODA, 2021)

Parameterized Counting of Partially Injective Homomorphisms. - Marc Roth (Algorithmica, 2021)

Counting homomorphisms, subgraphs, and induced subgraphs in degenerate graphs: new hardness results and complete complexity classifications. - Marco Bressan 002; Marc Roth (CoRR, 2021)

Counting Homomorphisms to K4-Minor-Free Graphs, Modulo 2. - Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Zivný (SIAM J. Discret. Math., 2021)

Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. - Julian Dörfler; Marc Roth; Johannes Schmitt 002; Philip Wellnitz (Algorithmica, 2022)

The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. - Marco Bressan 002; Matthias Lanzinger; Marc Roth (STOC, 2023)

The Weisfeiler-Leman Dimension of Existential Conjunctive Queries. - Andreas Göbel 001; Leslie Ann Goldberg; Marc Roth (CoRR, 2023)

Parameterized Counting and Cayley Graph Expanders. - Norbert Peyerimhoff; Marc Roth; Johannes Schmitt 002; Jakob Stix; Alina Vdovina; Philip Wellnitz (SIAM J. Discret. Math., 2023)

The Weisfeiler-Leman Dimension of Conjunctive Queries. - Andreas Göbel 001; Leslie Ann Goldberg; Marc Roth (Proc. ACM Manag. Data, 2024)

Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. - Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Zivný (Proc. ACM Manag. Data, 2024)

Counting Subgraphs in Somewhere Dense Graphs. - Marco Bressan 002; Leslie Ann Goldberg; Kitty Meeks; Marc Roth (SIAM J. Comput., 2024)

Counting Small Induced Subgraphs with Hereditary Properties. - Jacob Focke; Marc Roth (SIAM J. Comput., 2024)

Counting Small Induced Subgraphs Satisfying Monotone Properties. - Marc Roth; Johannes Schmitt 002; Philip Wellnitz (SIAM J. Comput., 2024)

Parameterised approximation of the fixation probability of the dominant mutation in the multi-type Moran process. - Leslie Ann Goldberg; Marc Roth; Tassilo Constantin Schwarz (Theor. Comput. Sci., 2024)

Parameterised and Fine-Grained Subgraph Counting, Modulo 2. - Leslie Ann Goldberg; Marc Roth (Algorithmica, 2024)

Parameterised Holant Problems. - Panagiotis Aivasiliotis; Andreas Göbel 001; Marc Roth; Johannes Schmitt 002 (ICALP, 2025)

Humanity's Last Exam. - Long Phan; Alice Gatti; Ziwen Han; Nathaniel Li; Josephina Hu; Hugh Zhang; Sean Shi; Michael Choi; Anish Agrawal; Arnav Chopra; Adam Khoja; Ryan Kim; et al. (CoRR, 2025)

Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. - Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Zivný (ACM Trans. Algorithms, 2025)

The Complexity of Counting Small Sub-Hypergraphs. - Marco Bressan 002; Julian Brinkmann; Holger Dell; Marc Roth; Philip Wellnitz (CoRR, 2025)