Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{haviv:LIPIcs.ITCS.2021.4, author = {Ishay Haviv}, title = {{The Complexity of Finding Fair Independent Sets in Cycles}}, booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)}, pages = {4:14:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771771}, ISSN = {18688969}, year = {2021}, volume = {185}, editor = {James R. Lee}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13543}, URN = {urn:nbn:de:0030drops135431}, doi = {10.4230/LIPIcs.ITCS.2021.4}, annote = {Keywords: Fair independent sets in cycles, the complexity class \{PPA\}, Schrijver graphs} }
Keywords:  Fair independent sets in cycles, the complexity class {PPA}, Schrijver graphs  
Collection:  12th Innovations in Theoretical Computer Science Conference (ITCS 2021)  
Issue Date:  2021  
Date of publication:  04.02.2021 