Wellnitz, Philip Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Dörfler2021_Article_CountingInducedSubgraphsAnAlge.pdf (Publisher version), 384KB
Dörfler, J., Roth, M., Schmitt, J., & Wellnitz, P. (2021). Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. Algorithmica. doi:10.1007/s00453-021-00894-9.