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]