Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

BibTeX records: Marc Roth

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Persons > Marc Roth

download as .bib file

@article{DBLP:journals/algorithmica/GoldbergR24,
  author       = {Leslie Ann Goldberg and
                  Marc Roth},
  title        = {Parameterised and Fine-Grained Subgraph Counting, Modulo 2},
  journal      = {Algorithmica},
  volume       = {86},
  number       = {4},
  pages        = {944--1005},
  year         = {2024},
  url          = {https://doi.org/10.1007/s00453-023-01178-0},
  doi          = {10.1007/S00453-023-01178-0},
  timestamp    = {Mon, 08 Apr 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GoldbergR24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/FockeR24,
  author       = {Jacob Focke and
                  Marc Roth},
  title        = {Counting Small Induced Subgraphs with Hereditary Properties},
  journal      = {{SIAM} J. Comput.},
  volume       = {53},
  number       = {2},
  pages        = {189--220},
  year         = {2024},
  url          = {https://doi.org/10.1137/22m1512211},
  doi          = {10.1137/22M1512211},
  timestamp    = {Mon, 01 Apr 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/FockeR24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/PeyerimhoffRSSVW23,
  author       = {Norbert Peyerimhoff and
                  Marc Roth and
                  Johannes Schmitt and
                  Jakob Stix and
                  Alina Vdovina and
                  Philip Wellnitz},
  title        = {Parameterized Counting and Cayley Graph Expanders},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {37},
  number       = {2},
  pages        = {405--486},
  year         = {2023},
  url          = {https://doi.org/10.1137/22m1479804},
  doi          = {10.1137/22M1479804},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/PeyerimhoffRSSVW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/GoldbergR23,
  author       = {Leslie Ann Goldberg and
                  Marc Roth},
  editor       = {Kousha Etessami and
                  Uriel Feige and
                  Gabriele Puppis},
  title        = {Parameterised and Fine-Grained Subgraph Counting, Modulo 2},
  booktitle    = {50th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
  series       = {LIPIcs},
  volume       = {261},
  pages        = {68:1--68:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2023.68},
  doi          = {10.4230/LIPICS.ICALP.2023.68},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/GoldbergR23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/innovations/0002GMR23,
  author       = {Marco Bressan and
                  Leslie Ann Goldberg and
                  Kitty Meeks and
                  Marc Roth},
  editor       = {Yael Tauman Kalai},
  title        = {Counting Subgraphs in Somewhere Dense Graphs},
  booktitle    = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
  series       = {LIPIcs},
  volume       = {251},
  pages        = {27:1--27:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2023.27},
  doi          = {10.4230/LIPICS.ITCS.2023.27},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/innovations/0002GMR23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/0002LR23,
  author       = {Marco Bressan and
                  Matthias Lanzinger and
                  Marc Roth},
  editor       = {Barna Saha and
                  Rocco A. Servedio},
  title        = {The Complexity of Pattern Counting in Directed Graphs, Parameterised
                  by the Outdegree},
  booktitle    = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
                  {STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
  pages        = {542--552},
  publisher    = {{ACM}},
  year         = {2023},
  url          = {https://doi.org/10.1145/3564246.3585204},
  doi          = {10.1145/3564246.3585204},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/0002LR23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2301-01696,
  author       = {Leslie Ann Goldberg and
                  Marc Roth},
  title        = {Parameterised and Fine-grained Subgraph Counting, modulo 2},
  journal      = {CoRR},
  volume       = {abs/2301.01696},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2301.01696},
  doi          = {10.48550/ARXIV.2301.01696},
  eprinttype    = {arXiv},
  eprint       = {2301.01696},
  timestamp    = {Tue, 10 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2301-01696.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2303-08118,
  author       = {Leslie Ann Goldberg and
                  Marc Roth and
                  Tassilo Constantin Schwarz},
  title        = {Parameterised Approximation of the Fixation Probability of the Dominant
                  Mutation in the Multi-Type Moran Process},
  journal      = {CoRR},
  volume       = {abs/2303.08118},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2303.08118},
  doi          = {10.48550/ARXIV.2303.08118},
  eprinttype    = {arXiv},
  eprint       = {2303.08118},
  timestamp    = {Mon, 20 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2303-08118.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2310-19006,
  author       = {Andreas G{\"{o}}bel and
                  Leslie Ann Goldberg and
                  Marc Roth},
  title        = {The Weisfeiler-Leman Dimension of Existential Conjunctive Queries},
  journal      = {CoRR},
  volume       = {abs/2310.19006},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2310.19006},
  doi          = {10.48550/ARXIV.2310.19006},
  eprinttype    = {arXiv},
  eprint       = {2310.19006},
  timestamp    = {Thu, 02 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2310-19006.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2311-10634,
  author       = {Jacob Focke and
                  Leslie Ann Goldberg and
                  Marc Roth and
                  Stanislav Zivn{\'{y}}},
  title        = {Counting Answers to Unions of Conjunctive Queries: Natural Tractability
                  Criteria and Meta-Complexity},
  journal      = {CoRR},
  volume       = {abs/2311.10634},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2311.10634},
  doi          = {10.48550/ARXIV.2311.10634},
  eprinttype    = {arXiv},
  eprint       = {2311.10634},
  timestamp    = {Wed, 22 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2311-10634.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DorflerRSW22,
  author       = {Julian D{\"{o}}rfler and
                  Marc Roth and
                  Johannes Schmitt and
                  Philip Wellnitz},
  title        = {Counting Induced Subgraphs: An Algebraic Approach to {\#}W[1]-Hardness},
  journal      = {Algorithmica},
  volume       = {84},
  number       = {2},
  pages        = {379--404},
  year         = {2022},
  url          = {https://doi.org/10.1007/s00453-021-00894-9},
  doi          = {10.1007/S00453-021-00894-9},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DorflerRSW22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/pods/FockeGRZ22,
  author       = {Jacob Focke and
                  Leslie Ann Goldberg and
                  Marc Roth and
                  Stanislav Zivn{\'{y}}},
  editor       = {Leonid Libkin and
                  Pablo Barcel{\'{o}}},
  title        = {Approximately Counting Answers to Conjunctive Queries with Disequalities
                  and Negations},
  booktitle    = {{PODS} '22: International Conference on Management of Data, Philadelphia,
                  PA, USA, June 12 - 17, 2022},
  pages        = {315--324},
  publisher    = {{ACM}},
  year         = {2022},
  url          = {https://doi.org/10.1145/3517804.3526231},
  doi          = {10.1145/3517804.3526231},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/pods/FockeGRZ22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/FockeR22,
  author       = {Jacob Focke and
                  Marc Roth},
  editor       = {Stefano Leonardi and
                  Anupam Gupta},
  title        = {Counting small induced subgraphs with hereditary properties},
  booktitle    = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
                  Rome, Italy, June 20 - 24, 2022},
  pages        = {1543--1551},
  publisher    = {{ACM}},
  year         = {2022},
  url          = {https://doi.org/10.1145/3519935.3520008},
  doi          = {10.1145/3519935.3520008},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/FockeR22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2209-03402,
  author       = {Marco Bressan and
                  Leslie Ann Goldberg and
                  Kitty Meeks and
                  Marc Roth},
  title        = {Counting Subgraphs in Somewhere Dense Graphs},
  journal      = {CoRR},
  volume       = {abs/2209.03402},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2209.03402},
  doi          = {10.48550/ARXIV.2209.03402},
  eprinttype    = {arXiv},
  eprint       = {2209.03402},
  timestamp    = {Mon, 26 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2209-03402.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2211-01905,
  author       = {Marco Bressan and
                  Matthias Lanzinger and
                  Marc Roth},
  title        = {The Complexity of Pattern Counting in Directed Graphs, Parameterised
                  by the Outdegree},
  journal      = {CoRR},
  volume       = {abs/2211.01905},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2211.01905},
  doi          = {10.48550/ARXIV.2211.01905},
  eprinttype    = {arXiv},
  eprint       = {2211.01905},
  timestamp    = {Fri, 04 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2211-01905.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Roth21,
  author       = {Marc Roth},
  title        = {Parameterized Counting of Partially Injective Homomorphisms},
  journal      = {Algorithmica},
  volume       = {83},
  number       = {6},
  pages        = {1829--1860},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00453-021-00805-y},
  doi          = {10.1007/S00453-021-00805-Y},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Roth21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/FockeGRZ21,
  author       = {Jacob Focke and
                  Leslie Ann Goldberg and
                  Marc Roth and
                  Stanislav Zivn{\'{y}}},
  title        = {Counting Homomorphisms to K\({}_{\mbox{4}}\)-Minor-Free Graphs, Modulo
                  2},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {35},
  number       = {4},
  pages        = {2749--2814},
  year         = {2021},
  url          = {https://doi.org/10.1137/20M1382921},
  doi          = {10.1137/20M1382921},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamdm/FockeGRZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/0002R21,
  author       = {Marco Bressan and
                  Marc Roth},
  title        = {Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms,
                  Hardness Results, and Complexity Dichotomies},
  booktitle    = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2021, Denver, CO, USA, February 7-10, 2022},
  pages        = {276--285},
  publisher    = {{IEEE}},
  year         = {2021},
  url          = {https://doi.org/10.1109/FOCS52979.2021.00036},
  doi          = {10.1109/FOCS52979.2021.00036},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/0002R21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/Roth0W21,
  author       = {Marc Roth and
                  Johannes Schmitt and
                  Philip Wellnitz},
  editor       = {Nikhil Bansal and
                  Emanuela Merelli and
                  James Worrell},
  title        = {Detecting and Counting Small Subgraphs, and Evaluating a Parameterized
                  Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph
                  Expanders},
  booktitle    = {48th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {198},
  pages        = {108:1--108:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2021.108},
  doi          = {10.4230/LIPICS.ICALP.2021.108},
  timestamp    = {Tue, 15 Feb 2022 07:54:27 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/Roth0W21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/PeyerimhoffR0SV21,
  author       = {Norbert Peyerimhoff and
                  Marc Roth and
                  Johannes Schmitt and
                  Jakob Stix and
                  Alina Vdovina},
  editor       = {Filippo Bonchi and
                  Simon J. Puglisi},
  title        = {Parameterized (Modular) Counting and Cayley Graph Expanders},
  booktitle    = {46th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
  series       = {LIPIcs},
  volume       = {202},
  pages        = {84:1--84:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2021.84},
  doi          = {10.4230/LIPICS.MFCS.2021.84},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/mfcs/PeyerimhoffR0SV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/FockeGRZ21,
  author       = {Jacob Focke and
                  Leslie Ann Goldberg and
                  Marc Roth and
                  Stanislav Zivn{\'{y}}},
  editor       = {D{\'{a}}niel Marx},
  title        = {Counting Homomorphisms to \emph{K}\({}_{\mbox{4}}\)-minor-free Graphs,
                  modulo 2},
  booktitle    = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2021, Virtual Conference, January 10 - 13, 2021},
  pages        = {2303--2314},
  publisher    = {{SIAM}},
  year         = {2021},
  url          = {https://doi.org/10.1137/1.9781611976465.137},
  doi          = {10.1137/1.9781611976465.137},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/FockeGRZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2103-05588,
  author       = {Marco Bressan and
                  Marc Roth},
  title        = {Counting homomorphisms, subgraphs, and induced subgraphs in degenerate
                  graphs: new hardness results and complete complexity classifications},
  journal      = {CoRR},
  volume       = {abs/2103.05588},
  year         = {2021},
  url          = {https://arxiv.org/abs/2103.05588},
  eprinttype    = {arXiv},
  eprint       = {2103.05588},
  timestamp    = {Tue, 16 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2103-05588.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2103-12468,
  author       = {Jacob Focke and
                  Leslie Ann Goldberg and
                  Marc Roth and
                  Stanislav Zivn{\'{y}}},
  title        = {Approximately Counting Answers to Conjunctive Queries with Disequalities
                  and Negations},
  journal      = {CoRR},
  volume       = {abs/2103.12468},
  year         = {2021},
  url          = {https://arxiv.org/abs/2103.12468},
  eprinttype    = {arXiv},
  eprint       = {2103.12468},
  timestamp    = {Tue, 06 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2103-12468.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2104-14596,
  author       = {Norbert Peyerimhoff and
                  Marc Roth and
                  Johannes Schmitt and
                  Jakob Stix and
                  Alina Vdovina},
  title        = {Parameterized (Modular) Counting and Cayley Graph Expanders},
  journal      = {CoRR},
  volume       = {abs/2104.14596},
  year         = {2021},
  url          = {https://arxiv.org/abs/2104.14596},
  eprinttype    = {arXiv},
  eprint       = {2104.14596},
  timestamp    = {Tue, 04 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2104-14596.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2111-02277,
  author       = {Jacob Focke and
                  Marc Roth},
  title        = {Counting Small Induced Subgraphs with Hereditary Properties},
  journal      = {CoRR},
  volume       = {abs/2111.02277},
  year         = {2021},
  url          = {https://arxiv.org/abs/2111.02277},
  eprinttype    = {arXiv},
  eprint       = {2111.02277},
  timestamp    = {Fri, 05 Nov 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2111-02277.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/RothS20,
  author       = {Marc Roth and
                  Johannes Schmitt},
  title        = {Counting Induced Subgraphs: {A} Topological Approach to {\#}W[1]-hardness},
  journal      = {Algorithmica},
  volume       = {82},
  number       = {8},
  pages        = {2267--2291},
  year         = {2020},
  url          = {https://doi.org/10.1007/s00453-020-00676-9},
  doi          = {10.1007/S00453-020-00676-9},
  timestamp    = {Fri, 14 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/RothS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/pacmpl/ForsterKR20,
  author       = {Yannick Forster and
                  Fabian Kunze and
                  Marc Roth},
  title        = {The weak call-by-value {\(\lambda\)}-calculus is reasonable for both
                  time and space},
  journal      = {Proc. {ACM} Program. Lang.},
  volume       = {4},
  number       = {{POPL}},
  pages        = {27:1--27:23},
  year         = {2020},
  url          = {https://doi.org/10.1145/3371095},
  doi          = {10.1145/3371095},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/pacmpl/ForsterKR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/Roth0W20,
  author       = {Marc Roth and
                  Johannes Schmitt and
                  Philip Wellnitz},
  editor       = {Sandy Irani},
  title        = {Counting Small Induced Subgraphs Satisfying Monotone Properties},
  booktitle    = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2020, Durham, NC, USA, November 16-19, 2020},
  pages        = {1356--1367},
  publisher    = {{IEEE}},
  year         = {2020},
  url          = {https://doi.org/10.1109/FOCS46700.2020.00128},
  doi          = {10.1109/FOCS46700.2020.00128},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Roth0W20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/RothW20,
  author       = {Marc Roth and
                  Philip Wellnitz},
  editor       = {Shuchi Chawla},
  title        = {Counting and Finding Homomorphisms is Universal for Parameterized
                  Complexity Theory},
  booktitle    = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  pages        = {2161--2180},
  publisher    = {{SIAM}},
  year         = {2020},
  url          = {https://doi.org/10.1137/1.9781611975994.133},
  doi          = {10.1137/1.9781611975994.133},
  timestamp    = {Thu, 15 Jul 2021 13:48:53 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/RothW20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2004-06595,
  author       = {Marc Roth and
                  Johannes Schmitt and
                  Philip Wellnitz},
  title        = {Counting Small Induced Subgraphs Satisfying Monotone Properties},
  journal      = {CoRR},
  volume       = {abs/2004.06595},
  year         = {2020},
  url          = {https://arxiv.org/abs/2004.06595},
  eprinttype    = {arXiv},
  eprint       = {2004.06595},
  timestamp    = {Tue, 21 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2004-06595.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2006-16632,
  author       = {Jacob Focke and
                  Leslie Ann Goldberg and
                  Marc Roth and
                  Stanislav Zivn{\'{y}}},
  title        = {Counting Homomorphisms to K\({}_{\mbox{4}}\)-minor-free Graphs, modulo
                  2},
  journal      = {CoRR},
  volume       = {abs/2006.16632},
  year         = {2020},
  url          = {https://arxiv.org/abs/2006.16632},
  eprinttype    = {arXiv},
  eprint       = {2006.16632},
  timestamp    = {Mon, 03 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2006-16632.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2011-03433,
  author       = {Marc Roth and
                  Johannes Schmitt and
                  Philip Wellnitz},
  title        = {Detecting and Counting Small Subgraphs, and Evaluating a Parameterized
                  Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph
                  Expanders},
  journal      = {CoRR},
  volume       = {abs/2011.03433},
  year         = {2020},
  url          = {https://arxiv.org/abs/2011.03433},
  eprinttype    = {arXiv},
  eprint       = {2011.03433},
  timestamp    = {Thu, 12 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2011-03433.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/de/Roth19,
  author       = {Marc Roth},
  title        = {Counting problems on quantum graphs},
  school       = {Saarland University, Germany},
  year         = {2019},
  url          = {https://d-nb.info/1191755622},
  timestamp    = {Wed, 22 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/phd/de/Roth19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BrandDR19,
  author       = {Cornelius Brand and
                  Holger Dell and
                  Marc Roth},
  title        = {Fine-Grained Dichotomies for the Tutte Plane and Boolean {\#}CSP},
  journal      = {Algorithmica},
  volume       = {81},
  number       = {2},
  pages        = {541--556},
  year         = {2019},
  url          = {https://doi.org/10.1007/s00453-018-0472-z},
  doi          = {10.1007/S00453-018-0472-Z},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BrandDR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/CurticapeanDR19,
  author       = {Radu Curticapean and
                  Holger Dell and
                  Marc Roth},
  title        = {Counting Edge-injective Homomorphisms and Matchings on Restricted
                  Graph Classes},
  journal      = {Theory Comput. Syst.},
  volume       = {63},
  number       = {5},
  pages        = {987--1026},
  year         = {2019},
  url          = {https://doi.org/10.1007/s00224-018-9893-y},
  doi          = {10.1007/S00224-018-9893-Y},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/CurticapeanDR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/DellRW19,
  author       = {Holger Dell and
                  Marc Roth and
                  Philip Wellnitz},
  editor       = {Christel Baier and
                  Ioannis Chatzigiannakis and
                  Paola Flocchini and
                  Stefano Leonardi},
  title        = {Counting Answers to Existential Questions},
  booktitle    = {46th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2019, July 9-12, 2019, Patras, Greece},
  series       = {LIPIcs},
  volume       = {132},
  pages        = {113:1--113:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2019.113},
  doi          = {10.4230/LIPICS.ICALP.2019.113},
  timestamp    = {Tue, 27 Dec 2022 09:06:31 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/DellRW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/DorflerRSW19,
  author       = {Julian D{\"{o}}rfler and
                  Marc Roth and
                  Johannes Schmitt and
                  Philip Wellnitz},
  editor       = {Peter Rossmanith and
                  Pinar Heggernes and
                  Joost{-}Pieter Katoen},
  title        = {Counting Induced Subgraphs: An Algebraic Approach to {\#}W[1]-hardness},
  booktitle    = {44th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
  series       = {LIPIcs},
  volume       = {138},
  pages        = {26:1--26:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2019.26},
  doi          = {10.4230/LIPICS.MFCS.2019.26},
  timestamp    = {Wed, 16 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/DorflerRSW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1902-04960,
  author       = {Holger Dell and
                  Marc Roth and
                  Philip Wellnitz},
  title        = {Counting Answers to Existential Questions},
  journal      = {CoRR},
  volume       = {abs/1902.04960},
  year         = {2019},
  url          = {http://arxiv.org/abs/1902.04960},
  eprinttype    = {arXiv},
  eprint       = {1902.04960},
  timestamp    = {Tue, 21 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1902-04960.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1902-07515,
  author       = {Yannick Forster and
                  Fabian Kunze and
                  Marc Roth},
  title        = {The Weak Call-By-Value {\(\lambda\)}-Calculus is Reasonable for Both
                  Time and Space},
  journal      = {CoRR},
  volume       = {abs/1902.07515},
  year         = {2019},
  url          = {http://arxiv.org/abs/1902.07515},
  eprinttype    = {arXiv},
  eprint       = {1902.07515},
  timestamp    = {Tue, 21 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1902-07515.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1904-10479,
  author       = {Julian D{\"{o}}rfler and
                  Marc Roth and
                  Johannes Schmitt and
                  Philip Wellnitz},
  title        = {Counting Induced Subgraphs: An Algebraic Approach to {\#}W[1]-hardness},
  journal      = {CoRR},
  volume       = {abs/1904.10479},
  year         = {2019},
  url          = {http://arxiv.org/abs/1904.10479},
  eprinttype    = {arXiv},
  eprint       = {1904.10479},
  timestamp    = {Wed, 16 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-10479.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1907-03850,
  author       = {Marc Roth and
                  Philip Wellnitz},
  title        = {Counting and Finding Homomorphisms is Universal for Parameterized
                  Complexity Theory},
  journal      = {CoRR},
  volume       = {abs/1907.03850},
  year         = {2019},
  url          = {http://arxiv.org/abs/1907.03850},
  eprinttype    = {arXiv},
  eprint       = {1907.03850},
  timestamp    = {Wed, 17 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1907-03850.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwpec/RothS18,
  author       = {Marc Roth and
                  Johannes Schmitt},
  editor       = {Christophe Paul and
                  Michal Pilipczuk},
  title        = {Counting Induced Subgraphs: {A} Topological Approach to {\#}W[1]-hardness},
  booktitle    = {13th International Symposium on Parameterized and Exact Computation,
                  {IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
  series       = {LIPIcs},
  volume       = {115},
  pages        = {24:1--24:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.IPEC.2018.24},
  doi          = {10.4230/LIPICS.IPEC.2018.24},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/RothS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1807-01920,
  author       = {Marc Roth and
                  Johannes Schmitt},
  title        = {Counting Induced Subgraphs: {A} Topological Approach to {\#}W[1]-hardness},
  journal      = {CoRR},
  volume       = {abs/1807.01920},
  year         = {2018},
  url          = {http://arxiv.org/abs/1807.01920},
  eprinttype    = {arXiv},
  eprint       = {1807.01920},
  timestamp    = {Wed, 16 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1807-01920.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/csr/BrandR17,
  author       = {Cornelius Brand and
                  Marc Roth},
  editor       = {Pascal Weil},
  title        = {Parameterized Counting of Trees, Forests and Matroid Bases},
  booktitle    = {Computer Science - Theory and Applications - 12th International Computer
                  Science Symposium in Russia, {CSR} 2017, Kazan, Russia, June 8-12,
                  2017, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10304},
  pages        = {85--98},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-58747-9\_10},
  doi          = {10.1007/978-3-319-58747-9\_10},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/csr/BrandR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esa/Roth17,
  author       = {Marc Roth},
  editor       = {Kirk Pruhs and
                  Christian Sohler},
  title        = {Counting Restricted Homomorphisms via M{\"{o}}bius Inversion
                  over Matroid Lattices},
  booktitle    = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
                  4-6, 2017, Vienna, Austria},
  series       = {LIPIcs},
  volume       = {87},
  pages        = {63:1--63:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2017.63},
  doi          = {10.4230/LIPICS.ESA.2017.63},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/Roth17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/CurticapeanDR17,
  author       = {Radu Curticapean and
                  Holger Dell and
                  Marc Roth},
  editor       = {Heribert Vollmer and
                  Brigitte Vall{\'{e}}e},
  title        = {Counting Edge-Injective Homomorphisms and Matchings on Restricted
                  Graph Classes},
  booktitle    = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
                  2017, March 8-11, 2017, Hannover, Germany},
  series       = {LIPIcs},
  volume       = {66},
  pages        = {25:1--25:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2017.25},
  doi          = {10.4230/LIPICS.STACS.2017.25},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/CurticapeanDR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/CurticapeanDR17,
  author       = {Radu Curticapean and
                  Holger Dell and
                  Marc Roth},
  title        = {Counting edge-injective homomorphisms and matchings on restricted
                  graph classes},
  journal      = {CoRR},
  volume       = {abs/1702.05447},
  year         = {2017},
  url          = {http://arxiv.org/abs/1702.05447},
  eprinttype    = {arXiv},
  eprint       = {1702.05447},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/CurticapeanDR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Roth17,
  author       = {Marc Roth},
  title        = {Counting Restricted Homomorphisms via M{\"{o}}bius Inversion
                  over Matroid Lattices},
  journal      = {CoRR},
  volume       = {abs/1706.08414},
  year         = {2017},
  url          = {http://arxiv.org/abs/1706.08414},
  eprinttype    = {arXiv},
  eprint       = {1706.08414},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Roth17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwpec/BrandDR16,
  author       = {Cornelius Brand and
                  Holger Dell and
                  Marc Roth},
  editor       = {Jiong Guo and
                  Danny Hermelin},
  title        = {Fine-Grained Dichotomies for the Tutte Plane and Boolean {\#}CSP},
  booktitle    = {11th International Symposium on Parameterized and Exact Computation,
                  {IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
  series       = {LIPIcs},
  volume       = {63},
  pages        = {9:1--9:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.IPEC.2016.9},
  doi          = {10.4230/LIPICS.IPEC.2016.9},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/BrandDR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BrandDR16,
  author       = {Cornelius Brand and
                  Holger Dell and
                  Marc Roth},
  title        = {Fine-grained dichotomies for the Tutte plane and Boolean {\#}CSP},
  journal      = {CoRR},
  volume       = {abs/1606.06581},
  year         = {2016},
  url          = {http://arxiv.org/abs/1606.06581},
  eprinttype    = {arXiv},
  eprint       = {1606.06581},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BrandDR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BrandR16,
  author       = {Cornelius Brand and
                  Marc Roth},
  title        = {Parameterized counting of trees, forests and matroid bases},
  journal      = {CoRR},
  volume       = {abs/1611.01823},
  year         = {2016},
  url          = {http://arxiv.org/abs/1611.01823},
  eprinttype    = {arXiv},
  eprint       = {1611.01823},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BrandR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

a service of

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.