Edith Hemaspaandra

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 47

Top Venues

CoRR

Auton. Agents Multi Agent Syst.

J. Comput. Syst. Sci.

AAAI

Publications

Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner
Finding Optimal Solutions with Neighborly Help. Algorithmica 86 (6) (2024)
Zack Fitzsimmons, Edith Hemaspaandra
Complexity of Conformant Election Manipulation. CoRR (2023)
Zack Fitzsimmons, Edith Hemaspaandra
Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery. ECAI (2023)
Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski
)-Arrowing. CoRR (2023)
Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski
)-Arrowing. FCT (2023)
Zack Fitzsimmons, Edith Hemaspaandra
Complexity of Conformant Election Manipulation. FCT (2023)
Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez
Feedback Tools and Motivation to Persist in Intro CS Theory. SIGCSE (2) (2023)
Zack Fitzsimmons, Edith Hemaspaandra
Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery. CoRR (2023)
Zack Fitzsimmons, Edith Hemaspaandra
Insight into Voting Problem Complexity Using Randomized Classes. IJCAI (2022)
Edith Hemaspaandra, David E. Narváez
Formal Methods for NFA Equivalence: QBFs, Witness Extraction, and Encoding Verification. CICM (2022)
Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez
Effective Succinct Feedback for Intro CS Theory: A JFLAP Extension. SIGCSE (1) (2022)
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
The complexity of online bribery in sequential elections. J. Comput. Syst. Sci. 127 (2022)
Zack Fitzsimmons, Edith Hemaspaandra
Insight into Voting Problem Complexity Using Randomized Classes. CoRR (2022)
Fabian Frei, Edith Hemaspaandra, Jörg Rothe
Complexity of stability. J. Comput. Syst. Sci. 123 (2022)
Zack Fitzsimmons, Edith Hemaspaandra
Kemeny Consensus Complexity. IJCAI (2021)
Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez
Witness Feedback for Introductory CS Theory Assignments. SIGCSE (2021)
Zack Fitzsimmons, Edith Hemaspaandra
Kemeny Consensus Complexity. CoRR (2021)
Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton
Search versus Decision for Election Manipulation Problems. ACM Trans. Comput. Theory 12 (1) (2020)
Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
Correction to: Control in the presence of manipulators: cooperative and competitive cases. Auton. Agents Multi Agent Syst. 34 (2) (2020)
Ivona Bezáková, Edith Hemaspaandra, Aryeh Lieberman, Hannah Miller, David E. Narváez
Prototype of an Automated Feedback Tool for Intro CS Theory. SIGCSE (2020)
Fabian Frei, Edith Hemaspaandra, Jörg Rothe
Complexity of Stability. ISAAC (2020)
Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez
Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence. CoRR (2020)
Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. Comput. Complex. 29 (2) (2020)
Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
Control in the presence of manipulators: cooperative and competitive cases. Auton. Agents Multi Agent Syst. 34 (2) (2020)
Zack Fitzsimmons, Edith Hemaspaandra
Election Score Can Be Harder than Winner. ECAI (2020)
Zack Fitzsimmons, Edith Hemaspaandra
High-multiplicity election problems. Auton. Agents Multi Agent Syst. 33 (4) (2019)
Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover, David E. Narváez
Very Hard Electoral Control Problems. AAAI (2019)
Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner
Finding Optimal Solutions With Neighborly Help. MFCS (2019)
Fabian Frei, Edith Hemaspaandra, Jörg Rothe
Complexity of Stability. CoRR (2019)
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
The Complexity of Online Bribery in Sequential Elections (Extended Abstract). TARK (2019)
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
The Complexity of Online Bribery in Sequential Elections. CoRR (2019)
Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner
Finding Optimal Solutions With Neighborly Help. CoRR (2019)
Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover, David E. Narváez
Very Hard Electoral Control Problems. CoRR (2018)
Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. MFCS (2018)
Zack Fitzsimmons, Edith Hemaspaandra
Election Score Can Be Harder Than Winner. CoRR (2018)
Zack Fitzsimmons, Edith Hemaspaandra
High-Multiplicity Election Problems. AAMAS (2018)
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
The complexity of controlling candidate-sequential elections. Theor. Comput. Sci. 678 (2017)
Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. CoRR (2017)
Edith Hemaspaandra, Lane A. Hemaspaandra
Credimus. CoRR (2017)
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
The complexity of online voter control in sequential elections. Auton. Agents Multi Agent Syst. 31 (5) (2017)
Zack Fitzsimmons, Edith Hemaspaandra
The Complexity of Succinct Elections. AAAI (2017)
Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
Manipulation Complexity of Same-System Runoff Elections. Ann. Math. Artif. Intell. 77 (3-4) (2016)
Edith Hemaspaandra, Henning Schnoor
Complexity Dichotomies for Unweighted Scoring Rules. CoRR (2016)
Zack Fitzsimmons, Edith Hemaspaandra
Modeling Single-Peakedness for Votes with Ties. STAIRS (2016)
Zack Fitzsimmons, Edith Hemaspaandra
The Complexity of Succinct Elections. CoRR (2016)
Zack Fitzsimmons, Edith Hemaspaandra
Modeling Single-Peakedness for Votes with Ties. CoRR (2016)
Edith Hemaspaandra, Henning Schnoor
Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions. ECAI (2016)
Zack Fitzsimmons, Edith Hemaspaandra
Complexity of Manipulative Actions When Voting with Ties. ADT (2015)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract). IJCAI (2015)
Zack Fitzsimmons, Edith Hemaspaandra
Complexity of Manipulative Actions When Voting with Ties. CoRR (2015)
Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
More Natural Models of Electoral Control by Partition. ADT (2015)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
Weighted Electoral Control. J. Artif. Intell. Res. 52 (2015)
Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. J. Artif. Intell. Res. 53 (2015)
Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
Bribery and voter control under voting-rule uncertainty. AAMAS (2014)
Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
More Natural Models of Electoral Control by Partition. CoRR (2014)
Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor
A Control Dichotomy for Pure Scoring Rules. CoRR (2014)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
The complexity of manipulative attacks in nearly single-peaked electorates. Artif. Intell. 207 (2014)
Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor
A Control Dichotomy for Pure Scoring Rules. AAAI (2014)
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
The complexity of online manipulation of sequential elections. J. Comput. Syst. Sci. 80 (4) (2014)
Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
X THEN X: Manipulation of Same-System Runoff Elections CoRR (2013)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
Weighted Electoral Control CoRR (2013)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
A Richer Understanding of the Complexity of Election Systems. Fundamental Problems in Computing (2013)
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
The Complexity of Online Manipulation of Sequential Elections. CoRR (2013)
Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
Control in the Presence of Manipulators: Cooperative and Competitive Cases. CoRR (2013)
Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton
Search versus Decision for Election Manipulation Problems. STACS (2013)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
Weighted electoral control. AAMAS (2013)
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
The Complexity of Online Manipulation of Sequential Elections. TARK (2013)
Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra
Control in the Presence of Manipulators: Cooperative and Competitive Cases. IJCAI (2013)
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
Online Voter Control in Sequential Elections CoRR (2012)
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
Controlling Candidate-Sequential Elections. ECAI (2012)
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
Online Voter Control in Sequential Elections. ECAI (2012)
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
Controlling Candidate-Sequential Elections CoRR (2012)
Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton
Search versus Decision for Election Manipulation Problems CoRR (2012)
Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor
Weighted Manipulation for Four-Candidate Llull Is Easy. ECAI (2012)
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
The Complexity of Online Manipulation of Sequential Elections CoRR (2012)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Inf. Comput. 209 (2) (2011)
Edith Hemaspaandra, Henning Schnoor
A Simplest Undecidable Modal Logic CoRR (2011)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
The complexity of manipulative attacks in nearly single-peaked electorates. TARK (2011)
Edith Hemaspaandra, Henning Schnoor
A Universally Defined Undecidable Unimodal Logic. MFCS (2011)
Edith Hemaspaandra, Henning Schnoor
Minimization for Generalized Boolean Formulas CoRR (2011)
Edith Hemaspaandra, Henning Schnoor
Minimization for Generalized Boolean Formulas. IJCAI (2011)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
Multimode Control Attacks on Elections. J. Artif. Intell. Res. 40 (2011)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates CoRR (2011)
Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
Generalized modal satisfiability. J. Comput. Syst. Sci. 76 (7) (2010)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
Using complexity to protect elections. Commun. ACM 53 (11) (2010)
Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe
On the complexity of kings. Theor. Comput. Sci. 411 (4-5) (2010)
Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor
Manipulation of copeland elections. AAMAS (2010)
Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. AAAI (2010)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
Multimode Control Attacks on Elections CoRR (2010)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control CoRR (2009)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
The shield that never was: societies with single-peaked preferences are more open to manipulation and control. TARK (2009)
Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. Math. Log. Q. 55 (4) (2009)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. J. Artif. Intell. Res. 35 (2009)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
Multimode Control Attacks on Elections. IJCAI (2009)
Michael Bauland, Edith Hemaspaandra
Isomorphic Implication. Theory Comput. Syst. 44 (1) (2009)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
How Hard Is Bribery in Elections? J. Artif. Intell. Res. 35 (2009)
Edith Hemaspaandra, Henning Schnoor
On the Complexity of Elementary Modal Logics CoRR (2008)
Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
Generalized Modal Satisfiability CoRR (2008)
Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor
Copeland voting: ties matter. AAMAS (2) (2008)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
Llull and Copeland Voting Computationally Resist Bribery and Control CoRR (2008)

Edith Hemaspaandra.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Edith Hemaspaandra