Edith Hemaspaandra

3.5k total citations
61 papers, 1.5k citations indexed

About

Edith Hemaspaandra is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Economics and Econometrics. According to data from OpenAlex, Edith Hemaspaandra has authored 61 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 44 papers in Computational Theory and Mathematics, 37 papers in Artificial Intelligence and 32 papers in Economics and Econometrics. Recurrent topics in Edith Hemaspaandra's work include Game Theory and Voting Systems (32 papers), Complexity and Algorithms in Graphs (31 papers) and Internet Traffic Analysis and Secure E-voting (21 papers). Edith Hemaspaandra is often cited by papers focused on Game Theory and Voting Systems (32 papers), Complexity and Algorithms in Graphs (31 papers) and Internet Traffic Analysis and Secure E-voting (21 papers). Edith Hemaspaandra collaborates with scholars based in United States, Germany and Poland. Edith Hemaspaandra's co-authors include Lane A. Hemaspaandra, Piotr Faliszewski, Jörg Rothe, Henning Schnoor, Holger Spakowski, Jörg Vogel, Felix Brandt, Markus Brill, Gerd Wechsung and Alan L. Selman and has published in prestigious journals such as Communications of the ACM, Artificial Intelligence and Journal of the ACM.

In The Last Decade

Edith Hemaspaandra

59 papers receiving 1.4k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Edith Hemaspaandra United States 20 1.1k 791 712 686 113 61 1.5k
Jörg Rothe Germany 20 962 0.9× 656 0.8× 564 0.8× 649 0.9× 123 1.1× 132 1.4k
Lane A. Hemaspaandra United States 22 999 0.9× 959 1.2× 1.0k 1.5× 604 0.9× 185 1.6× 137 1.8k
Piotr Faliszewski Poland 24 1.8k 1.6× 841 1.1× 871 1.2× 1.1k 1.7× 120 1.1× 117 2.1k
Piotr Skowron Poland 18 773 0.7× 220 0.3× 331 0.5× 455 0.7× 68 0.6× 66 929
Arkadii Slinko New Zealand 18 619 0.6× 247 0.3× 434 0.6× 375 0.5× 50 0.4× 111 965
Felix Brandt Germany 18 848 0.8× 275 0.3× 152 0.2× 714 1.0× 69 0.6× 99 1.1k
Ron Holzman Israel 17 518 0.5× 178 0.2× 219 0.3× 504 0.7× 89 0.8× 61 933
William S. Zwicker United States 16 724 0.6× 208 0.3× 153 0.2× 510 0.7× 37 0.3× 41 935
J.M. Bilbao Spain 19 726 0.7× 118 0.1× 205 0.3× 643 0.9× 28 0.2× 45 907
Jerry S. Kelly United States 17 719 0.6× 218 0.3× 135 0.2× 469 0.7× 35 0.3× 86 913

Countries citing papers authored by Edith Hemaspaandra

Since Specialization
Citations

This map shows the geographic impact of Edith Hemaspaandra's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Edith Hemaspaandra with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Edith Hemaspaandra more than expected).

Fields of papers citing papers by Edith Hemaspaandra

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Edith Hemaspaandra. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Edith Hemaspaandra. The network helps show where Edith Hemaspaandra may publish in the future.

Co-authorship network of co-authors of Edith Hemaspaandra

This figure shows the co-authorship network connecting the top 25 collaborators of Edith Hemaspaandra. A scholar is included among the top collaborators of Edith Hemaspaandra based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Edith Hemaspaandra. Edith Hemaspaandra is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Faliszewski, Piotr, Edith Hemaspaandra, & Lane A. Hemaspaandra. (2015). Weighted Electoral Control. Journal of Artificial Intelligence Research. 52. 507–542. 10 indexed citations
2.
Erdélyi, Gábor, Edith Hemaspaandra, & Lane A. Hemaspaandra. (2014). Bribery and voter control under voting-rule uncertainty. Adaptive Agents and Multi-Agents Systems. 61–68. 7 indexed citations
3.
Faliszewski, Piotr, Edith Hemaspaandra, & Lane A. Hemaspaandra. (2013). Weighted electoral control. arXiv (Cornell University). 367–374.
4.
Faliszewski, Piotr, Edith Hemaspaandra, & Lane A. Hemaspaandra. (2013). The complexity of manipulative attacks in nearly single-peaked electorates. Artificial Intelligence. 207. 69–99. 43 indexed citations
5.
Hemaspaandra, Edith, et al.. (2012). Controlling Candidate-Sequential Elections. UR Research (University of Rochester). 1 indexed citations
6.
Faliszewski, Piotr, Edith Hemaspaandra, & Lane A. Hemaspaandra. (2011). Multimode Control Attacks on Elections. Journal of Artificial Intelligence Research. 40. 305–351. 61 indexed citations
7.
Hemaspaandra, Edith & Henning Schnoor. (2011). Minimization for generalized Boolean formulas. arXiv (Cornell University). 566–571. 8 indexed citations
8.
Faliszewski, Piotr, Edith Hemaspaandra, & Henning Schnoor. (2010). Manipulation of copeland elections. Adaptive Agents and Multi-Agents Systems. 367–374. 19 indexed citations
9.
Faliszewski, Piotr, Edith Hemaspaandra, Lane A. Hemaspaandra, & Jörg Rothe. (2010). The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Information and Computation. 209(2). 89–107. 72 indexed citations
10.
Faliszewski, Piotr, Edith Hemaspaandra, & Lane A. Hemaspaandra. (2009). How Hard Is Bribery in Elections?. Journal of Artificial Intelligence Research. 35. 485–532. 126 indexed citations
11.
Faliszewski, Piotr, Edith Hemaspaandra, & Henning Schnoor. (2008). Copeland voting: ties matter. Adaptive Agents and Multi-Agents Systems. 983–990. 64 indexed citations
12.
Faliszewski, Piotr, et al.. (2008). Approximability of manipulating elections. National Conference on Artificial Intelligence. 44–49. 35 indexed citations
13.
Faliszewski, Piotr, Edith Hemaspaandra, Lane A. Hemaspaandra, & Jörg Rothe. (2007). Llull and copeland voting broadly resist bribery and control. National Conference on Artificial Intelligence. 724–730. 38 indexed citations
14.
Hemaspaandra, Edith, Lane A. Hemaspaandra, & Jörg Rothe. (2007). Anyone but him: The complexity of precluding an alternative. Artificial Intelligence. 171(5-6). 255–285. 23 indexed citations
15.
Hemaspaandra, Edith, Lane A. Hemaspaandra, Stanisław Radziszowski, & Rahul Tripathi. (2006). Complexity results in graph reconstruction. Discrete Applied Mathematics. 155(2). 103–118. 2 indexed citations
16.
Hemaspaandra, Edith, Lane A. Hemaspaandra, & Marius Zimand. (2002). Almost-Everywhere Superiority for Quantum Polynomial Time. Information and Computation. 175(2). 171–181. 4 indexed citations
17.
Hemaspaandra, Edith & Lane A. Hemaspaandra. (2000). Computational Politics: Electoral Systems. 5 indexed citations
18.
Hemaspaandra, Edith, Ashish V. Naik, Mitsunori Ogihara, & Alan L. Selman. (1996). P-Selective Sets and Reducing Search to Decision vs Self-Reducibility. Journal of Computer and System Sciences. 53(2). 194–209. 27 indexed citations
19.
Hemaspaandra, Edith. (1994). Complexity Transfer for Modal Logic (Extended Abstract). 164–173. 2 indexed citations
20.
Hemaspaandra, Edith & Lane A. Hemaspaandra. (1994). Quasi-injective reductions. Theoretical Computer Science. 123(2). 407–413. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026