@InProceedings{tencate_et_al:LIPIcs.ICDT.2024.8,
author = {ten Cate, Balder and Dalmau, Victor and Kolaitis, Phokion G. and Wu, Wei-Lin},
title = {{When Do Homomorphism Counts Help in Query Algorithms?}},
booktitle = {27th International Conference on Database Theory (ICDT 2024)},
pages = {8:1--8:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-312-6},
ISSN = {1868-8969},
year = {2024},
volume = {290},
editor = {Cormode, Graham and Shekelyan, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2024.8},
URN = {urn:nbn:de:0030-drops-197905},
doi = {10.4230/LIPIcs.ICDT.2024.8},
annote = {Keywords: query algorithms, homomorphism, homomorphism counts, conjunctive query, constraint satisfaction}
}