@InCollection{larose:DFU.Vol7.15301.267,
author = {Larose, Benoit},
title = {{Algebra and the Complexity of Digraph CSPs: a Survey}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {267--285},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.267},
URN = {urn:nbn:de:0030-drops-69677},
doi = {10.4230/DFU.Vol7.15301.267},
annote = {Keywords: Constraint satisfaction problems, Polymorphisms, Digraphs}
}