@InProceedings{larose_et_al:LIPIcs.ESA.2021.58,
  author =	{Larose, Beno\^{i}t and Markovi\'{c}, Petar and Martin, Barnaby and Paulusma, Dani\"{e}l and Smith, Siani and \v{Z}ivn\'{y}, Stanislav},
  title =	{{QCSP on Reflexive Tournaments}},
  booktitle =	{29th Annual European Symposium on Algorithms (ESA 2021)},
  pages =	{58:1--58:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-204-4},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{204},
  editor =	{Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.58},
  URN =		{urn:nbn:de:0030-drops-146392},
  doi =		{10.4230/LIPIcs.ESA.2021.58},
  annote =	{Keywords: computational complexity, algorithmic graph theory, quantified constraints, universal algebra, constraint satisfaction}
}