Janosch Fuchs, Philip Whittington. The 2-Attractor Problem Is NP-Complete. In Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov, editors, 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France. Volume 289 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. [doi]
@inproceedings{FuchsW24,
title = {The 2-Attractor Problem Is NP-Complete},
author = {Janosch Fuchs and Philip Whittington},
year = {2024},
doi = {10.4230/LIPIcs.STACS.2024.35},
url = {https://doi.org/10.4230/LIPIcs.STACS.2024.35},
researchr = {https://researchr.org/publication/FuchsW24},
cites = {0},
citedby = {0},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France},
editor = {Olaf Beyersdorff and Mamadou Moustapha Kanté and Orna Kupferman and Daniel Lokshtanov},
volume = {289},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-311-9},
}