by Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
Reference:
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-WidthRobert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France (Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff, eds.), volume 229 of LIPIcs, pages 66:1–66:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Bibtex Entry:
@string{lipics="LIPIcs"}
@inproceedings{GanianHKOS22,
author = {Robert Ganian and
Thekla Hamm and
Viktoriia Korchemna and
Karolina Okrasa and
Kirill Simonov},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {The Fine-Grained Complexity of Graph Homomorphism Parameterized by
Clique-Width},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {66:1--66:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {10.4230/LIPIcs.ICALP.2022.66">https://doi.org/10.4230/LIPIcs.ICALP.2022.66},
doi = {10.4230/LIPIcs.ICALP.2022.66},
keywords = {nfpc,ParAI}
}