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