Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness

Marc Roth, Johannes Schmitt. Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. In Christophe Paul, Michal Pilipczuk, editors, 13th International Symposium on Parameterized and Exact Computation, IPEC 2018, August 20-24, 2018, Helsinki, Finland. Volume 115 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

@inproceedings{RothS18-0,
  title = {Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness},
  author = {Marc Roth and Johannes Schmitt},
  year = {2018},
  doi = {10.4230/LIPIcs.IPEC.2018.24},
  url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.24},
  researchr = {https://researchr.org/publication/RothS18-0},
  cites = {0},
  citedby = {0},
  booktitle = {13th International Symposium on Parameterized and Exact Computation, IPEC 2018, August 20-24, 2018, Helsinki, Finland},
  editor = {Christophe Paul and Michal Pilipczuk},
  volume = {115},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-084-2},
}