List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Barış Can Esmer, Jacob Focke, Dániel Marx, Paweł Rzążewski

Journal title: 32nd Annual European Symposium on Algorithms, ESA 2024

Journal publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Published year: 2024

DOI identifier: 10.4230/lipics.esa.2024.39