@InProceedings{haviv:LIPIcs.ITCS.2021.4,
author = {Haviv, Ishay},
title = {{The Complexity of Finding Fair Independent Sets in Cycles}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {4:1--4:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.4},
URN = {urn:nbn:de:0030-drops-135431},
doi = {10.4230/LIPIcs.ITCS.2021.4},
annote = {Keywords: Fair independent sets in cycles, the complexity class \{PPA\}, Schrijver graphs}
}