Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski. List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs. In Timothy Chan, Johannes Fischer 0001, John Iacono, Grzegorz Herman, editors, 32nd Annual European Symposium on Algorithms, ESA 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom. Volume 308 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. [doi]
Abstract is missing.