World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
32
Citations
4505
World Ranking
13158
National Ranking
5285

Overview

Edith Hemaspaandra is affiliated with the Rochester Institute of Technology in the United States. Their research primarily focuses on topics intersecting computer science, with particular emphasis on artificial intelligence, computational theory and mathematics, economics and econometrics, management science and operations research, and information systems.

Their scholarly output covers a range of main topics, including:

  • Internet Traffic Analysis and Secure E-voting
  • Game Theory and Voting Systems
  • Auction Theory and Applications
  • Complexity and Algorithms in Graphs
  • Advanced Graph Theory Research
  • Software Engineering Research
  • Teaching and Learning Programming

Edith Hemaspaandra has published extensively, with a total of 46 works categorized under computer science. Notable recent papers include:

  • Control in the presence of manipulators: cooperative and competitive cases, 2020, Autonomous Agents and Multi-Agent Systems
  • Search versus Decision for Election Manipulation Problems, 2020, ACM Transactions on Computation Theory
  • Insight into Voting Problem Complexity Using Randomized Classes, 2022, Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence
  • Effective Succinct Feedback for Intro CS Theory, 2022, Proceedings of the 53rd ACM Technical Symposium on Computer Science Education
  • The Robustness of LWPP and WPP, with an Application to Graph Reconstruction, 2020, Computational Complexity

Frequently appearing publication venues for their work include:

  • arXiv (Cornell University)
  • Journal of Computer and System Sciences
  • Autonomous Agents and Multi-Agent Systems
  • Zenodo (CERN European Organization for Nuclear Research)
  • ACM Transactions on Computation Theory

Edith Hemaspaandra collaborates regularly with a core group of coauthors, including:

  • Zack Fitzsimmons
  • Lane A. Hemaspaandra
  • David E. Narváez
  • Zohair Raza Hassan
  • Ivona Bezáková

Best Publications

  • How hard is bribery in elections

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

  • Anyone but him: The complexity of precluding an alternative

    Edith Hemaspaandra;Lane A. Hemaspaandra;Jörg Rothe

  • Llull and Copeland voting computationally resist bribery and constructive control

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra;Jörg Rothe

  • Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP

    Edith Hemaspaandra;Lane A. Hemaspaandra;Jörg Rothe

  • The complexity of Kemeny elections

    Edith Hemaspaandra;Holger Spakowski;Jörg Vogel

  • Using complexity to protect elections

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

  • Multimode control attacks on elections

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

  • The shield that never was: Societies with single-peaked preferences are more open to manipulation and control

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra;Jörg Rothe

  • Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates

    Felix Brandt;Markus Brill;Edith Hemaspaandra;Lane A. Hemaspaandra

  • Dichotomy for voting systems

    Edith Hemaspaandra;Lane A. Hemaspaandra

  • A Richer Understanding of the Complexity of Election Systems

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra;Joerg Rothe

  • Copeland voting: ties matter

    Piotr Faliszewski;Edith Hemaspaandra;Henning Schnoor

  • The complexity of bribery in elections

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

  • A modal perspective on the computational complexity of attribute value grammar

    Patrick Blackburn;Edith Spaan

  • The complexity of manipulative attacks in nearly single-peaked electorates

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

  • The Price of Universality

    Edith Hemaspaandra

  • Hybrid Elections Broaden Complexity‐Theoretic Resistance to Control

    Edith Hemaspaandra;Lane A. Hemaspaandra;Jörg Rothe

  • Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates

    Felix Brandt;Markus Brill;Edith Hemaspaandra;Lane A. Hemaspaandra

  • Computational Aspects of Approval Voting

    Dorothea Baumeister;Gábor Erdélyi;Edith Hemaspaandra;Lane A. Hemaspaandra

  • The Complexity of Poor Man's Logic

    Edith Hemaspaandra

  • P-Selective Sets and Reducing Search to Decision vs Self-Reducibility

    Edith Hemaspaandra;Ashish V. Naik;Mitsunori Ogihara;Alan L. Selman

  • The complexity of manipulative attacks in nearly single-peaked electorates

    Piotr Faliszewski;Edith Hemaspaandra;Lane A. Hemaspaandra

Frequent Co-Authors

Lane A. Hemaspaandra
Lane A. Hemaspaandra University of Rochester
Jörg Rothe
Jörg Rothe Heinrich Heine University Düsseldorf
Piotr Faliszewski
Piotr Faliszewski AGH University of Science and Technology
Osamu Watanabe
Osamu Watanabe Tokyo Institute of Technology
Felix Brandt
Felix Brandt Technical University of Munich
Mitsunori Ogihara
Mitsunori Ogihara University of Miami
Harry Buhrman
Harry Buhrman University of Amsterdam
Alan L. Selman
Alan L. Selman University at Buffalo, State University of New York

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

If you’re interested in studying Computer Science in the USA, it’s important to consider a range of related online degrees and career pathways. Many students explore interdisciplinary options to deepen their expertise and improve job prospects. For those passionate about sustainability, you might wonder what can you get with an environmental science degree—a path that can be closely tied to computing through data analysis and environmental modeling.

Flexible study options are also growing in popularity, such as earning an accelerated computer science degree online. These programs allow you to graduate faster and enter the job market more quickly.

Beyond computer science, branches like engineering are increasingly pursued online. If you’re considering tackling real-world challenges, exploring an environmental engineering online degree could be a smart next step.

Concerned about tuition costs? Take a practical look at mechanical engineering degree cost to compare with other programs and make an informed decision.

Choosing the right online degree can greatly expand your career options in technology, engineering, and science.

Best Scientists Citing Edith Hemaspaandra

Trending Scientists