\n \n \n
\n
\n\n \n \n \n \n \n Search versus Search for Collapsing Electoral Control Types.\n \n \n \n\n\n \n Carleton, B.; Chavrimootoo, M.; Hemaspaandra, L.; Narváez, D.; Taliancich, C.; and Welles, H.\n\n\n \n\n\n\n
Theory of Computing Systems, 70(44): 1–28. 2026.\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{car-cha-hem-nar-tal-wel:j:s-vs-s, \r\n author = {B. Carleton and M. Chavrimootoo and L. Hemaspaandra and D. Narv\\'{a}ez and C. Taliancich and H. Welles},\r\n title = {Search versus Search for Collapsing Electoral Control Types},\r\n Year="2026",\r\n journal=tocs,\r\n volume = {70},\r\n number = {44},\r\n pages = {1--28},\r\n}\r\n\r\n\r\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Linked Fates: How Small of an Ambiguity Increase Can Make the Difference Between Equaling and Separating from P\\@?.\n \n \n \n \n\n\n \n B. Carleton; M. Chavrimootoo; L. Hemaspaandra; D. Narváez; C. Taliancich; and M. Welsh\n\n\n \n\n\n\n Technical Report arXiv:2606.20399 [cs.CC], Computing Research Repository, arXiv.org/corr/, June 2026.\n
\n\n
\n\n
\n\n
\n\n \n \n
link\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@techreport{car-cha-hem-nar-tal-wel:t:linked-fates,\r\n Author = {B.~Carleton and M.~Chavrimootoo and L.~Hemaspaandra and D.~Narv\\'{a}ez and C.~Taliancich and M.~Welsh},\r\n title = {Linked Fates: How Small of an Ambiguity Increase Can Make \r\n\t\tthe Difference Between Equaling and Separating from {P}\\@?},\r\n Month = jun,\r\n Year = "2026",\r\n Institution = "Computing Research Repository",\r\n Number = "arXiv:2606.20399 [cs.CC]",\r\n Address = {arXiv.org/corr/},\r\n url_link = {https://arxiv.org/abs/2606.20399}\r\n}\r\n\r\n\r\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Approximating Electoral Control Problems (Extended Abstract).\n \n \n \n \n\n\n \n Bui, H.; Chavrimootoo, M.; Le, K.; and Nguyen, S.\n\n\n \n\n\n\n In
Proceedings of the 25th International Conference on Autonomous Agents and Multiagent Systems, pages 3347-3349, May 2026. International Foundation for Autonomous Agents and Multiagent Systems\n
\n\n
\n\n
\n\n
\n\n \n \n
link\n \n \n \n
poster\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{bui-cha-le-ngu:c-ea:approx-control,\r\n\tauthor = {H. Bui and M. Chavrimootoo and K. Le and S. Nguyen},\r\n\ttitle = {Approximating Electoral Control Problems (Extended Abstract)},\r\n\tyear = {2026},\r\n\tbooktitle=aamas26,\r\n\tpages = {3347-3349},\r\n\tmonth = may, \r\n \tpublisher = ifaamas,\r\n\turl_Link = {https://www.ifaamas.org/Proceedings/aamas2026/pdfs/GEOD7219.pdf},\r\n\turl_Poster = {archival/aamas2026-approx-poster.pdf}\r\n}\r\n\r\n\r\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Approximating Electoral Control Problems.\n \n \n \n\n\n \n H. Bui; M. Chavrimootoo; K. Le; and S. Nguyen\n\n\n \n\n\n\n In
Proceedings of the 9th International Conference on Algorithmic Decision Theory, November 2026. Springer-Verlag Lecture Notes in Artificial Intelligence.\n
To appear.\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@inproceedings{bui-cha-le-ngu:c:approximating-control,\r\n author = {H.~Bui and M.~Chavrimootoo and K.~Le and S.~Nguyen},\r\n title = {Approximating Electoral Control Problems},\r\n booktitle= adt26,\r\n Year = "2026",\r\n note="To appear.",\r\n xpages = "396--413", \r\n month=nov,\r\n publisher={Springer-Verlag {Lecture Notes in Artificial Intelligence}.},\r\n keywords={mypaper},\r\n}\r\n\r\n\r\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles.\n \n \n \n\n\n \n M. Chavrimootoo; and J. Youn\n\n\n \n\n\n\n In
Proceedings of the 20th International Conference on Reachability Problems, October 2026. Springer-Verlag Lecture Notes in Computer Science.\n
To appear.\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@inproceedings{cha-you:c:carrying,\r\n\tauthor={M.~Chavrimootoo and J.~Youn},\r\n\ttitle={Carrying is Hard: {Exploring} the Gap between Hardness for {NP} and {PSPACE} for the {Hanano} and {Jelly} no Puzzles}, \r\n booktitle=rp26,\r\n note="To appear.",\r\n\tyear={2026},\r\n\tmonth=oct,\r\n publisher={Springer-Verlag {Lecture Notes in Computer Science}.},\r\n\tkeywords={mypaper}\r\n}\r\n\r\n\n
\n\n\n\n
\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n The Cost of Failure: On The Complexity of Recampaigning under Fixed Districts.\n \n \n \n\n\n \n M. Chavrimootoo; and A. Jeansonne\n\n\n \n\n\n\n In
Proceedings of the 9th International Conference on Algorithmic Decision Theory, November 2026. Springer-Verlag Lecture Notes in Artificial Intelligence.\n
To appear.\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@inproceedings{cha-jea:c:crc,\r\n author = {M.~Chavrimootoo and A.~Jeansonne},\r\n title = {The Cost of Failure: On The Complexity of Recampaigning under Fixed Districts},\r\n booktitle= adt26,\r\n Year = "2026",\r\n note="To appear.",\r\n xpages = "396--413", \r\n month=nov,\r\n publisher={Springer-Verlag {Lecture Notes in Artificial Intelligence}.},\r\n keywords={mypaper},\r\n }\r\n\r\n\r\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n The Cost of Failure: On The Complexity of Recampaigning under Fixed Districts.\n \n \n \n \n\n\n \n Chavrimootoo, M.; and Jeansonne, A.\n\n\n \n\n\n\n Technical Report arXiv:2601.13246 [cs.GT], Computing Research Repository, arXiv.org/corr/, January 2026.\n
\n\n
\n\n
\n\n
\n\n \n \n
link\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@techreport{cha-jea:t:recampaigning,\r\n Author = {M. Chavrimootoo and A. Jeansonne},\r\n title = {The Cost of Failure: {On} The Complexity of Recampaigning under Fixed Districts},\r\n Month = jan,\r\n Year = "2026",\r\n Institution = "Computing Research Repository",\r\n Number = "arXiv:2601.13246 [cs.GT]",\r\n Address = {arXiv.org/corr/},\r\n url_link = {https://arxiv.org/abs/2601.13246}\r\n}\r\n\r\n\r\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles.\n \n \n \n \n\n\n \n Chavrimootoo, M.; and Youn, J.\n\n\n \n\n\n\n Technical Report arXiv:2601.08057 [cs.CC], Computing Research Repository, arXiv.org/corr/, January 2026.\n
\n\n
\n\n
\n\n
\n\n \n \n
link\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@techreport{cha-you:t:carrying-hard,\r\n Author = {M. Chavrimootoo and J. Youn},\r\n title = {Carrying is Hard: {Exploring} the Gap between Hardness for {NP} and {PSPACE} for the {Hanano} and {Jelly} no Puzzles},\r\n Month = jan,\r\n Year = "2026",\r\n Institution = "Computing Research Repository",\r\n Number = "arXiv:2601.08057 [cs.CC]",\r\n Address = {arXiv.org/corr/},\r\n url_link = {https://arxiv.org/abs/2601.08057}\r\n}\r\n\r\n\n
\n\n\n\n
\n\n\n\n\n\n