Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness

Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz. Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. In Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen, editors, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany. Volume 138 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

@inproceedings{DorflerRSW19,
  title = {Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness},
  author = {Julian Dörfler and Marc Roth and Johannes Schmitt and Philip Wellnitz},
  year = {2019},
  doi = {10.4230/LIPIcs.MFCS.2019.26},
  url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.26},
  researchr = {https://researchr.org/publication/DorflerRSW19},
  cites = {0},
  citedby = {0},
  booktitle = {44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany},
  editor = {Peter Rossmanith and Pinar Heggernes and Joost-Pieter Katoen},
  volume = {138},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-117-7},
}