@InProceedings{roth_et_al:LIPIcs.ICALP.2021.108,
author = {Roth, Marc and Schmitt, Johannes and Wellnitz, Philip},
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)},
pages = {108:1--108:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.108},
URN = {urn:nbn:de:0030-drops-141778},
doi = {10.4230/LIPIcs.ICALP.2021.108},
annote = {Keywords: Counting complexity, parameterized complexity, Tutte polynomial}
}