Marc Roth - RankMe

63 papers A* 12A 3B 4Misc 1Journal 42

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Parameterised counting complexity theory. Comput. Sci. Rev. Marc Roth
2026	A*	`conf`	The Parameterised Complexity of Counting Small Sub-Hypergraphs. SODA Marco Bressan, Julian Brinkmann, Holger Dell, Marc Roth, Philip Wellnitz
2025	J	`jnl`	Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. ACM Trans. Algorithms Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2025	J	`jnl`	Parameterised Counting Constraint Satisfaction Problems via Holants on Hypergraphs. CoRR Panagiotis Aivasiliotis, Andreas Göbel, Marc Roth
2025	A*	`conf`	Parameterised Holant Problems. ICALP Panagiotis Aivasiliotis, Andreas Göbel, Marc Roth, Johannes Schmitt
2025	J	`jnl`	The Complexity of Counting Small Sub-Hypergraphs. CoRR Marco Bressan, Julian Brinkmann, Holger Dell, Marc Roth, Philip Wellnitz
2024	J	`jnl`	Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. Proc. ACM Manag. Data Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2024	J	`jnl`	Counting Small Induced Subgraphs Satisfying Monotone Properties. SIAM J. Comput. Marc Roth, Johannes Schmitt, Philip Wellnitz
2024	J	`jnl`	Counting Small Induced Subgraphs with Hereditary Properties. SIAM J. Comput. Jacob Focke, Marc Roth
2024	J	`jnl`	Counting Subgraphs in Somewhere Dense Graphs. SIAM J. Comput. Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
2024	J	`jnl`	Parameterised Holant Problems. CoRR Panagiotis Aivasiliotis, Andreas Göbel, Marc Roth, Johannes Schmitt
2024	J	`jnl`	Parameterised and Fine-Grained Subgraph Counting, Modulo 2. Algorithmica Leslie Ann Goldberg, Marc Roth
2024	J	`jnl`	Parameterised approximation of the fixation probability of the dominant mutation in the multi-type Moran process. Theor. Comput. Sci. Leslie Ann Goldberg, Marc Roth, Tassilo Constantin Schwarz
2024	J	`jnl`	The Weisfeiler-Leman Dimension of Conjunctive Queries. Proc. ACM Manag. Data Andreas Göbel, Leslie Ann Goldberg, Marc Roth
2023	J	`jnl`	Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. CoRR Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2023	A	`conf`	Counting Subgraphs in Somewhere Dense Graphs. ITCS Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
2023	J	`jnl`	Parameterised Approximation of the Fixation Probability of the Dominant Mutation in the Multi-Type Moran Process. CoRR Leslie Ann Goldberg, Marc Roth, Tassilo Constantin Schwarz
2023	A*	`conf`	Parameterised and Fine-Grained Subgraph Counting, Modulo 2. ICALP Leslie Ann Goldberg, Marc Roth
2023	J	`jnl`	Parameterised and Fine-grained Subgraph Counting, modulo 2. CoRR Leslie Ann Goldberg, Marc Roth
2023	J	`jnl`	Parameterized Counting and Cayley Graph Expanders. SIAM J. Discret. Math. Norbert Peyerimhoff, Marc Roth, Johannes Schmitt, Jakob Stix, Alina Vdovina, Philip Wellnitz
2023	A*	`conf`	The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. STOC Marco Bressan, Matthias Lanzinger, Marc Roth
2023	J	`jnl`	The Weisfeiler-Leman Dimension of Existential Conjunctive Queries. CoRR Andreas Göbel, Leslie Ann Goldberg, Marc Roth
2022	A*	`conf`	Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. PODS Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2022	J	`jnl`	Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. Algorithmica Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
2022	J	`jnl`	Counting Subgraphs in Somewhere Dense Graphs. CoRR Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
2022	A*	`conf`	Counting small induced subgraphs with hereditary properties. STOC Jacob Focke, Marc Roth
2022	J	`jnl`	The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. CoRR Marco Bressan, Matthias Lanzinger, Marc Roth
2021	J	`jnl`	Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. CoRR Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2021	A*	`conf`	Counting Homomorphisms to SODA Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2021	J	`jnl`	Counting Homomorphisms to K SIAM J. Discret. Math. Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2021	J	`jnl`	Counting Small Induced Subgraphs with Hereditary Properties. CoRR Jacob Focke, Marc Roth
2021	J	`jnl`	Counting homomorphisms, subgraphs, and induced subgraphs in degenerate graphs: new hardness results and complete complexity classifications. CoRR Marco Bressan, Marc Roth
2021	A*	`conf`	Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. ICALP Marc Roth, Johannes Schmitt, Philip Wellnitz
2021	A*	`conf`	Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies. FOCS Marco Bressan, Marc Roth
2021	B	`conf`	Parameterized (Modular) Counting and Cayley Graph Expanders. MFCS Norbert Peyerimhoff, Marc Roth, Johannes Schmitt, Jakob Stix, Alina Vdovina
2021	J	`jnl`	Parameterized (Modular) Counting and Cayley Graph Expanders. CoRR Norbert Peyerimhoff, Marc Roth, Johannes Schmitt, Jakob Stix, Alina Vdovina
2021	J	`jnl`	Parameterized Counting of Partially Injective Homomorphisms. Algorithmica Marc Roth
2020	J	`jnl`	Counting Homomorphisms to K CoRR Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
2020	J	`jnl`	Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. Algorithmica Marc Roth, Johannes Schmitt
2020	A*	`conf`	Counting Small Induced Subgraphs Satisfying Monotone Properties. FOCS Marc Roth, Johannes Schmitt, Philip Wellnitz
2020	J	`jnl`	Counting Small Induced Subgraphs Satisfying Monotone Properties. CoRR Marc Roth, Johannes Schmitt, Philip Wellnitz
2020	A*	`conf`	Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. SODA Marc Roth, Philip Wellnitz
2020	J	`jnl`	Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. CoRR Marc Roth, Johannes Schmitt, Philip Wellnitz
2020	J	`jnl`	The weak call-by-value λ-calculus is reasonable for both time and space. Proc. ACM Program. Lang. Yannick Forster, Fabian Kunze, Marc Roth
2019	A*	`conf`	Counting Answers to Existential Questions. ICALP Holger Dell, Marc Roth, Philip Wellnitz
2019	J	`jnl`	Counting Answers to Existential Questions. CoRR Holger Dell, Marc Roth, Philip Wellnitz
2019	J	`jnl`	Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes. Theory Comput. Syst. Radu Curticapean, Holger Dell, Marc Roth
2019	B	`conf`	Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. MFCS Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
2019	J	`jnl`	Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. CoRR Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
2019	J	`jnl`	Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. CoRR Marc Roth, Philip Wellnitz
2019	—	`—`	Counting problems on quantum graphs. Marc Roth
2019	J	`jnl`	Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. Algorithmica Cornelius Brand, Holger Dell, Marc Roth
2019	J	`jnl`	The Weak Call-By-Value λ-Calculus is Reasonable for Both Time and Space. CoRR Yannick Forster, Fabian Kunze, Marc Roth
2018	B	`conf`	Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. IPEC Marc Roth, Johannes Schmitt
2018	J	`jnl`	Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. CoRR Marc Roth, Johannes Schmitt
2017	A	`conf`	Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes. STACS Radu Curticapean, Holger Dell, Marc Roth
2017	A	`conf`	Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices. ESA Marc Roth
2017	J	`jnl`	Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices. CoRR Marc Roth
2017	J	`jnl`	Counting edge-injective homomorphisms and matchings on restricted graph classes. CoRR Radu Curticapean, Holger Dell, Marc Roth
2017	Misc	`conf`	Parameterized Counting of Trees, Forests and Matroid Bases. CSR Cornelius Brand, Marc Roth
2016	B	`conf`	Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. IPEC Cornelius Brand, Holger Dell, Marc Roth
2016	J	`jnl`	Fine-grained dichotomies for the Tutte plane and Boolean #CSP. CoRR Cornelius Brand, Holger Dell, Marc Roth
2016	J	`jnl`	Parameterized counting of trees, forests and matroid bases. CoRR Cornelius Brand, Marc Roth