Jörg Rothe

4.1k total citations
132 papers, 1.4k citations indexed

About

Jörg Rothe is a scholar working on Economics and Econometrics, Management Science and Operations Research and Computational Theory and Mathematics. According to data from OpenAlex, Jörg Rothe has authored 132 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 73 papers in Economics and Econometrics, 60 papers in Management Science and Operations Research and 58 papers in Computational Theory and Mathematics. Recurrent topics in Jörg Rothe's work include Game Theory and Voting Systems (71 papers), Auction Theory and Applications (49 papers) and Complexity and Algorithms in Graphs (45 papers). Jörg Rothe is often cited by papers focused on Game Theory and Voting Systems (71 papers), Auction Theory and Applications (49 papers) and Complexity and Algorithms in Graphs (45 papers). Jörg Rothe collaborates with scholars based in Germany, United States and Vietnam. Jörg Rothe's co-authors include Lane A. Hemaspaandra, Edith Hemaspaandra, Piotr Faliszewski, Dorothea Baumeister, Trung Thanh Nguyen, Gábor Erdélyi, Holger Spakowski, Jörg Vogel, G. Erdélyi and Markus Nowak and has published in prestigious journals such as Angewandte Chemie International Edition, ACM Computing Surveys and Artificial Intelligence.

In The Last Decade

Jörg Rothe

122 papers receiving 1.3k citations

Peers

Jörg Rothe
Lane A. Hemaspaandra United States
Ehud Lehrer Israel
Edith Hemaspaandra United States
Abraham Neyman Israel
Ron Holzman Israel
Haris Aziz Australia
Ioannis Caragiannis Greece
Nisarg Shah United States
Jerry S. Kelly United States
Eilon Solan Israel
Lane A. Hemaspaandra United States
Jörg Rothe
Citations per year, relative to Jörg Rothe Jörg Rothe (= 1×) peers Lane A. Hemaspaandra

Countries citing papers authored by Jörg Rothe

Since Specialization
Citations

This map shows the geographic impact of Jörg Rothe'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 Jörg Rothe with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jörg Rothe more than expected).

Fields of papers citing papers by Jörg Rothe

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jörg Rothe. 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 Jörg Rothe. The network helps show where Jörg Rothe may publish in the future.

Co-authorship network of co-authors of Jörg Rothe

This figure shows the co-authorship network connecting the top 25 collaborators of Jörg Rothe. A scholar is included among the top collaborators of Jörg Rothe 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 Jörg Rothe. Jörg Rothe 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.
Baumeister, Dorothea, et al.. (2023). The possible winner with uncertain weights problem. Journal of Computer and System Sciences. 138. 103464–103464. 1 indexed citations
2.
Baumeister, Dorothea, et al.. (2021). Acceptance in incomplete argumentation frameworks. Artificial Intelligence. 295. 103470–103470. 25 indexed citations
3.
Baumeister, Dorothea, et al.. (2021). Collective Acceptability in Abstract Argumentation.. 8. 1503–1542. 1 indexed citations
4.
Rothe, Jörg, et al.. (2018). Complexity of Shift Bribery in Iterative Elections. Adaptive Agents and Multi-Agents Systems. 1567–1575. 9 indexed citations
5.
Rothe, Jörg, et al.. (2018). The Price to Pay for Forgoing Normalization in Fair Division of Indivisible Goods.. 1 indexed citations
6.
Rothe, Jörg, et al.. (2017). Complexity of Control by Partition of Voters and of Voter Groups in Veto and Other Scoring Protocols. Adaptive Agents and Multi-Agents Systems. 615–623. 3 indexed citations
7.
Rothe, Jörg, et al.. (2016). Local Fairness in Hedonic Games via Individual Threshold Coalitions. Adaptive Agents and Multi-Agents Systems. 232–241. 2 indexed citations
8.
Rothe, Jörg, et al.. (2016). Altruistic Hedonic Games. Adaptive Agents and Multi-Agents Systems. 251–259. 8 indexed citations
9.
Rothe, Jörg, et al.. (2016). Structural Control in Weighted Voting Games: (Extended Abstract). Adaptive Agents and Multi-Agents Systems. 1371–1372. 1 indexed citations
10.
Rothe, Jörg, et al.. (2014). Toward the Complexity of the Existence of Wonderfully Stable Partitions and Strictly Core Stable Coalition Structures in Hedonic Games.. 1 indexed citations
11.
Rothe, Jörg, et al.. (2014). Bribery in multiple-adversary path-disruption games is hard for the second level of the polynomial hierarchy. Adaptive Agents and Multi-Agents Systems. 1375–1376. 1 indexed citations
12.
Nguyen, Trung Thanh & Jörg Rothe. (2013). Envy-ratio and average-nash social welfare optimization in multiagent resource allocation. Adaptive Agents and Multi-Agents Systems. 1139–1140. 2 indexed citations
13.
Nguyen, Trung Thanh, et al.. (2012). A Survey of Approximability and Inapproximability Results for Social Welfare Optimization in Multiagent Resource Allocation.. 3 indexed citations
14.
Nguyen, Trung Thanh, et al.. (2012). Complexity and approximability of social welfare optimization in multiagent resource allocation. Adaptive Agents and Multi-Agents Systems. 1287–1288. 4 indexed citations
15.
Rothe, Jörg, et al.. (2012). Exact Optimization of Social Welfare by the Nash Product is DP-Complete.. 6 indexed citations
16.
Baumeister, Dorothea, et al.. (2011). Computational complexity of two variants of the possible winner problem. Adaptive Agents and Multi-Agents Systems. 853–860. 15 indexed citations
17.
Lindner, Claudia & Jörg Rothe. (2008). Fixed-Parameter Tractability and Parameterized Complexity Applied to Problems From Computational Social Choice. Research Explorer (The University of Manchester). 1–15. 9 indexed citations
18.
Rothe, Jörg, et al.. (2006). Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey.. JUCS - Journal of Universal Computer Science. 12. 551–578. 4 indexed citations
19.
Erdélyi, Gábor, et al.. (2005). Quantum Cryptography: A Survey. Electronic colloquium on computational complexity. 1 indexed citations
20.
Rothe, Jörg, et al.. (1996). Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems. UR Research (University of Rochester). 3. 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

Breakdown of academic impact, for papers by Lane A. Hemaspaandra Breakdown of academic impact, for papers by Ehud Lehrer Breakdown of academic impact, for papers by Edith Hemaspaandra Breakdown of academic impact, for papers by Abraham Neyman Breakdown of academic impact, for papers by Ron Holzman Breakdown of academic impact, for papers by Haris Aziz Breakdown of academic impact, for papers by Ioannis Caragiannis Breakdown of academic impact, for papers by Nisarg Shah Breakdown of academic impact, for papers by Jerry S. Kelly Breakdown of academic impact, for papers by Eilon Solan
Rankless by CCL
2026