Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters

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: Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski

Journal title: 51st International Colloquium on Automata, Languages, and Programming

Journal publisher: LIPICS

Published year: 2024

DOI identifier: 10.4230/lipics.icalp.2024.77