default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJörg Rothe
Person information
- affiliation: University of Düsseldorf, Germany
Other persons with a similar name
- Jörg Maier-Rothe
- Joerg Rothe — ETH Zurich, Bio Engineering Laboratory, Basel, Switzerland
SPARQL queries 
🛈 Please note that only 64% of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j92]Joanna Kaczmarek, Jörg Rothe, Nimrod Talmon:
Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games. J. Artif. Intell. Res. 82 (2025)- 2024
- [j91]Anna Maria Kerkmann, Jörg Rothe:
The complexity of verifying popularity and strict popularity in altruistic hedonic games. Auton. Agents Multi Agent Syst. 38(2): 47 (2024) - [j90]Judy Goldsmith, Jörg Rothe:
Coalition formation games - preface. Ann. Math. Artif. Intell. 92(3): 535-537 (2024) - [j89]Anna Maria Kerkmann
, Simon Cramer, Jörg Rothe:
Altruism in coalition formation games. Ann. Math. Artif. Intell. 92(3): 601-629 (2024) - [j88]Joanna Kaczmarek, Jörg Rothe:
Controlling weighted voting games by deleting or adding players with or without changing the quota. Ann. Math. Artif. Intell. 92(3): 631-669 (2024) - [j87]Frank Gurski, Jörg Rothe, Robin Weishaupt:
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes. Theory Comput. Syst. 68(1): 75-102 (2024) - [c122]Garo Karh Bet, Jörg Rothe, Roman Zorn:
Complexity of Candidate Control for Single Nontransferable Vote and Bloc Voting. ADT 2024: 3-17 - [c121]Joanna Kaczmarek, Jörg Rothe:
NPPP-Completeness of Control by Adding Players to Change the Penrose-Banzhaf Power Index in Weighted Voting Games. AAMAS 2024: 2318-2320 - [c120]Trung Thanh Nguyen, Khaled Elbassioni, Jörg Rothe:
Complexity and Approximation Schemes for Social Welfare Maximization in the High-Multiplicity Setting. ECAI 2024: 3324-3331 - [c119]Joanna Kaczmarek, Jörg Rothe:
Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NPPP. ECAI 2024: 3525-3532 - [c118]Cynthia Maushagen, David Niclaus, Paul Nüsken, Jörg Rothe, Tessa Seeger:
Toward Completing the Picture of Control in Schulze and Ranked Pairs Elections. IJCAI 2024: 2940-2948 - [c117]Matthias Hoffjan, Anna Maria Kerkmann, Jörg Rothe:
Core Stability in Altruistic Coalition Formation Games. LATIN (2) 2024: 320-333 - [c116]Christian Laußmann, Jörg Rothe, Tessa Seeger:
Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode. SOFSEM 2024: 355-368 - [i65]Cynthia Maushagen, David Niclaus, Paul Nüsken, Jörg Rothe, Tessa Seeger:
Toward Completing the Picture of Control in Schulze and Ranked Pairs Elections. CoRR abs/2405.08956 (2024) - [i64]Joanna Kaczmarek, Jörg Rothe:
Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NPPP. CoRR abs/2408.09953 (2024) - 2023
- [j86]Trung Thanh Nguyen, Jörg Rothe:
Fair and efficient allocation with few agent types, few item types, or small value levels. Artif. Intell. 314: 103820 (2023) - [j85]Dorothea Baumeister, Marc Neveling, Magnus Roos, Jörg Rothe, Lena Schend, Robin Weishaupt, Lirong Xia:
The possible winner with uncertain weights problem. J. Comput. Syst. Sci. 138: 103464 (2023) - [c115]Joanna Kaczmarek, Jörg Rothe, Nimrod Talmon:
Complexity of Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games. ECAI 2023: 1190-1197 - [c114]Trung Thanh Nguyen, Jörg Rothe:
Complexity Results and Exact Algorithms for Fair Division of Indivisible Items: A Survey. IJCAI 2023: 6732-6740 - [i63]Anna Maria Kerkmann, Simon Cramer, Jörg Rothe:
Altruism in Coalition Formation Games. CoRR abs/2301.05674 (2023) - 2022
- [j84]Cynthia Maushagen, Marc Neveling, Jörg Rothe, Ann-Kathrin Selker:
Complexity of shift bribery for iterative voting rules. Ann. Math. Artif. Intell. 90(10): 1017-1054 (2022) - [j83]Anna Maria Kerkmann, Nhan-Tam Nguyen, Anja Rey, Lisa Rey, Jörg Rothe, Lena Schend, Alessandra Wiechers:
Altruistic Hedonic Games. J. Artif. Intell. Res. 75 (2022) - [j82]Fabian Frei, Edith Hemaspaandra, Jörg Rothe:
Complexity of stability. J. Comput. Syst. Sci. 123: 103-121 (2022) - [j81]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of online bribery in sequential elections. J. Comput. Syst. Sci. 127: 66-90 (2022) - [c113]Ulrik Brandes, Christian Laußmann, Jörg Rothe:
Voting for Centrality. AAMAS 2022: 1554-1556 - [c112]Anna Maria Kerkmann, Jörg Rothe:
Popularity and Strict Popularity in Altruistic Hedonic Games and Minimum-Based Altruistic Hedonic Games. AAMAS 2022: 1657-1659 - [c111]Simon Cramer, Anna Maria Kerkmann, Jörg Rothe:
Min-Based Altruism in Coalition Formation Games. ISAIM 2022 - [c110]Joanna Kaczmarek, Jörg Rothe:
Controlling Weighted Voting Games by Deleting or Adding Players with or without Changing the Quota. ISAIM 2022 - [c109]Joanna Kaczmarek, Jörg Rothe:
Controlling Weighted Voting Games by Deleting or Adding Players with or Without Changing the Quota. IWOCA 2022: 355-368 - [e3]Dorothea Baumeister, Jörg Rothe:
Multi-Agent Systems - 19th European Conference, EUMAS 2022, Düsseldorf, Germany, September 14-16, 2022, Proceedings. Lecture Notes in Computer Science 13442, Springer 2022, ISBN 978-3-031-20613-9 [contents] - 2021
- [j80]Gábor Erdélyi, Marc Neveling, Christian Reger, Jörg Rothe, Yongjie Yang, Roman Zorn:
Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters. Auton. Agents Multi Agent Syst. 35(2): 41 (2021) - [j79]Dorothea Baumeister, Matti Järvisalo, Daniel Neugebauer, Andreas Niskanen, Jörg Rothe:
Acceptance in incomplete argumentation frameworks. Artif. Intell. 295: 103470 (2021) - [j78]Marc Neveling, Jörg Rothe:
Control complexity in Borda elections: Solving all open cases of offline control and some cases of online control. Artif. Intell. 298: 103508 (2021) - [j77]Kenneth Skiba, Daniel Neugebauer, Jörg Rothe:
Complexity of Nonempty Existence Problems in Incomplete Argumentation Frameworks. IEEE Intell. Syst. 36(2): 13-24 (2021) - [j76]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe:
Collective Acceptability in Abstract Argumentation. FLAP 8(6): 1503-1542 (2021) - [j75]Trung Thanh Nguyen, Jörg Rothe:
Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints. Theor. Comput. Sci. 858: 35-48 (2021) - [j74]Anna Maria Kerkmann, Nhan-Tam Nguyen, Jörg Rothe:
Local fairness in hedonic games via individual threshold coalitions. Theor. Comput. Sci. 877: 1-17 (2021) - [c108]Jörg Rothe:
Thou Shalt Love Thy Neighbor as Thyself When Thou Playest: Altruism in Game Theory. AAAI 2021: 15070-15077 - [c107]Joanna Kaczmarek, Jörg Rothe:
Manipulation in Communication Structures of Graph-Restricted Weighted Voting Games. ADT 2021: 194-208 - [c106]Daniel Neugebauer, Jörg Rothe, Kenneth Skiba:
Complexity of Nonemptiness in Control Argumentation Frameworks. ECSQARU 2021: 117-129 - [c105]Marc Neveling, Jörg Rothe, Robin Weishaupt:
The Possible Winner Problem with Uncertain Weights Revisited. FCT 2021: 399-412 - [c104]Robin Weishaupt, Jörg Rothe:
Stability of Special Graph Classes. ICTCS 2021: 234-248 - [i62]Robin Weishaupt, Jörg Rothe:
Stability of Special Graph Classes. CoRR abs/2106.01496 (2021) - [i61]Peter Kern, Daniel Neugebauer, Jörg Rothe, René L. Schilling, Dietrich Stoyan, Robin Weishaupt:
Cutting a Cake Is Not Always a "Piece of Cake": A Closer Look at the Foundations of Cake-Cutting Through the Lens of Measure Theory. CoRR abs/2111.05402 (2021) - [i60]Edith Elkind, Judy Goldsmith, Anja Rey, Jörg Rothe:
Coalition Formation Games (Dagstuhl Seminar 21331). Dagstuhl Reports 11(7): 1-15 (2021) - 2020
- [j73]Pascal Lange, Nhan-Tam Nguyen, Jörg Rothe:
The price to pay for forgoing normalization in fair division of indivisible goods. Ann. Math. Artif. Intell. 88(7): 817-832 (2020) - [j72]Anna Maria Kerkmann, Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend:
Hedonic Games with Ordinal Preferences and Thresholds. J. Artif. Intell. Res. 67: 705-756 (2020) - [j71]Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe, Ann-Kathrin Selker:
Complexity of control in judgment aggregation for uniform premise-based quota rules. J. Comput. Syst. Sci. 112: 13-33 (2020) - [c103]Andreas Niskanen, Daniel Neugebauer, Matti Järvisalo, Jörg Rothe:
Deciding Acceptance in Incomplete Argumentation Frameworks. AAAI 2020: 2942-2949 - [c102]Marc Neveling, Jörg Rothe:
The Complexity of Cloning Candidates in Multiwinner Elections. AAMAS 2020: 922-930 - [c101]Dorothea Baumeister, Tobias Hogrebe, Jörg Rothe:
Towards Reality: Smoothed Analysis in Computational Social Choice. AAMAS 2020: 1691-1695 - [c100]Marc Neveling, Jörg Rothe, Roman Zorn:
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters. CSR 2020: 314-327 - [c99]Cynthia Maushagen, Jörg Rothe:
The Last Voting Rule Is Home: Complexity of Control by Partition of Candidates or Voters in Maximin Elections. ECAI 2020: 163-170 - [c98]Kenneth Skiba, Daniel Neugebauer, Jörg Rothe:
Complexity of Possible and Necessary Existence Problems in Abstract Argumentation. ECAI 2020: 897-904 - [c97]Alessandra Wiechers, Jörg Rothe:
Stability in Minimization-Based Altruistic Hedonic Games. STAIRS@ECAI 2020 - [c96]Trung Thanh Nguyen, Jörg Rothe:
Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types. IJCAI 2020: 290-296 - [c95]Anna Maria Kerkmann, Jörg Rothe:
Altruism in Coalition Formation Games. IJCAI 2020: 347-353 - [c94]Trung Thanh Nguyen, Jörg Rothe:
Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs. ISAAC 2020: 14:1-14:14 - [c93]Fabian Frei, Edith Hemaspaandra, Jörg Rothe:
Complexity of Stability. ISAAC 2020: 19:1-19:14 - [c92]Anna Maria Kerkmann, Jörg Rothe:
Altruism in Coalition Formation Games. ISAIM 2020 - [c91]Marc Neveling, Jörg Rothe, Roman Zorn:
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters. ISAIM 2020
2010 – 2019
- 2019
- [j70]Benno Kuckuck, Jörg Rothe:
Duplication monotonicity in the allocation of indivisible goods. AI Commun. 32(4): 253-270 (2019) - [c90]Jörg Rothe:
Borda Count in Collective Decision Making: A Summary of Recent Results. AAAI 2019: 9830-9836 - [c89]Benno Kuckuck, Jörg Rothe, Anke Weißenfeld:
Refugee Allocation in the Setting of Hedonic Games. ADT 2019: 65-80 - [c88]Pascal Lange, Jörg Rothe:
Optimizing Social Welfare in Social Networks. ADT 2019: 81-96 - [c87]Anna Maria Kerkmann, Jörg Rothe:
Stability in FEN-Hedonic Games for Single-Player Deviations. AAMAS 2019: 891-899 - [c86]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Bribery in Sequential Elections (Extended Abstract). TARK 2019: 233-251 - [i59]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Bribery in Sequential Elections. CoRR abs/1906.08308 (2019) - [i58]Fabian Frei, Edith Hemaspaandra, Jörg Rothe:
Complexity of Stability. CoRR abs/1910.00305 (2019) - 2018
- [j69]Tobias Heinen, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe:
Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods. Auton. Agents Multi Agent Syst. 32(6): 741-778 (2018) - [j68]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack:
Verification in incomplete argumentation frameworks. Artif. Intell. 264: 1-26 (2018) - [j67]Cynthia Maushagen, Jörg Rothe:
Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections. Ann. Math. Artif. Intell. 82(4): 219-244 (2018) - [j66]Yoram Bachrach, Edith Elkind, Enrico Malizia, Reshef Meir, Dmitrii V. Pasechnik, Jeffrey S. Rosenschein, Jörg Rothe, Michael Zuckerman:
Bounds on the Cost of Stabilizing a Cooperative Game. J. Artif. Intell. Res. 63: 987-1023 (2018) - [j65]Jörg Rothe, Hilmar Schadrack, Lena Schend:
Borda-induced hedonic games with friends, enemies, and neutral players. Math. Soc. Sci. 96: 21-36 (2018) - [j64]Nhan-Tam Nguyen, Dorothea Baumeister, Jörg Rothe:
Strategy-proofness of scoring allocation correspondences for indivisible goods. Soc. Choice Welf. 50(1): 101-122 (2018) - [c85]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack:
Complexity of Verification in Incomplete Argumentation Frameworks. AAAI 2018: 1753-1760 - [c84]Benno Kuckuck, Jörg Rothe:
Monotonicity, Duplication Monotonicity, and Pareto Optimality in the Scoring-Based Allocation of Indivisible Goods. AT 2018: 173-189 - [c83]Benno Kuckuck, Jörg Rothe:
Sequential Allocation Rules are Separable: Refuting a Conjecture on Scoring-Based Allocation of Indivisible Goods. AAMAS 2018: 650-658 - [c82]Cynthia Maushagen, Marc Neveling, Jörg Rothe, Ann-Kathrin Selker:
Complexity of Shift Bribery in Iterative Elections. AAMAS 2018: 1567-1575 - [c81]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe:
Credulous and Skeptical Acceptance in Incomplete Argumentation Frameworks. COMMA 2018: 181-192 - [c80]Pascal Lange, Nhan-Tam Nguyen, Jörg Rothe:
The Price to Pay for Forgoing Normalization in Fair Division of Indivisible Goods. ISAIM 2018 - [c79]Cynthia Maushagen, Marc Neveling, Jörg Rothe, Ann-Kathrin Selker:
Complexity of Shift Bribery in Hare, Coombs, Baldwin, and Nanson Elections. ISAIM 2018 - 2017
- [j63]Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe, Abdallah Saffidine:
Positional scoring-based allocation of indivisible goods. Auton. Agents Multi Agent Syst. 31(3): 628-655 (2017) - [j62]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of online voter control in sequential elections. Auton. Agents Multi Agent Syst. 31(5): 1055-1076 (2017) - [j61]Anja Rey, Jörg Rothe, Adrian Marple:
Path-Disruption Games: Bribery and a Probabilistic Model. Theory Comput. Syst. 60(2): 222-252 (2017) - [j60]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of controlling candidate-sequential elections. Theor. Comput. Sci. 678: 14-21 (2017) - [c78]Marc Neveling, Jörg Rothe:
Solving Seven Open Problems of Offline and Online Control in Borda Elections. AAAI 2017: 3029-3035 - [c77]Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe:
Approximate Solutions To Max-Min Fair and Proportionally Fair Allocations of Indivisible Goods. AAMAS 2017: 262-271 - [c76]Cynthia Maushagen, Jörg Rothe:
Complexity of Control by Partition of Voters and of Voter Groups in Veto and Other Scoring Protocols. AAMAS 2017: 615-623 - [c75]Marc Neveling, Jörg Rothe:
Closing the Gap of Control Complexity in Borda Elections: Solving ten open cases. ICTCS/CILC 2017: 138-149 - [e2]Jörg Rothe:
Algorithmic Decision Theory - 5th International Conference, ADT 2017, Luxembourg, Luxembourg, October 25-27, 2017, Proceedings. Lecture Notes in Computer Science 10576, Springer 2017, ISBN 978-3-319-67503-9 [contents] - 2016
- [j59]Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend:
Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games. Ann. Math. Artif. Intell. 77(3-4): 317-333 (2016) - [c74]Nhan-Tam Nguyen, Jörg Rothe:
Local Fairness in Hedonic Games via Individual Threshold Coalitions. AAMAS 2016: 232-241 - [c73]Nhan-Tam Nguyen, Anja Rey, Lisa Rey, Jörg Rothe, Lena Schend:
Altruistic Hedonic Games. AAMAS 2016: 251-259 - [c72]Anja Rey, Jörg Rothe:
Structural Control in Weighted Voting Games: (Extended Abstract). AAMAS 2016: 1371-1372 - [c71]Cynthia Maushagen, Jörg Rothe:
Complexity of Control by Partitioning Veto and Maximin Elections and of Control by Adding Candidates to Plurality Elections. ECAI 2016: 277-285 - [c70]Cynthia Maushagen, Jörg Rothe:
Complexity of Control by Partitioning Veto and Maximin Elections. ISAIM 2016 - [c69]Anja Rey, Jörg Rothe:
Structural Control in Weighted Voting Games. MFCS 2016: 80:1-80:15 - [c68]Victor Persien, Anja Rey, Jörg Rothe:
Cost of Stability and Least Core in Path-Disruption Games. STAIRS 2016: 99-110 - [p8]Jörg Rothe:
Playing, Voting, and Dividing. Economics and Computation 2016: 1-37 - [p7]Piotr Faliszewski, Irene Rothe, Jörg Rothe:
Noncooperative Game Theory. Economics and Computation 2016: 41-134 - [p6]Edith Elkind, Jörg Rothe:
Cooperative Game Theory. Economics and Computation 2016: 135-193 - [p5]Dorothea Baumeister, Jörg Rothe:
Preference Aggregation by Voting. Economics and Computation 2016: 197-325 - [p4]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Manipulative Actions in Single-Peaked Societies. Economics and Computation 2016: 327-360 - [p3]Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe:
Judgment Aggregation. Economics and Computation 2016: 361-391 - [p2]Claudia Lindner, Jörg Rothe:
Cake-Cutting: Fair Division of Divisible Goods. Economics and Computation 2016: 395-491 - [p1]Jérôme Lang, Jörg Rothe:
Fair Division of Indivisible Goods. Economics and Computation 2016: 493-550 - [e1]Jörg Rothe:
Economics and Computation, An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer texts in business and economics, Springer 2016, ISBN 978-3-662-47903-2 [contents] - [r1]Piotr Faliszewski, Jörg Rothe:
Control and Bribery in Voting. Handbook of Computational Social Choice 2016: 146-168 - 2015
- [j58]Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend:
Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting. Auton. Agents Multi Agent Syst. 29(6): 1091-1124 (2015) - [j57]Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend:
Control complexity in Bucklin and fallback voting: A theoretical analysis. J. Comput. Syst. Sci. 81(4): 632-660 (2015) - [j56]Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend:
Control complexity in Bucklin and fallback voting: An experimental analysis. J. Comput. Syst. Sci. 81(4): 661-670 (2015) - [j55]Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe:
Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules. Math. Soc. Sci. 76: 19-30 (2015) - [c67]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe:
Verification in Attack-Incomplete Argumentation Frameworks. ADT 2015: 341-358 - [c66]Dorothea Baumeister, Jörg Rothe, Hilmar Schadrack:
Verification in Argument-Incomplete Argumentation Frameworks. ADT 2015: 359-376 - [c65]Dorothea Baumeister, Jörg Rothe, Ann-Kathrin Selker:
Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types. ADT 2015: 432-448 - [c64]Tobias Heinen, Nhan-Tam Nguyen, Jörg Rothe:
Fairness and Rank-Weighted Utilitarianism in Resource Allocation. ADT 2015: 521-536 - [c63]Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend:
Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds. AAMAS 2015: 1229-1237 - [c62]Nhan-Tam Nguyen, Dorothea Baumeister, Jörg Rothe:
Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods. IJCAI 2015: 1127-1133 - 2014
- [j54]Nhan-Tam Nguyen, Trung Thanh Nguyen, Magnus Roos, Jörg Rothe:
Computational complexity and approximability of social welfare optimization in multiagent resource allocation. Auton. Agents Multi Agent Syst. 28(2): 256-289 (2014) - [j53]Trung Thanh Nguyen, Jörg Rothe:
Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods. Discret. Appl. Math. 179: 54-68 (2014) - [j52]Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Jörg Rothe:
The complexity of probabilistic lobbying. Discret. Optim. 11: 1-21 (2014) - [j51]Anja Rey, Jörg Rothe:
False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time. J. Artif. Intell. Res. 50: 573-601 (2014) - [j50]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of online manipulation of sequential elections. J. Comput. Syst. Sci. 80(4): 697-710 (2014) - [c61]Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend:
Complexity of manipulation, bribery, and campaign management in bucklin and fallback voting. AAMAS 2014: 1357-1358 - [c60]Adrian Marple, Anja Rey, Jörg Rothe:
Bribery in multiple-adversary path-disruption games is hard for the second level of the polynomial hierarchy. AAMAS 2014: 1375-1376 - [c59]Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe:
Scoring Rules for the Allocation of Indivisible Goods. ECAI 2014: 75-80 - [c58]Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend:
Toward the Complexity of the Existence of Wonderfully Stable Partitions and Strictly Core Stable Coalition Structures in Hedonic Games. ISAIM 2014 - [c57]Anja Rey, Jörg Rothe:
False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time. LATIN 2014: 60-71 - [c56]Yannick Reisch, Jörg Rothe, Lena Schend:
The Margin of Victory in Schulze, Cup, and Copeland Elections: Complexity of the Regular and Exact Variants. STAIRS 2014: 250-259 - 2013
- [j49]Judy Goldsmith, Jörg Rothe:
Algorithms, approximation, and empirical studies in behavioral and computational social choice - Preface. Ann. Math. Artif. Intell. 68(1-3): 3-4 (2013) - [j48]Trung Thanh Nguyen, Magnus Roos, Jörg Rothe:
A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation. Ann. Math. Artif. Intell. 68(1-3): 65-90 (2013) - [j47]Jörg Rothe, Lena Schend:
Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey. Ann. Math. Artif. Intell. 68(1-3): 161-193 (2013) - [j46]Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe:
The Complexity of Computing Minimal Unidirectional Covering Sets. Theory Comput. Syst. 53(3): 467-502 (2013) - [c55]Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe:
Computational Aspects of Manipulation and Control in Judgment Aggregation. ADT 2013: 71-85 - [c54]Trung Thanh Nguyen, Jörg Rothe:
How to Decrease the Degree of Envy in Allocations of Indivisible Goods. ADT 2013: 271-284 - [c53]Trung Thanh Nguyen, Jörg Rothe:
Envy-ratio and average-nash social welfare optimization in multiagent resource allocation. AAMAS 2013: 1139-1140 - [c52]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
A Richer Understanding of the Complexity of Election Systems. Fundamental Problems in Computing 2013: 375-406 - [c51]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Manipulation of Sequential Elections. TARK 2013 - [i57]Anja Rey, Jörg Rothe:
False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time. CoRR abs/1303.1691 (2013) - [i56]Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend:
Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting. CoRR abs/1307.7322 (2013) - [i55]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Manipulation of Sequential Elections. CoRR abs/1310.6997 (2013) - 2012
- [j45]Dorothea Baumeister, Jörg Rothe:
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules. Inf. Process. Lett. 112(5): 186-190 (2012) - [c50]Dorothea Baumeister, Piotr Faliszewski, Jérôme Lang, Jörg Rothe:
Campaigns for lazy voters: truncated ballots. AAMAS 2012: 577-584 - [c49]Nhan-Tam Nguyen, Trung Thanh Nguyen, Magnus Roos, Jörg Rothe:
Complexity and approximability of social welfare optimization in multiagent resource allocation. AAMAS 2012: 1287-1288 - [c48]Dorothea Baumeister, Magnus Roos, Jörg Rothe, Lena Schend, Lirong Xia:
The Possible Winner Problem with Uncertain Weights. ECAI 2012: 133-138 - [c47]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Online Voter Control in Sequential Elections. ECAI 2012: 396-401 - [c46]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Controlling Candidate-Sequential Elections. ECAI 2012: 905-906 - [c45]Anja Rey, Jörg Rothe:
Probabilistic Path-Disruption Games. ECAI 2012: 923-924 - [c44]Nhan-Tam Nguyen, Magnus Roos, Jörg Rothe:
Exact Optimization of Social Welfare by the Nash Product is DP-Complete. ISAIM 2012 - [c43]Trung Thanh Nguyen, Magnus Roos, Jörg Rothe:
A Survey of Approximability and Inapproximability Results for Social Welfare Optimization in Multiagent Resource Allocation. ISAIM 2012 - [c42]Jörg Rothe, Lena Schend:
Typical-Case Challenges to Complexity Shields That Are Supposed to Protect Elections Against Manipulation and Control: A Survey. ISAIM 2012 - [c41]Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe:
Control in Judgment Aggregation. STAIRS 2012: 23-34 - [c40]Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe:
Complexity and Approximability of Egalitarian Nash Product Social Welfare Optimization in Multiagent Resource Allocation. STAIRS 2012: 204-215 - [c39]Anja Rey, Jörg Rothe:
Probabilistic Path-Disruption Games. STAIRS 2012: 264-269 - [c38]Jörg Rothe, Lena Schend:
Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach. SEA 2012: 356-368 - [i54]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Controlling Candidate-Sequential Elections. CoRR abs/1202.6649 (2012) - [i53]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Manipulation of Sequential Elections. CoRR abs/1202.6655 (2012) - [i52]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Online Voter Control in Sequential Elections. CoRR abs/1203.0411 (2012) - [i51]Jörg Rothe, Lena Schend:
Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach. CoRR abs/1203.3967 (2012) - 2011
- [b5]Jörg Rothe, Dorothea Baumeister, Claudia Lindner, Irene Rothe:
Einführung in Computational Social Choice: Individuelle Strategien und kollektive Entscheidungen beim Spielen, Wählen und Teilen. Springer Spektrum 2011, ISBN 978-3-8274-2570-6 - [j44]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Inf. Comput. 209(2): 89-107 (2011) - [c37]Magnus Roos, Jörg Rothe, Björn Scheuermann:
How to Calibrate the Scores of Biased Reviewers by Quadratic Programming. AAAI 2011: 255-260 - [c36]Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe:
How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation. ADT 2011: 1-15 - [c35]Anja Rey, Jörg Rothe:
Bribery in Path-Disruption Games. ADT 2011: 247-261 - [c34]Gábor Erdélyi, Lena Piras, Jörg Rothe:
The complexity of voter partition in Bucklin and fallback voting: solving three open problems. AAMAS 2011: 837-844 - [c33]Dorothea Baumeister, Magnus Roos, Jörg Rothe:
Computational complexity of two variants of the possible winner problem. AAMAS 2011: 853-860 - [i50]Gábor Erdélyi, Michael R. Fellows, Lena Piras, Jörg Rothe:
Control Complexity in Bucklin and Fallback Voting. CoRR abs/1103.2230 (2011) - [i49]Dorothea Baumeister, Jörg Rothe:
Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. CoRR abs/1108.4436 (2011) - 2010
- [b4]Frank Gurski, Irene Rothe, Jörg Rothe, Egon Wanke:
Exakte Algorithmen für schwere Graphenprobleme. eXamen.press, Springer 2010, ISBN 978-3-642-04499-1, pp. I-XII, 1-331 - [c32]Magnus Roos, Jörg Rothe:
Complexity of social welfare optimization in multiagent resource allocation. AAMAS 2010: 641-648 - [c31]Gábor Erdélyi, Jörg Rothe:
Control Complexity in Fallback Voting. CATS 2010: 39-48 - [c30]Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe:
The Complexity of Computing Minimal Unidirectional Covering Sets. CIAC 2010: 299-310 - [c29]Dorothea Baumeister, Jörg Rothe:
Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. ECAI 2010: 1019-1020 - [c28]Anja Rey, Jörg Rothe:
Complexity of Merging and Splitting for the Probabilistic Banzhaf Power Index in Weighted Voting Games. ECAI 2010: 1021-1022 - [c27]Anja Rey, Jörg Rothe:
Merging and Splitting for Power Indices in Weighted Voting Games and Network Flow Games on Hypergraphs. STAIRS 2010: 277-289 - [i48]Gábor Erdélyi, Lena Piras, Jörg Rothe:
Control Complexity in Fallback Voting. CoRR abs/1004.3398 (2010) - [i47]Gábor Erdélyi, Lena Piras, Jörg Rothe:
Bucklin Voting is Broadly Resistant to Control. CoRR abs/1005.4115 (2010)
2000 – 2009
- 2009
- [j43]Dorothea Baumeister, Jörg Rothe:
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem. Fundam. Informaticae 91(1): 35-51 (2009) - [j42]Dorothea Baumeister, Jörg Rothe:
The three-color and two-color TantrixTM rotation puzzle problems are NP-complete via parsimonious reductions. Inf. Comput. 207(11): 1119-1139 (2009) - [j41]Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
Frequency of correctness versus average polynomial time. Inf. Process. Lett. 109(16): 946-949 (2009) - [j40]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. J. Artif. Intell. Res. 35: 275-341 (2009) - [j39]Paul W. Goldberg, Jörg Rothe:
Editorial: Math. Log. Quart. 4/2009. Math. Log. Q. 55(4): 340 (2009) - [j38]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. Math. Log. Q. 55(4): 397-424 (2009) - [j37]Gábor Erdélyi, Markus Nowak, Jörg Rothe:
Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control. Math. Log. Q. 55(4): 425-443 (2009) - [j36]Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
Generalized juntas and NP-hard sets. Theor. Comput. Sci. 410(38-40): 3995-4000 (2009) - [c26]Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe:
The Complexity of Probabilistic Lobbying. ADT 2009: 86-97 - [c25]Yoram Bachrach, Reshef Meir, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein:
The cost of stability in weighted voting games. AAMAS (2) 2009: 1289-1290 - [c24]Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein:
The Cost of Stability in Coalitional Games. SAGT 2009: 122-134 - [c23]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The shield that never was: societies with single-peaked preferences are more open to manipulation and control. TARK 2009: 118-127 - [c22]Claudia Lindner, Jörg Rothe:
Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols. WINE 2009: 149-159 - [i46]Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jörg Rothe:
Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP. CoRR abs/0901.3692 (2009) - [i45]Claudia Lindner, Jörg Rothe:
Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols. CoRR abs/0902.0620 (2009) - [i44]Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe:
The Complexity of Probabilistic Lobbying. CoRR abs/0906.4431 (2009) - [i43]Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein:
The Cost of Stability in Coalitional Games. CoRR abs/0907.4385 (2009) - [i42]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control. CoRR abs/0909.3257 (2009) - 2008
- [b3]Jörg Rothe:
Komplexitätstheorie und Kryptologie. Eine Einführung in Kryptokomplexität. eXamen.press, Springer 2008, ISBN 978-3-540-79744-9 - [j35]Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena:
Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions. Theor. Comput. Sci. 401(1-3): 27-35 (2008) - [c21]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Copeland Voting Fully Resists Constructive Control. AAIM 2008: 165-176 - [c20]Dorothea Baumeister, Jörg Rothe:
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions. LATA 2008: 76-87 - [c19]Gábor Erdélyi, Markus Nowak, Jörg Rothe:
Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control. MFCS 2008: 311-322 - [i41]Gábor Erdélyi, Markus Nowak, Jörg Rothe:
Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control. CoRR abs/0806.0535 (2008) - [i40]Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas. CoRR abs/0806.2555 (2008) - [i39]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Llull and Copeland Voting Computationally Resist Bribery and Control. CoRR abs/0809.4484 (2008) - 2007
- [j34]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Anyone but him: The complexity of precluding an alternative. Artif. Intell. 171(5-6): 255-285 (2007) - [j33]Dagmar Bruß, Gábor Erdélyi, Tim Meyer, Tobias Riege, Jörg Rothe:
Quantum cryptography: A survey. ACM Comput. Surv. 39(2): 6 (2007) - [j32]Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto:
An improved exact algorithm for the domatic number problem. Inf. Process. Lett. 101(3): 101-106 (2007) - [j31]Jörg Rothe:
Review of "Complexity and Cryptography: An Introduction by John Talbot and Dominic Welsh", Cambridge University Press, 2006, 292 pages. SIGACT News 38(2): 16-20 (2007) - [c18]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Llull and Copeland Voting Broadly Resist Bribery and Control. AAAI 2007: 724-730 - [c17]Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. FCT 2007: 300-311 - [c16]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. IJCAI 2007: 1308-1314 - [c15]Dorothea Baumeister, Jörg Rothe:
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem. MCU 2007: 134-145 - [i38]Dorothea Baumeister, Jörg Rothe:
Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem. CoRR abs/0705.0915 (2007) - [i37]Dorothea Baumeister, Jörg Rothe:
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions. CoRR abs/0711.1827 (2007) - [i36]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Copeland Voting Fully Resists Constructive Control. CoRR abs/0711.4759 (2007) - [i35]Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness versus Average-Case Polynomial Time. CoRR abs/cs/0703097 (2007) - 2006
- [j30]André Große, Jörg Rothe, Gerd Wechsung:
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P. Inf. Process. Lett. 99(6): 215-221 (2006) - [j29]Edith Hemaspaandra, Jörg Rothe, Holger Spakowski:
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. RAIRO Theor. Informatics Appl. 40(1): 75-91 (2006) - [j28]Tobias Riege, Jörg Rothe:
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey. J. Univers. Comput. Sci. 12(5): 551-578 (2006) - [j27]Jörg Rothe, Hiroki Arimura:
Computational Challenges of Massive Data Sets and Randomness in Computation (J.UCS Special Issue on the First and Second Japanese-German Frontiers of Science Symposia). J. Univers. Comput. Sci. 12(6): 579-580 (2006) - [j26]Tobias Riege, Jörg Rothe:
Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem. J. Univers. Comput. Sci. 12(6): 725-745 (2006) - [j25]Tobias Riege, Jörg Rothe:
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem. Theory Comput. Syst. 39(5): 635-668 (2006) - [j24]Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe:
If P neq NP then some strongly noninvertible functions are invertible. Theor. Comput. Sci. 362(1-3): 54-62 (2006) - [i34]Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto:
An Improved Exact Algorithm for the Domatic Number Problem. CoRR abs/cs/0603060 (2006) - [i33]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. CoRR abs/cs/0608057 (2006) - [i32]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
A Richer Understanding of the Complexity of Election Systems. CoRR abs/cs/0609112 (2006) - [i31]Tobias Riege, Jörg Rothe:
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems. Electron. Colloquium Comput. Complex. TR06 (2006) - [i30]Tobias Riege, Jörg Rothe:
Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [b2]Jörg Rothe:
Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. Texts in Theoretical Computer Science. An EATCS Series, Springer 2005, ISBN 978-3-540-22147-0, pp. 1-478 - [c14]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Anyone but Him: The Complexity of Precluding an Alternative. AAAI 2005: 95-101 - [c13]Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena:
Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory. ICTCS 2005: 265-279 - [c12]Tobias Riege, Jörg Rothe:
An Exact 2.9416n Algorithm for the Three Domatic Number Problem. MFCS 2005: 733-744 - [i29]Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena:
Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory. CoRR abs/cs/0503049 (2005) - [i28]Tobias Riege, Jörg Rothe:
An Exact 2.9416n Algorithm for the Three Domatic Number Problem. CoRR abs/cs/0506090 (2005) - [i27]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Anyone but Him: The Complexity of Precluding an Alternative. CoRR abs/cs/0507027 (2005) - [i26]Gábor Erdélyi, Tobias Riege, Jörg Rothe:
Quantum Cryptography: A Survey. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [i25]Jörg Rothe:
Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy. Algebraic Methods in Computational Complexity 2004 - 2003
- [j23]Jörg Rothe:
Exact complexity of Exact-Four-Colorability. Inf. Process. Lett. 87(1): 7-12 (2003) - [j22]Jörg Rothe, Holger Spakowski, Jörg Vogel:
Exact Complexity of the Winner Problem for Young Elections. Theory Comput. Syst. 36(4): 375-386 (2003) - 2002
- [j21]Jörg Rothe:
Some facets of complexity theory and cryptography: A five-lecture tutorial. ACM Comput. Surv. 34(4): 504-549 (2002) - [j20]Jörg Rothe:
Kryptographische Protokolle und Null-Information. Inform. Spektrum 25(2): 120-131 (2002) - [j19]Jörg Rothe, Lane A. Hemaspaandra:
On characterizing the existence of partial one-way permutations. Inf. Process. Lett. 82(3): 165-171 (2002) - [j18]André Große, Jörg Rothe, Gerd Wechsung:
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones. Theory Comput. Syst. 35(1): 81-93 (2002) - [c11]Jörg Rothe, Holger Spakowski, Jörg Vogel:
Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections. IFIP TCS 2002: 310-322 - [c10]Edith Hemaspaandra, Jörg Rothe, Holger Spakowski:
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. WG 2002: 258-269 - [i24]Tobias Riege, Jörg Rothe:
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem. CoRR cs.CC/0212016 (2002) - [i23]Tobias Riege, Jörg Rothe:
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [c9]Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe:
If P != NP Then Some Strongly Noninvertible Functions Are Invertible. FCT 2001: 162-171 - [c8]André Große, Jörg Rothe, Gerd Wechsung:
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions. ICTCS 2001: 339-356 - [i22]André Große, Jörg Rothe, Gerd Wechsung:
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones. CoRR cs.CC/0106041 (2001) - [i21]André Große, Jörg Rothe, Gerd Wechsung:
A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs. CoRR cs.CC/0106045 (2001) - [i20]Jörg Rothe:
Exact Complexity of Exact-Four-Colorability. CoRR cs.CC/0109018 (2001) - [i19]Edith Hemaspaandra, Jörg Rothe, Holger Spakowski:
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. CoRR cs.CC/0110025 (2001) - [i18]Jörg Rothe:
Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial. CoRR cs.CC/0111056 (2001) - [i17]Jörg Rothe, Holger Spakowski, Jörg Vogel:
Exact Complexity of the Winner Problem for Young Elections. CoRR cs.CC/0112021 (2001) - [i16]Jörg Rothe:
Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j17]Jörg Rothe:
Heuristics Versus Completeness for Graph Coloring. Chic. J. Theor. Comput. Sci. 2000 (2000) - [j16]Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe:
Tally NP Sets and Easy Census Functions. Inf. Comput. 158(1): 29-52 (2000) - [j15]Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe:
Corrigendum to "Upward separation for FewP and related classes". Inf. Process. Lett. 74(1-2): 89 (2000) - [j14]Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Restrictive Acceptance Suffices for Equivalence Problems. LMS J. Comput. Math. 3: 86-95 (2000) - [j13]Lane A. Hemaspaandra, Jörg Rothe:
A second step towards complexity-theoretic analogs of Rice's Theorem. Theor. Comput. Sci. 244(1-2): 205-217 (2000) - [j12]Lane A. Hemaspaandra, Jörg Rothe:
Characterizing the existence of one-way permutations. Theor. Comput. Sci. 244(1-2): 257-261 (2000) - [i15]Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe:
If P \neq NP then Some Strongly Noninvertible Functions are Invertible. CoRR cs.CC/0010011 (2000)
1990 – 1999
- 1999
- [j11]Jörg Rothe:
Immunity and simplicity for exact counting and other counting classes. RAIRO Theor. Informatics Appl. 33(2): 159-176 (1999) - [j10]Lane A. Hemaspaandra, Jörg Rothe:
Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory. J. Comput. Syst. Sci. 58(3): 648-659 (1999) - [j9]Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe:
One-way functions in worst-case cryptography: algebraic and security properties are on the house. SIGACT News 30(4): 25-40 (1999) - [c7]Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Restrictive Acceptance Suffices for Equivalence Problems. FCT 1999: 124-135 - [i14]Lane A. Hemaspaandra, Jörg Rothe:
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets. CoRR cs.CC/9907033 (1999) - [i13]Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe:
Polynomial-Time Multi-Selectivity. CoRR cs.CC/9907034 (1999) - [i12]Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung:
Easy Sets and Hard Certificate Schemes. CoRR cs.CC/9907035 (1999) - [i11]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. CoRR cs.CC/9907036 (1999) - [i10]Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe:
Boolean Operations, Joins, and the Extended Low Hierarchy. CoRR cs.CC/9907037 (1999) - [i9]Lane A. Hemaspaandra, Jörg Rothe:
A Second Step Towards Complexity-Theoretic Analogs of Rice's Theorem. CoRR cs.CC/9907038 (1999) - [i8]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Raising NP Lower Bounds to Parallel NP Lower Bounds. CoRR cs.CC/9907039 (1999) - [i7]Jörg Rothe, Lane A. Hemaspaandra:
Characterizations of the Existence of Partial and Total One-Way Permutations. CoRR cs.CC/9907040 (1999) - [i6]Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Restrictive Acceptance Suffices for Equivalence Problems. CoRR cs.CC/9907041 (1999) - [i5]Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe:
One-Way Functions in Worst-Case Cryptography: Algebraic and Security Properties. CoRR cs.CC/9911007 (1999) - 1998
- [j8]Edith Hemaspaandra, Jörg Rothe:
Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP. Inf. Process. Lett. 65(3): 151-156 (1998) - [j7]Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe:
Boolean Operations, Joins, and the Extended Low Hierarchy. Theor. Comput. Sci. 205(1-2): 317-327 (1998) - [c6]Lane A. Hemaspaandra, Jörg Rothe:
A Second Step Towards Circuit Complexity-Theoretic Analogs of Rice's Theorem. MFCS 1998: 418-426 - [c5]Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe:
Tally NP Sets and Easy Census Functions. MFCS 1998: 483-492 - [i4]Lane A. Hemaspaandra, Jörg Rothe:
Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function. CoRR cs.CC/9808003 (1998) - [i3]Jörg Rothe:
Immunity and Simplicity for Exact Counting and Other Counting Classes. CoRR cs.CC/9809001 (1998) - [i2]Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe:
Tally NP Sets and Easy Census Functions. CoRR cs.CC/9809002 (1998) - 1997
- [j6]Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung:
Easy Sets and Hard Certificate Schemes. Acta Informatica 34(11): 859-879 (1997) - [j5]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. J. ACM 44(6): 806-825 (1997) - [j4]Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe:
Polynomial-Time Multi-Selectivity. J. Univers. Comput. Sci. 3(3): 197-229 (1997) - [j3]Lane A. Hemaspaandra, Jörg Rothe:
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets. SIAM J. Comput. 26(3): 634-653 (1997) - [j2]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Raising NP lower bounds to parallel NP lower bounds. SIGACT News 28(2): 2-13 (1997) - [c4]Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung:
On Sets with Easy Certificates and the Existence of One-Way Permutations. CIAC 1997: 264-275 - [c3]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. ICALP 1997: 214-224 - 1996
- [c2]Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe:
The Join Can Lower Complexity. COCOON 1996: 260-267 - [i1]Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [b1]Jörg Rothe:
On some promise classes in structural complexity theory. University of Jena, Germany, 1995, pp. 1-112 - [c1]Lane A. Hemaspaandra, Jörg Rothe:
Intersection Suffices for Boolean Hierarchy Equivalence. COCOON 1995: 430-435 - 1994
- [j1]Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe:
Upward Separation for FewP and Related Classes. Inf. Process. Lett. 52(4): 175-180 (1994)
Coauthor Index
[j81] [c86] [i59] [j62] [j60] [p4] [j50] [c52] [c51] [i55] [c47] [c46] [i54] [i53] [i52] [j44] [j41] [j40] [j38] [j36] [c23] [i42] [j35] [c21] [i40] [i39] [j34] [c18] [c17] [c16] [i36] [i35] [j24] [i33] [i32] [c14] [c13] [i29] [i27] [j19] [c9] [j14] [j13] [j12] [i15] [j10] [j9] [c7] [i14] [i13] [i12] [i11] [i10] [i9] [i8] [i7] [i6] [i5] [j7] [c6] [i4] [j6] [j5] [j4] [j3] [j2] [c4] [c3] [c2] [i1] [c1]
Lena Schend
aka: Lena Piras
aka: Lena Piras
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-11 20:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
