Gábor Erdélyi

714 total citations
20 papers, 227 citations indexed

About

Gábor Erdélyi is a scholar working on Economics and Econometrics, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Gábor Erdélyi has authored 20 papers receiving a total of 227 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Economics and Econometrics, 12 papers in Artificial Intelligence and 11 papers in Computational Theory and Mathematics. Recurrent topics in Gábor Erdélyi's work include Game Theory and Voting Systems (15 papers), Complexity and Algorithms in Graphs (8 papers) and Internet Traffic Analysis and Secure E-voting (6 papers). Gábor Erdélyi is often cited by papers focused on Game Theory and Voting Systems (15 papers), Complexity and Algorithms in Graphs (8 papers) and Internet Traffic Analysis and Secure E-voting (6 papers). Gábor Erdélyi collaborates with scholars based in Germany, New Zealand and United States. Gábor Erdélyi's co-authors include Jörg Rothe, Michael R. Fellows, Martin Lackner, Dagmar Bruß, Dorothea Baumeister, Olivia Johanna Erdélyi, Lane A. Hemaspaandra, Edith Elkind, Holger Spakowski and Henning Fernau and has published in prestigious journals such as ACM Computing Surveys, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Gábor Erdélyi

20 papers receiving 221 citations

Peers

Gábor Erdélyi

CTM

MSOR

AMPO

Umberto Grandi France

J.R. Fernández Spain

Joachim Rosenmüller Germany

Holger Spakowski Germany

Dorothea Baumeister Germany

J.J. López Spain

Heinz J. Skala Germany

Oskar Skibski Poland

Jörg Vogel Germany

Svetlana Obraztsova Singapore

Umberto Grandi France

Gábor Erdélyi

105 ×0.6

110 ×0.9

28 ×0.3

CTM

81 ×0.9

MSOR

1 ×0.1

AMPO

Citations per year, relative to Gábor Erdélyi Gábor Erdélyi (= 1×) peers Umberto Grandi

Countries citing papers authored by Gábor Erdélyi

Since Specialization

Citations

This map shows the geographic impact of Gábor Erdélyi'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 Gábor Erdélyi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gábor Erdélyi more than expected).

Fields of papers citing papers by Gábor Erdélyi

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Gábor Erdélyi. 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 Gábor Erdélyi. The network helps show where Gábor Erdélyi may publish in the future.

Co-authorship network of co-authors of Gábor Erdélyi

This figure shows the co-authorship network connecting the top 25 collaborators of Gábor Erdélyi. A scholar is included among the top collaborators of Gábor Erdélyi 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 Gábor Erdélyi. Gábor Erdélyi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Jensen, Klaus Bruhn, Melissa Aronczyk, John Cook, et al.. (2025). Information Integrity about Climate Science: A Systematic Review. 1 indexed citations

Erdélyi, Gábor, et al.. (2021). Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters. Autonomous Agents and Multi-Agent Systems. 35(2). 5 indexed citations

Baumeister, Dorothea, et al.. (2020). Complexity of control in judgment aggregation for uniform premise-based quota rules. Journal of Computer and System Sciences. 112. 13–33. 4 indexed citations

Erdélyi, Gábor, et al.. (2019). Towards Completing the Puzzle: Solving Open Problems for Control in Elections. Adaptive Agents and Multi-Agents Systems. 846–854. 2 indexed citations

Erdélyi, Gábor, et al.. (2019). The complexity of bribery and control in group identification. Autonomous Agents and Multi-Agent Systems. 34(1). 4 indexed citations

Erdélyi, Gábor, et al.. (2017). Computational Aspects of Nearly Single-Peaked Electorates. Journal of Artificial Intelligence Research. 58. 297–337. 11 indexed citations

Briskorn, Dirk, et al.. (2016). Bribery in k-Approval and k-Veto Under Partial Information: (Extended Abstract). Adaptive Agents and Multi-Agents Systems. 1299–1300. 1 indexed citations

Baumeister, Dorothea, Gábor Erdélyi, Olivia Johanna Erdélyi, & Jörg Rothe. (2015). Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules. Mathematical Social Sciences. 76. 19–30. 20 indexed citations

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

10.

Erdélyi, Gábor, et al.. (2014). Control complexity in Bucklin and fallback voting: A theoretical analysis. Journal of Computer and System Sciences. 81(4). 632–660. 23 indexed citations

11.

Erdélyi, Gábor, et al.. (2014). Control complexity in Bucklin and fallback voting: An experimental analysis. Journal of Computer and System Sciences. 81(4). 661–670. 16 indexed citations

12.

Erdélyi, Gábor, et al.. (2013). The complexity of probabilistic lobbying. Discrete Optimization. 11. 1–21. 18 indexed citations

13.

Erdélyi, Gábor, et al.. (2013). Computational Aspects of Nearly Single-Peaked Electorates. Proceedings of the AAAI Conference on Artificial Intelligence. 27(1). 283–289. 21 indexed citations

14.

Elkind, Edith & Gábor Erdélyi. (2012). Manipulation under voting rule uncertainty. Adaptive Agents and Multi-Agents Systems. 627–634. 9 indexed citations

15.

Erdélyi, Gábor, et al.. (2010). Control Complexity in Fallback Voting. arXiv (Cornell University). 20 indexed citations

16.

Erdélyi, Gábor & Michael R. Fellows. (2010). Parameterized control complexity in bucklin voting and in fallback voting. CDU eSpace Institutional Repository (Charles Darwin University). 1–12. 9 indexed citations

17.

Erdélyi, Gábor, Lane A. Hemaspaandra, Jörg Rothe, & Holger Spakowski. (2009). Frequency of correctness versus average polynomial time. Information Processing Letters. 109(16). 946–949. 4 indexed citations

18.

Erdélyi, Gábor, Lane A. Hemaspaandra, Jörg Rothe, & Holger Spakowski. (2009). Generalized juntas and NP-hard sets. Theoretical Computer Science. 410(38-40). 3995–4000. 11 indexed citations

19.

Bruß, Dagmar, et al.. (2007). Quantum cryptography. ACM Computing Surveys. 39(2). 6–6. 40 indexed citations

20.

Erdélyi, Gábor, et al.. (2005). Quantum Cryptography: A Survey. Electronic colloquium on computational complexity. 1 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