| 2026 | SIGCSE | A Taste of Formal Methods for Computer Science Students using Jupyter Notebooks. | Zack Fitzsimmons, Zohair Raza Hassan, Edith Hemaspaandra, Carlos R. Rivero |
| 2025 | ECAI | On the Parallelizability of Approval-Based Committee Rules. | Zack Fitzsimmons, Zohair Raza Hassan, Edith Hemaspaandra |
| 2023 | ECAI | Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery. | Zack Fitzsimmons, Edith Hemaspaandra |
| 2023 | FCT | Complexity of Conformant Election Manipulation. | Zack Fitzsimmons, Edith Hemaspaandra |
| 2022 | IJCAI | Insight into Voting Problem Complexity Using Randomized Classes. | Zack Fitzsimmons, Edith Hemaspaandra |
| 2021 | AAAI | Representative Proxy Voting. | Elliot Anshelevich, Zack Fitzsimmons, Rohit Vaish, Lirong Xia |
| 2021 | IJCAI | Kemeny Consensus Complexity. | Zack Fitzsimmons, Edith Hemaspaandra |
| 2020 | ECAI | Election Score Can Be Harder than Winner. | Zack Fitzsimmons, Edith Hemaspaandra |
| 2020 | IJCAI | Selecting Voting Locations for Fun and Profit. | Zack Fitzsimmons, Omer Lev |
| 2019 | AAAI | Very Hard Electoral Control Problems. | Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover, David E. Narvez |
| 2017 | AAAI | The Complexity of Succinct Elections. | Zack Fitzsimmons, Edith Hemaspaandra |
| 2015 | AAAI | Realistic Assumptions for Attacks on Elections. | Zack Fitzsimmons |
| 2013 | IJCAI | Control in the Presence of Manipulators: Cooperative and Competitive Cases. | Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra |