| 2026 | MFCS | The Complexity of Edge-Induced Greedy Subgraph Building Algorithms Within P. | Zohair Raza Hassan, Edith Hemaspaandra |
| 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 |
| 2023 | FCT | The Complexity of (P | Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski |
| 2023 | SIGCSE | Feedback Tools and Motivation to Persist in Intro CS Theory. | Ivona Bezkov, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narvez |
| 2022 | IJCAI | Insight into Voting Problem Complexity Using Randomized Classes. | Zack Fitzsimmons, Edith Hemaspaandra |
| 2022 | SIGCSE | Effective Succinct Feedback for Intro CS Theory: A JFLAP Extension. | Ivona Bezkov, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narvez |
| 2021 | IJCAI | Kemeny Consensus Complexity. | Zack Fitzsimmons, Edith Hemaspaandra |
| 2021 | SIGCSE | Witness Feedback for Introductory CS Theory Assignments. | Ivona Bezkov, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narvez |
| 2020 | ECAI | Election Score Can Be Harder than Winner. | Zack Fitzsimmons, Edith Hemaspaandra |
| 2020 | ISAAC | Complexity of Stability. | Fabian Frei, Edith Hemaspaandra, Jrg Rothe |
| 2020 | SIGCSE | Prototype of an Automated Feedback Tool for Intro CS Theory. | Ivona Bezkov, Edith Hemaspaandra, Aryeh Lieberman, Hannah Miller, David E. Narvez |
| 2019 | AAAI | Very Hard Electoral Control Problems. | Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover, David E. Narvez |
| 2019 | MFCS | Finding Optimal Solutions With Neighborly Help. | Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner |
| 2018 | MFCS | The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. | Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe |
| 2017 | AAAI | The Complexity of Succinct Elections. | Zack Fitzsimmons, Edith Hemaspaandra |
| 2016 | ECAI | Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions. | Edith Hemaspaandra, Henning Schnoor |
| 2015 | IJCAI | The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract). | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2014 | AAAI | A Control Dichotomy for Pure Scoring Rules. | Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor |
| 2013 | IJCAI | Control in the Presence of Manipulators: Cooperative and Competitive Cases. | Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2013 | STACS | Search versus Decision for Election Manipulation Problems. | Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton |
| 2013 | TARK | The Complexity of Online Manipulation of Sequential Elections. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2012 | ECAI | Weighted Manipulation for Four-Candidate Llull Is Easy. | Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor |
| 2012 | ECAI | Online Voter Control in Sequential Elections. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2012 | ECAI | Controlling Candidate-Sequential Elections. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2011 | IJCAI | Minimization for Generalized Boolean Formulas. | Edith Hemaspaandra, Henning Schnoor |
| 2011 | MFCS | A Universally Defined Undecidable Unimodal Logic. | Edith Hemaspaandra, Henning Schnoor |
| 2011 | TARK | The complexity of manipulative attacks in nearly single-peaked electorates. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2010 | AAAI | Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. | Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2009 | IJCAI | Multimode Control Attacks on Elections. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2009 | TARK | The shield that never was: societies with single-peaked preferences are more open to manipulation and control. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2008 | AAAI | Approximability of Manipulating Elections. | Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor |
| 2008 | AAIM | Copeland Voting Fully Resists Constructive Control. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2008 | STACS | On the Complexity of Elementary Modal Logics. | Edith Hemaspaandra, Henning Schnoor |
| 2007 | AAAI | Llull and Copeland Voting Broadly Resist Bribery and Control. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2007 | FCT | On the Complexity of Kings. | Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe |
| 2007 | IJCAI | Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2006 | AAAI | The Complexity of Bribery in Elections. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2006 | STACS | Generalized Modal Satisfiability. | Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor |
| 2005 | AAAI | Anyone but Him: The Complexity of Precluding an Alternative. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2005 | MFCS | Isomorphic Implication. | Michael Bauland, Edith Hemaspaandra |
| 2004 | LATIN | Complexity of Cycle Length Modularity Problems in Graphs. | Edith Hemaspaandra, Holger Spakowski, Mayur Thakur |
| 2004 | MFCS | All Superlinear Inverse Schemes Are coNP-Hard. | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
| 2004 | MFCS | Complexity Results in Graph Reconstruction. | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi |
| 2004 | STACS | The Complexity of Boolean Constraint Isomorphism. | Elmar Bhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer |
| 2002 | CSL | Equivalence and Isomorphism for Boolean Constraint Satisfaction. | Elmar Bhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer |
| 2002 | WG | Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. | Edith Hemaspaandra, Jrg Rothe, Holger Spakowski |
| 2000 | CSL | Modal Satisfiability Is in Deterministic Linear Space. | Edith Hemaspaandra |
| 2000 | MFCS | Computational Politics: Electoral Systems. | Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2000 | STACS | The Complexity of Poor Man's Logic. | Edith Hemaspaandra |
| 1999 | STACS | Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
| 1997 | CIAC | R | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
| 1997 | FCT | Query Order in the Polynomial Hierarchy. | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
| 1997 | FOCS | The Minimization Problem for Boolean Formulas. | Edith Hemaspaandra, Gerd Wechsung |
| 1997 | ICALP | Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 1997 | STACS | A Downward Translation in the Polynomial Hierarchy. | Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel |
| 1994 | LICS | Complexity Transfer for Modal Logic (Extended Abstract) | Edith Hemaspaandra |