Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Roth
Person information
- affiliation: University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Norbert Peyerimhoff, Marc Roth
, Johannes Schmitt, Jakob Stix, Alina Vdovina, Philip Wellnitz:
Parameterized Counting and Cayley Graph Expanders. SIAM J. Discret. Math. 37(2): 405-486 (2023)- [c18]Leslie Ann Goldberg, Marc Roth:
Parameterised and Fine-Grained Subgraph Counting, Modulo 2. ICALP 2023: 68:1-68:17 - [c17]Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth:
Counting Subgraphs in Somewhere Dense Graphs. ITCS 2023: 27:1-27:14 - [c16]Marco Bressan, Matthias Lanzinger, Marc Roth:
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. STOC 2023: 542-552 - [i22]Leslie Ann Goldberg, Marc Roth:
Parameterised and Fine-grained Subgraph Counting, modulo 2. CoRR abs/2301.01696 (2023) - [i21]Leslie Ann Goldberg, Marc Roth, Tassilo Constantin Schwarz:
Parameterised Approximation of the Fixation Probability of the Dominant Mutation in the Multi-Type Moran Process. CoRR abs/2303.08118 (2023) - [i20]Andreas Göbel, Leslie Ann Goldberg, Marc Roth:
The Weisfeiler-Leman Dimension of Existential Conjunctive Queries. CoRR abs/2310.19006 (2023) - [i19]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. CoRR abs/2311.10634 (2023) - 2022
- [j7]Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz:
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. Algorithmica 84(2): 379-404 (2022) - [c15]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. PODS 2022: 315-324 - [c14]Jacob Focke, Marc Roth:
Counting small induced subgraphs with hereditary properties. STOC 2022: 1543-1551 - [i18]Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth:
Counting Subgraphs in Somewhere Dense Graphs. CoRR abs/2209.03402 (2022) - [i17]Marco Bressan, Matthias Lanzinger, Marc Roth:
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. CoRR abs/2211.01905 (2022) - 2021
- [j6]Marc Roth:
Parameterized Counting of Partially Injective Homomorphisms. Algorithmica 83(6): 1829-1860 (2021) - [j5]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Homomorphisms to K4-Minor-Free Graphs, Modulo 2. SIAM J. Discret. Math. 35(4): 2749-2814 (2021) - [c13]Marco Bressan, Marc Roth:
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies. FOCS 2021: 276-285 - [c12]Marc Roth, Johannes Schmitt, Philip Wellnitz:
Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. ICALP 2021: 108:1-108:16 - [c11]Norbert Peyerimhoff, Marc Roth, Johannes Schmitt, Jakob Stix, Alina Vdovina:
Parameterized (Modular) Counting and Cayley Graph Expanders. MFCS 2021: 84:1-84:15 - [c10]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Homomorphisms to K4-minor-free Graphs, modulo 2. SODA 2021: 2303-2314 - [i16]Marco Bressan, Marc Roth:
Counting homomorphisms, subgraphs, and induced subgraphs in degenerate graphs: new hardness results and complete complexity classifications. CoRR abs/2103.05588 (2021) - [i15]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. CoRR abs/2103.12468 (2021) - [i14]Norbert Peyerimhoff, Marc Roth, Johannes Schmitt, Jakob Stix, Alina Vdovina:
Parameterized (Modular) Counting and Cayley Graph Expanders. CoRR abs/2104.14596 (2021) - [i13]Jacob Focke, Marc Roth:
Counting Small Induced Subgraphs with Hereditary Properties. CoRR abs/2111.02277 (2021) - 2020
- [j4]Marc Roth, Johannes Schmitt:
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. Algorithmica 82(8): 2267-2291 (2020) - [j3]Yannick Forster, Fabian Kunze, Marc Roth:
The weak call-by-value λ-calculus is reasonable for both time and space. Proc. ACM Program. Lang. 4(POPL): 27:1-27:23 (2020) - [c9]Marc Roth, Johannes Schmitt, Philip Wellnitz:
Counting Small Induced Subgraphs Satisfying Monotone Properties. FOCS 2020: 1356-1367 - [c8]Marc Roth, Philip Wellnitz:
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. SODA 2020: 2161-2180 - [i12]Marc Roth, Johannes Schmitt, Philip Wellnitz:
Counting Small Induced Subgraphs Satisfying Monotone Properties. CoRR abs/2004.06595 (2020) - [i11]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Homomorphisms to K4-minor-free Graphs, modulo 2. CoRR abs/2006.16632 (2020) - [i10]Marc Roth, Johannes Schmitt, Philip Wellnitz:
Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. CoRR abs/2011.03433 (2020)
2010 – 2019
- 2019
- [b1]Marc Roth:
Counting problems on quantum graphs. Saarland University, Germany, 2019 - [j2]Cornelius Brand, Holger Dell, Marc Roth:
Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. Algorithmica 81(2): 541-556 (2019) - [j1]Radu Curticapean, Holger Dell, Marc Roth:
Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes. Theory Comput. Syst. 63(5): 987-1026 (2019) - [c7]Holger Dell, Marc Roth, Philip Wellnitz:
Counting Answers to Existential Questions. ICALP 2019: 113:1-113:15 - [c6]Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz:
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. MFCS 2019: 26:1-26:14 - [i9]Holger Dell, Marc Roth, Philip Wellnitz:
Counting Answers to Existential Questions. CoRR abs/1902.04960 (2019) - [i8]Yannick Forster, Fabian Kunze, Marc Roth:
The Weak Call-By-Value λ-Calculus is Reasonable for Both Time and Space. CoRR abs/1902.07515 (2019) - [i7]Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz:
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. CoRR abs/1904.10479 (2019) - [i6]Marc Roth, Philip Wellnitz:
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. CoRR abs/1907.03850 (2019) - 2018
- [c5]Marc Roth, Johannes Schmitt:
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. IPEC 2018: 24:1-24:14 - [i5]Marc Roth, Johannes Schmitt:
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. CoRR abs/1807.01920 (2018) - 2017
- [c4]Cornelius Brand, Marc Roth:
Parameterized Counting of Trees, Forests and Matroid Bases. CSR 2017: 85-98 - [c3]Marc Roth:
Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices. ESA 2017: 63:1-63:14 - [c2]Radu Curticapean, Holger Dell, Marc Roth:
Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes. STACS 2017: 25:1-25:15 - [i4]Radu Curticapean, Holger Dell, Marc Roth:
Counting edge-injective homomorphisms and matchings on restricted graph classes. CoRR abs/1702.05447 (2017) - [i3]Marc Roth:
Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices. CoRR abs/1706.08414 (2017) - 2016
- [c1]Cornelius Brand, Holger Dell, Marc Roth:
Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. IPEC 2016: 9:1-9:14 - [i2]Cornelius Brand, Holger Dell, Marc Roth:
Fine-grained dichotomies for the Tutte plane and Boolean #CSP. CoRR abs/1606.06581 (2016) - [i1]Cornelius Brand, Marc Roth:
Parameterized counting of trees, forests and matroid bases. CoRR abs/1611.01823 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-11-23 20:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
