Wellnitz, Philip Algorithms and Complexity, MPI for Informatics, Max Planck Society;
https://drops.dagstuhl.de/opus/volltexte/2021/14177/ (Publisher version)
LIPIcs-ICALP-2021-108.pdf (Publisher version), 850KB
Roth, M., Schmitt, J., & Wellnitz, P. (2021). Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. In N. Bansal, E. Merelli, & J. Worrell (Eds.), 48th International Colloquium on Automata, Languages, and Programming (pp. 1-16). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2021.108.