Marc Roth, Philip Wellnitz. Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory. In Shuchi Chawla 0001, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. pages 2161-2180, SIAM, 2020. [doi]
@inproceedings{RothW20, title = {Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory}, author = {Marc Roth and Philip Wellnitz}, year = {2020}, doi = {10.1137/1.9781611975994.133}, url = {https://doi.org/10.1137/1.9781611975994.133}, researchr = {https://researchr.org/publication/RothW20}, cites = {0}, citedby = {0}, pages = {2161-2180}, booktitle = {Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020}, editor = {Shuchi Chawla 0001}, publisher = {SIAM}, isbn = {978-1-61197-599-4}, }