Go to the corresponding LIPIcs Volume Portal 
Larose, Benoît ; Marković, Petar ; Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani ; Živný, Stanislav
pdfformat: 

@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:158:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772044}, ISSN = {18688969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14639}, URN = {urn:nbn:de:0030drops146392}, doi = {10.4230/LIPIcs.ESA.2021.58}, annote = {Keywords: computational complexity, algorithmic graph theory, quantified constraints, universal algebra, constraint satisfaction} }
Keywords:  computational complexity, algorithmic graph theory, quantified constraints, universal algebra, constraint satisfaction  
Collection:  29th Annual European Symposium on Algorithms (ESA 2021)  
Issue Date:  2021  
Date of publication:  31.08.2021 