| 2025 | ECAI | Control by Deleting Players from Weighted Voting Games Is NP | Joanna Kaczmarek, Jrg Rothe |
| 2025 | ECAI | District-Limited Bribery in Multidistrict Apportionment Elections with Threshold. | Joanna Kaczmarek, Jrg Rothe, Tessa Seeger |
| 2025 | HPDC | On Matching in Multipartite Quantum Routers. | Dagmar Bru, Luis Gindorf, Julia Kunzelmann, Christian Laumann, Jrg Rothe |
| 2025 | IJCAI | Control in Computational Social Choice. | Jiehua Chen, Joanna Kaczmarek, Paul Nsken, Jrg Rothe, Ildik Schlotter, Tessa Seeger |
| 2024 | ECAI | Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NP | Joanna Kaczmarek, Jrg Rothe |
| 2024 | ECAI | Complexity and Approximation Schemes for Social Welfare Maximization in the High-Multiplicity Setting. | Trung Thanh Nguyen, Khaled Elbassioni, Jrg Rothe |
| 2024 | IJCAI | Toward Completing the Picture of Control in Schulze and Ranked Pairs Elections. | Cynthia Maushagen, David Niclaus, Paul Nsken, Jrg Rothe, Tessa Seeger |
| 2024 | LATIN | Core Stability in Altruistic Coalition Formation Games. | Matthias Hoffjan, Anna Maria Kerkmann, Jrg Rothe |
| 2024 | SOFSEM | Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode. | Christian Laumann, Jrg Rothe, Tessa Seeger |
| 2023 | ECAI | Complexity of Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games. | Joanna Kaczmarek, Jrg Rothe, Nimrod Talmon |
| 2023 | IJCAI | Complexity Results and Exact Algorithms for Fair Division of Indivisible Items: A Survey. | Trung Thanh Nguyen, Jrg Rothe |
| 2022 | ISAIM | Min-Based Altruism in Coalition Formation Games. | Simon Cramer, Anna Maria Kerkmann, Jrg Rothe |
| 2022 | ISAIM | Controlling Weighted Voting Games by Deleting or Adding Players with or without Changing the Quota. | Joanna Kaczmarek, Jrg Rothe |
| 2022 | IWOCA | Controlling Weighted Voting Games by Deleting or Adding Players with or Without Changing the Quota. | Joanna Kaczmarek, Jrg Rothe |
| 2021 | AAAI | Thou Shalt Love Thy Neighbor as Thyself When Thou Playest: Altruism in Game Theory. | Jrg Rothe |
| 2021 | ECSQARU | Complexity of Nonemptiness in Control Argumentation Frameworks. | Daniel Neugebauer, Jrg Rothe, Kenneth Skiba |
| 2021 | FCT | The Possible Winner Problem with Uncertain Weights Revisited. | Marc Neveling, Jrg Rothe, Robin Weishaupt |
| 2020 | AAAI | Deciding Acceptance in Incomplete Argumentation Frameworks. | Andreas Niskanen, Daniel Neugebauer, Matti Jrvisalo, Jrg Rothe |
| 2020 | CSR | The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters. | Marc Neveling, Jrg Rothe, Roman Zorn |
| 2020 | ECAI | The Last Voting Rule Is Home: Complexity of Control by Partition of Candidates or Voters in Maximin Elections. | Cynthia Maushagen, Jrg Rothe |
| 2020 | ECAI | Complexity of Possible and Necessary Existence Problems in Abstract Argumentation. | Kenneth Skiba, Daniel Neugebauer, Jrg Rothe |
| 2020 | ECAI | Stability in Minimization-Based Altruistic Hedonic Games. | Alessandra Wiechers, Jrg Rothe |
| 2020 | IJCAI | Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types. | Trung Thanh Nguyen, Jrg Rothe |
| 2020 | IJCAI | Altruism in Coalition Formation Games. | Anna Maria Kerkmann, Jrg Rothe |
| 2020 | ISAAC | Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs. | Trung Thanh Nguyen, Jrg Rothe |
| 2020 | ISAAC | Complexity of Stability. | Fabian Frei, Edith Hemaspaandra, Jrg Rothe |
| 2020 | ISAIM | Altruism in Coalition Formation Games. | Anna Maria Kerkmann, Jrg Rothe |
| 2020 | ISAIM | The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters. | Marc Neveling, Jrg Rothe, Roman Zorn |
| 2019 | AAAI | Borda Count in Collective Decision Making: A Summary of Recent Results. | Jrg Rothe |
| 2018 | AAAI | Complexity of Verification in Incomplete Argumentation Frameworks. | Dorothea Baumeister, Daniel Neugebauer, Jrg Rothe, Hilmar Schadrack |
| 2018 | COMMA | Credulous and Skeptical Acceptance in Incomplete Argumentation Frameworks. | Dorothea Baumeister, Daniel Neugebauer, Jrg Rothe |
| 2018 | ISAIM | The Price to Pay for Forgoing Normalization in Fair Division of Indivisible Goods. | Pascal Lange, Nhan-Tam Nguyen, Jrg Rothe |
| 2018 | ISAIM | Complexity of Shift Bribery in Hare, Coombs, Baldwin, and Nanson Elections. | Cynthia Maushagen, Marc Neveling, Jrg Rothe, Ann-Kathrin Selker |
| 2017 | AAAI | Solving Seven Open Problems of Offline and Online Control in Borda Elections. | Marc Neveling, Jrg Rothe |
| 2016 | ECAI | Complexity of Control by Partitioning Veto and Maximin Elections and of Control by Adding Candidates to Plurality Elections. | Cynthia Maushagen, Jrg Rothe |
| 2016 | ISAIM | Complexity of Control by Partitioning Veto and Maximin Elections. | Cynthia Maushagen, Jrg Rothe |
| 2016 | MFCS | Structural Control in Weighted Voting Games. | Anja Rey, Jrg Rothe |
| 2015 | IJCAI | Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods. | Nhan-Tam Nguyen, Dorothea Baumeister, Jrg Rothe |
| 2014 | ECAI | Scoring Rules for the Allocation of Indivisible Goods. | Dorothea Baumeister, Sylvain Bouveret, Jrme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jrg Rothe |
| 2014 | ISAIM | Toward the Complexity of the Existence of Wonderfully Stable Partitions and Strictly Core Stable Coalition Structures in Hedonic Games. | Anja Rey, Jrg Rothe, Hilmar Schadrack, Lena Schend |
| 2014 | LATIN | False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time. | Anja Rey, Jrg Rothe |
| 2013 | TARK | The Complexity of Online Manipulation of Sequential Elections. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2012 | AAMAS | Campaigns for lazy voters: truncated ballots. | Dorothea Baumeister, Piotr Faliszewski, Jrme Lang, Jrg Rothe |
| 2012 | AAMAS | Complexity and approximability of social welfare optimization in multiagent resource allocation. | Nhan-Tam Nguyen, Trung Thanh Nguyen, Magnus Roos, Jrg Rothe |
| 2012 | ECAI | The Possible Winner Problem with Uncertain Weights. | Dorothea Baumeister, Magnus Roos, Jrg Rothe, Lena Schend, Lirong Xia |
| 2012 | ECAI | Online Voter Control in Sequential Elections. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2012 | ECAI | Controlling Candidate-Sequential Elections. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2012 | ECAI | Probabilistic Path-Disruption Games. | Anja Rey, Jrg Rothe |
| 2012 | ISAIM | Exact Optimization of Social Welfare by the Nash Product is DP-Complete. | Nhan-Tam Nguyen, Magnus Roos, Jrg Rothe |
| 2012 | ISAIM | A Survey of Approximability and Inapproximability Results for Social Welfare Optimization in Multiagent Resource Allocation. | Trung Thanh Nguyen, Magnus Roos, Jrg Rothe |
| 2012 | ISAIM | Typical-Case Challenges to Complexity Shields That Are Supposed to Protect Elections Against Manipulation and Control: A Survey. | Jrg Rothe, Lena Schend |
| 2011 | AAAI | How to Calibrate the Scores of Biased Reviewers by Quadratic Programming. | Magnus Roos, Jrg Rothe, Bjrn Scheuermann |
| 2010 | CIAC | The Complexity of Computing Minimal Unidirectional Covering Sets. | Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jrg Rothe |
| 2010 | ECAI | Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. | Dorothea Baumeister, Jrg Rothe |
| 2010 | ECAI | Complexity of Merging and Splitting for the Probabilistic Banzhaf Power Index in Weighted Voting Games. | Anja Rey, Jrg Rothe |
| 2009 | SAGT | The Cost of Stability in Coalitional Games. | Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jrg Rothe, Jeffrey S. Rosenschein |
| 2009 | TARK | The shield that never was: societies with single-peaked preferences are more open to manipulation and control. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2008 | AAIM | Copeland Voting Fully Resists Constructive Control. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2008 | LATA | The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions. | Dorothea Baumeister, Jrg Rothe |
| 2008 | MFCS | Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control. | Gbor Erdlyi, Markus Nowak, Jrg Rothe |
| 2007 | AAAI | Llull and Copeland Voting Broadly Resist Bribery and Control. | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2007 | FCT | On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. | Gbor Erdlyi, Lane A. Hemaspaandra, Jrg Rothe, Holger Spakowski |
| 2007 | IJCAI | Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2007 | MCU | Satisfiability Parsimoniously Reduces to the Tantrix | Dorothea Baumeister, Jrg Rothe |
| 2005 | AAAI | Anyone but Him: The Complexity of Precluding an Alternative. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 2005 | MFCS | An Exact 2.9416 | Tobias Riege, Jrg Rothe |
| 2002 | WG | Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. | Edith Hemaspaandra, Jrg Rothe, Holger Spakowski |
| 2001 | FCT | If P != NP Then Some Strongly Noninvertible Functions Are Invertible. | Lane A. Hemaspaandra, Kari Pasanen, Jrg Rothe |
| 1999 | FCT | Restrictive Acceptance Suffices for Equivalence Problems. | Bernd Borchert, Lane A. Hemaspaandra, Jrg Rothe |
| 1998 | MFCS | Tally NP Sets and Easy Census Functions. | Judy Goldsmith, Mitsunori Ogihara, Jrg Rothe |
| 1998 | MFCS | A Second Step Towards Circuit Complexity-Theoretic Analogs of Rice's Theorem. | Lane A. Hemaspaandra, Jrg Rothe |
| 1997 | CIAC | On Sets with Easy Certificates and the Existence of One-Way Permutations. | Lane A. Hemaspaandra, Jrg Rothe, Gerd Wechsung |
| 1997 | ICALP | Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP. | Edith Hemaspaandra, Lane A. Hemaspaandra, Jrg Rothe |
| 1996 | COCOON | The Join Can Lower Complexity. | Lane A. Hemaspaandra, Zhigen Jiang, Jrg Rothe, Osamu Watanabe |
| 1995 | COCOON | Intersection Suffices for Boolean Hierarchy Equivalence. | Lane A. Hemaspaandra, Jrg Rothe |