Jörg Rothe - RankMe

306 papers A* 16A 38B 21C 9Misc 14Journal 160Unranked 32

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	How to Tamper with a Parliament: Strategic Campaigns in Apportionment Elections. CoRR Robert Bredereck, Piotr Faliszewski, Michal Furdyna, Andrzej Kaczmarczyk, Joanna Kaczmarek, Martin Lackner, Christian Laußmann, Jörg Rothe, Tessa Seeger
2026	J	`jnl`	How to tamper with a Parliament: Strategic campaigns in apportionment elections. J. Comput. Syst. Sci. Robert Bredereck, Piotr Faliszewski, Michal Furdyna, Andrzej Kaczmarczyk, Joanna Kaczmarek, Martin Lackner, Christian Laußmann, Jörg Rothe, Tessa Seeger
2025	J	`jnl`	Advances in Multi-Agent Systems Research: Extended Selected Papers from EUMAS 2022 and EUMAS 2023. SN Comput. Sci. Dorothea Baumeister, Jörg Rothe, Nikos Spanoudakis, Vadim Malvone, Aniello Murano
2025	J	`jnl`	Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games. J. Artif. Intell. Res. Joanna Kaczmarek, Jörg Rothe, Nimrod Talmon
2025	A	`conf`	Control by Deleting Players from Weighted Voting Games Is NP ECAI Joanna Kaczmarek, Jörg Rothe
2025	J	`jnl`	Control by Deleting Players from Weighted Voting Games Is NP^PP-Complete for the Penrose-Banzhaf Power Index. CoRR Joanna Kaczmarek, Jörg Rothe
2025	A*	`conf`	Control in Computational Social Choice. IJCAI Jiehua Chen, Joanna Kaczmarek, Paul Nüsken, Jörg Rothe, Ildikó Schlotter, Tessa Seeger
2025	A	`conf`	District-Limited Bribery in Multidistrict Apportionment Elections with Threshold. ECAI Joanna Kaczmarek, Jörg Rothe, Tessa Seeger
2025	A	`conf`	On Matching in Multipartite Quantum Routers. HPDC Dagmar Bruß, Luis Gindorf, Julia Kunzelmann, Christian Laußmann, Jörg Rothe
2025	B	`conf`	Skating System Unveiled: Exploring Preference Aggregation in Ballroom Tournaments. TARK Laryssa Horn, Paul Nüsken, Jörg Rothe, Tessa Seeger
2025	B	`conf`	Solving Four Open Problems about Core Stability in Altruistic Hedonic Games. TARK Jörg Rothe, Ildikó Schlotter
2024	J	`jnl`	Altruism in coalition formation games. Ann. Math. Artif. Intell. Anna Maria Kerkmann, Simon Cramer, Jörg Rothe
2024	B	`conf`	Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode. SOFSEM Christian Laußmann, Jörg Rothe, Tessa Seeger
2024	J	`jnl`	Coalition formation games - preface. Ann. Math. Artif. Intell. Judy Goldsmith, Jörg Rothe
2024	A	`conf`	Complexity and Approximation Schemes for Social Welfare Maximization in the High-Multiplicity Setting. ECAI Trung Thanh Nguyen, Khaled Elbassioni, Jörg Rothe
2024	—	`conf`	Complexity of Candidate Control for Single Nontransferable Vote and Bloc Voting. ADT Garo Karh Bet, Jörg Rothe, Roman Zorn
2024	A	`conf`	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 ECAI Joanna Kaczmarek, Jörg Rothe
2024	J	`jnl`	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 CoRR Joanna Kaczmarek, Jörg Rothe
2024	J	`jnl`	Controlling weighted voting games by deleting or adding players with or without changing the quota. Ann. Math. Artif. Intell. Joanna Kaczmarek, Jörg Rothe
2024	—	`conf`	Core Stability in Altruistic Coalition Formation Games. LATIN (2) Matthias Hoffjan, Anna Maria Kerkmann, Jörg Rothe
2024	A	`conf`	NP AAMAS Joanna Kaczmarek, Jörg Rothe
2024	J	`jnl`	Stability, Vertex Stability, and Unfrozenness for Special Graph Classes. Theory Comput. Syst. Frank Gurski, Jörg Rothe, Robin Weishaupt
2024	J	`jnl`	The complexity of verifying popularity and strict popularity in altruistic hedonic games. Auton. Agents Multi Agent Syst. Anna Maria Kerkmann, Jörg Rothe
2024	A*	`conf`	Toward Completing the Picture of Control in Schulze and Ranked Pairs Elections. IJCAI Cynthia Maushagen, David Niclaus, Paul Nüsken, Jörg Rothe, Tessa Seeger
2024	J	`jnl`	Toward Completing the Picture of Control in Schulze and Ranked Pairs Elections. CoRR Cynthia Maushagen, David Niclaus, Paul Nüsken, Jörg Rothe, Tessa Seeger
2023	J	`jnl`	Altruism in Coalition Formation Games. CoRR Anna Maria Kerkmann, Simon Cramer, Jörg Rothe
2023	A*	`conf`	Complexity Results and Exact Algorithms for Fair Division of Indivisible Items: A Survey. IJCAI Trung Thanh Nguyen, Jörg Rothe
2023	A	`conf`	Complexity of Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games. ECAI Joanna Kaczmarek, Jörg Rothe, Nimrod Talmon
2023	J	`jnl`	Fair and efficient allocation with few agent types, few item types, or small value levels. Artif. Intell. Trung Thanh Nguyen, Jörg Rothe
2023	J	`jnl`	The possible winner with uncertain weights problem. J. Comput. Syst. Sci. Dorothea Baumeister, Marc Neveling, Magnus Roos, Jörg Rothe, Lena Schend, Robin Weishaupt, Lirong Xia
2022	J	`jnl`	Altruistic Hedonic Games. J. Artif. Intell. Res. Anna Maria Kerkmann, Nhan-Tam Nguyen, Anja Rey, Lisa Rey, Jörg Rothe, Lena Schend, Alessandra Wiechers
2022	J	`jnl`	Complexity of shift bribery for iterative voting rules. Ann. Math. Artif. Intell. Cynthia Maushagen, Marc Neveling, Jörg Rothe, Ann-Kathrin Selker
2022	J	`jnl`	Complexity of stability. J. Comput. Syst. Sci. Fabian Frei, Edith Hemaspaandra, Jörg Rothe
2022	C	`conf`	Controlling Weighted Voting Games by Deleting or Adding Players with or Without Changing the Quota. IWOCA Joanna Kaczmarek, Jörg Rothe
2022	Misc	`conf`	Controlling Weighted Voting Games by Deleting or Adding Players with or without Changing the Quota. ISAIM Joanna Kaczmarek, Jörg Rothe
2022	Misc	`conf`	Min-Based Altruism in Coalition Formation Games. ISAIM Simon Cramer, Anna Maria Kerkmann, Jörg Rothe
2022	C	`ed.`	Multi-Agent Systems - 19th European Conference, EUMAS 2022, Düsseldorf, Germany, September 14-16, 2022, Proceedings EUMAS Dorothea Baumeister, Jörg Rothe
2022	A	`conf`	Popularity and Strict Popularity in Altruistic Hedonic Games and Minimum-Based Altruistic Hedonic Games. AAMAS Anna Maria Kerkmann, Jörg Rothe
2022	J	`jnl`	The complexity of online bribery in sequential elections. J. Comput. Syst. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2022	A	`conf`	Voting for Centrality. AAMAS Ulrik Brandes, Christian Laußmann, Jörg Rothe
2021	J	`jnl`	Acceptance in incomplete argumentation frameworks. Artif. Intell. Dorothea Baumeister, Matti Järvisalo, Daniel Neugebauer, Andreas Niskanen, Jörg Rothe
2021	J	`jnl`	Coalition Formation Games (Dagstuhl Seminar 21331). Dagstuhl Reports Edith Elkind, Judy Goldsmith, Anja Rey, Jörg Rothe
2021	J	`jnl`	Collective Acceptability in Abstract Argumentation. FLAP Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe
2021	C	`conf`	Complexity of Nonemptiness in Control Argumentation Frameworks. ECSQARU Daniel Neugebauer, Jörg Rothe, Kenneth Skiba
2021	J	`jnl`	Complexity of Nonempty Existence Problems in Incomplete Argumentation Frameworks. IEEE Intell. Syst. Kenneth Skiba, Daniel Neugebauer, Jörg Rothe
2021	J	`jnl`	Control complexity in Borda elections: Solving all open cases of offline control and some cases of online control. Artif. Intell. Marc Neveling, Jörg Rothe
2021	J	`jnl`	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 Peter Kern, Daniel Neugebauer, Jörg Rothe, René L. Schilling, Dietrich Stoyan, Robin Weishaupt
2021	J	`jnl`	Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints. Theor. Comput. Sci. Trung Thanh Nguyen, Jörg Rothe
2021	J	`jnl`	Local fairness in hedonic games via individual threshold coalitions. Theor. Comput. Sci. Anna Maria Kerkmann, Nhan-Tam Nguyen, Jörg Rothe
2021	—	`conf`	Manipulation in Communication Structures of Graph-Restricted Weighted Voting Games. ADT Joanna Kaczmarek, Jörg Rothe
2021	—	`conf`	Stability of Special Graph Classes. ICTCS Robin Weishaupt, Jörg Rothe
2021	J	`jnl`	Stability of Special Graph Classes. CoRR Robin Weishaupt, Jörg Rothe
2021	B	`conf`	The Possible Winner Problem with Uncertain Weights Revisited. FCT Marc Neveling, Jörg Rothe, Robin Weishaupt
2021	A*	`conf`	Thou Shalt Love Thy Neighbor as Thyself When Thou Playest: Altruism in Game Theory. AAAI Jörg Rothe
2021	J	`jnl`	Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters. Auton. Agents Multi Agent Syst. Gábor Erdélyi, Marc Neveling, Christian Reger, Jörg Rothe, Yongjie Yang, Roman Zorn
2020	A*	`conf`	Altruism in Coalition Formation Games. IJCAI Anna Maria Kerkmann, Jörg Rothe
2020	Misc	`conf`	Altruism in Coalition Formation Games. ISAIM Anna Maria Kerkmann, Jörg Rothe
2020	A*	`conf`	Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types. IJCAI Trung Thanh Nguyen, Jörg Rothe
2020	B	`conf`	Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs. ISAAC Trung Thanh Nguyen, Jörg Rothe
2020	A	`conf`	Complexity of Possible and Necessary Existence Problems in Abstract Argumentation. ECAI Kenneth Skiba, Daniel Neugebauer, Jörg Rothe
2020	B	`conf`	Complexity of Stability. ISAAC Fabian Frei, Edith Hemaspaandra, Jörg Rothe
2020	J	`jnl`	Complexity of control in judgment aggregation for uniform premise-based quota rules. J. Comput. Syst. Sci. Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe, Ann-Kathrin Selker
2020	A*	`conf`	Deciding Acceptance in Incomplete Argumentation Frameworks. AAAI Andreas Niskanen, Daniel Neugebauer, Matti Järvisalo, Jörg Rothe
2020	J	`jnl`	Hedonic Games with Ordinal Preferences and Thresholds. J. Artif. Intell. Res. Anna Maria Kerkmann, Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend
2020	—	`conf`	Stability in Minimization-Based Altruistic Hedonic Games. STAIRS@ECAI Alessandra Wiechers, Jörg Rothe
2020	A	`conf`	The Complexity of Cloning Candidates in Multiwinner Elections. AAMAS Marc Neveling, Jörg Rothe
2020	Misc	`conf`	The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters. CSR Marc Neveling, Jörg Rothe, Roman Zorn
2020	Misc	`conf`	The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters. ISAIM Marc Neveling, Jörg Rothe, Roman Zorn
2020	A	`conf`	The Last Voting Rule Is Home: Complexity of Control by Partition of Candidates or Voters in Maximin Elections. ECAI Cynthia Maushagen, Jörg Rothe
2020	J	`jnl`	The price to pay for forgoing normalization in fair division of indivisible goods. Ann. Math. Artif. Intell. Pascal Lange, Nhan-Tam Nguyen, Jörg Rothe
2020	A	`conf`	Towards Reality: Smoothed Analysis in Computational Social Choice. AAMAS Dorothea Baumeister, Tobias Hogrebe, Jörg Rothe
2019	A*	`conf`	Borda Count in Collective Decision Making: A Summary of Recent Results. AAAI Jörg Rothe
2019	J	`jnl`	Complexity of Stability. CoRR Fabian Frei, Edith Hemaspaandra, Jörg Rothe
2019	J	`jnl`	Duplication monotonicity in the allocation of indivisible goods. AI Commun. Benno Kuckuck, Jörg Rothe
2019	—	`conf`	Optimizing Social Welfare in Social Networks. ADT Pascal Lange, Jörg Rothe
2019	—	`conf`	Refugee Allocation in the Setting of Hedonic Games. ADT Benno Kuckuck, Jörg Rothe, Anke Weißenfeld
2019	A	`conf`	Stability in FEN-Hedonic Games for Single-Player Deviations. AAMAS Anna Maria Kerkmann, Jörg Rothe
2019	B	`conf`	The Complexity of Online Bribery in Sequential Elections (Extended Abstract). TARK Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2019	J	`jnl`	The Complexity of Online Bribery in Sequential Elections. CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2018	J	`jnl`	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. Tobias Heinen, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe
2018	J	`jnl`	Borda-induced hedonic games with friends, enemies, and neutral players. Math. Soc. Sci. Jörg Rothe, Hilmar Schadrack, Lena Schend
2018	J	`jnl`	Bounds on the Cost of Stabilizing a Cooperative Game. J. Artif. Intell. Res. Yoram Bachrach, Edith Elkind, Enrico Malizia, Reshef Meir, Dmitrii V. Pasechnik, Jeffrey S. Rosenschein, Jörg Rothe, Michael Zuckerman
2018	Misc	`conf`	Complexity of Shift Bribery in Hare, Coombs, Baldwin, and Nanson Elections. ISAIM Cynthia Maushagen, Marc Neveling, Jörg Rothe, Ann-Kathrin Selker
2018	A	`conf`	Complexity of Shift Bribery in Iterative Elections. AAMAS Cynthia Maushagen, Marc Neveling, Jörg Rothe, Ann-Kathrin Selker
2018	A*	`conf`	Complexity of Verification in Incomplete Argumentation Frameworks. AAAI Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack
2018	J	`jnl`	Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections. Ann. Math. Artif. Intell. Cynthia Maushagen, Jörg Rothe
2018	C	`conf`	Credulous and Skeptical Acceptance in Incomplete Argumentation Frameworks. COMMA Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe
2018	—	`conf`	Monotonicity, Duplication Monotonicity, and Pareto Optimality in the Scoring-Based Allocation of Indivisible Goods. AT Benno Kuckuck, Jörg Rothe
2018	A	`conf`	Sequential Allocation Rules are Separable: Refuting a Conjecture on Scoring-Based Allocation of Indivisible Goods. AAMAS Benno Kuckuck, Jörg Rothe
2018	J	`jnl`	Strategy-proofness of scoring allocation correspondences for indivisible goods. Soc. Choice Welf. Nhan-Tam Nguyen, Dorothea Baumeister, Jörg Rothe
2018	Misc	`conf`	The Price to Pay for Forgoing Normalization in Fair Division of Indivisible Goods. ISAIM Pascal Lange, Nhan-Tam Nguyen, Jörg Rothe
2018	J	`jnl`	Verification in incomplete argumentation frameworks. Artif. Intell. Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack
2017	—	`ed.`	Algorithmic Decision Theory - 5th International Conference, ADT 2017, Luxembourg, Luxembourg, October 25-27, 2017, Proceedings ADT Jörg Rothe
2017	A	`conf`	Approximate Solutions To Max-Min Fair and Proportionally Fair Allocations of Indivisible Goods. AAMAS Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe
2017	—	`conf`	Closing the Gap of Control Complexity in Borda Elections: Solving ten open cases. ICTCS/CILC Marc Neveling, Jörg Rothe
2017	A	`conf`	Complexity of Control by Partition of Voters and of Voter Groups in Veto and Other Scoring Protocols. AAMAS Cynthia Maushagen, Jörg Rothe
2017	J	`jnl`	Path-Disruption Games: Bribery and a Probabilistic Model. Theory Comput. Syst. Anja Rey, Jörg Rothe, Adrian Marple
2017	J	`jnl`	Positional scoring-based allocation of indivisible goods. Auton. Agents Multi Agent Syst. Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe, Abdallah Saffidine
2017	A*	`conf`	Solving Seven Open Problems of Offline and Online Control in Borda Elections. AAAI Marc Neveling, Jörg Rothe
2017	J	`jnl`	The complexity of controlling candidate-sequential elections. Theor. Comput. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2017	J	`jnl`	The complexity of online voter control in sequential elections. Auton. Agents Multi Agent Syst. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2016	A	`conf`	Altruistic Hedonic Games. AAMAS Nhan-Tam Nguyen, Anja Rey, Lisa Rey, Jörg Rothe, Lena Schend
2016	—	`ch.`	Cake-Cutting: Fair Division of Divisible Goods. Economics and Computation Claudia Lindner, Jörg Rothe
2016	A	`conf`	Complexity of Control by Partitioning Veto and Maximin Elections and of Control by Adding Candidates to Plurality Elections. ECAI Cynthia Maushagen, Jörg Rothe
2016	Misc	`conf`	Complexity of Control by Partitioning Veto and Maximin Elections. ISAIM Cynthia Maushagen, Jörg Rothe
2016	—	`ch.`	Control and Bribery in Voting. Handbook of Computational Social Choice Piotr Faliszewski, Jörg Rothe
2016	—	`ch.`	Cooperative Game Theory. Economics and Computation Edith Elkind, Jörg Rothe
2016	—	`conf`	Cost of Stability and Least Core in Path-Disruption Games. STAIRS Victor Persien, Anja Rey, Jörg Rothe
2016	—	`book`	Economics and Computation, An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division Economics and Computation Jörg Rothe
2016	—	`ch.`	Fair Division of Indivisible Goods. Economics and Computation Jérôme Lang, Jörg Rothe
2016	—	`ch.`	Judgment Aggregation. Economics and Computation Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe
2016	A	`conf`	Local Fairness in Hedonic Games via Individual Threshold Coalitions. AAMAS Nhan-Tam Nguyen, Jörg Rothe
2016	—	`ch.`	Noncooperative Game Theory. Economics and Computation Piotr Faliszewski, Irene Rothe, Jörg Rothe
2016	—	`ch.`	Playing, Voting, and Dividing. Economics and Computation Jörg Rothe
2016	—	`ch.`	Preference Aggregation by Voting. Economics and Computation Dorothea Baumeister, Jörg Rothe
2016	B	`conf`	Structural Control in Weighted Voting Games. MFCS Anja Rey, Jörg Rothe
2016	A	`conf`	Structural Control in Weighted Voting Games: (Extended Abstract). AAMAS Anja Rey, Jörg Rothe
2016	—	`ch.`	The Complexity of Manipulative Actions in Single-Peaked Societies. Economics and Computation Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2016	J	`jnl`	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. Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend
2015	—	`conf`	Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types. ADT Dorothea Baumeister, Jörg Rothe, Ann-Kathrin Selker
2015	J	`jnl`	Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules. Math. Soc. Sci. Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe
2015	J	`jnl`	Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting. Auton. Agents Multi Agent Syst. Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend
2015	J	`jnl`	Control complexity in Bucklin and fallback voting: A theoretical analysis. J. Comput. Syst. Sci. Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend
2015	J	`jnl`	Control complexity in Bucklin and fallback voting: An experimental analysis. J. Comput. Syst. Sci. Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend
2015	—	`conf`	Fairness and Rank-Weighted Utilitarianism in Resource Allocation. ADT Tobias Heinen, Nhan-Tam Nguyen, Jörg Rothe
2015	A	`conf`	Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds. AAMAS Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend
2015	A*	`conf`	Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods. IJCAI Nhan-Tam Nguyen, Dorothea Baumeister, Jörg Rothe
2015	—	`conf`	Verification in Argument-Incomplete Argumentation Frameworks. ADT Dorothea Baumeister, Jörg Rothe, Hilmar Schadrack
2015	—	`conf`	Verification in Attack-Incomplete Argumentation Frameworks. ADT Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe
2014	A	`conf`	Bribery in multiple-adversary path-disruption games is hard for the second level of the polynomial hierarchy. AAMAS Adrian Marple, Anja Rey, Jörg Rothe
2014	A	`conf`	Complexity of manipulation, bribery, and campaign management in bucklin and fallback voting. AAMAS Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend
2014	J	`jnl`	Computational complexity and approximability of social welfare optimization in multiagent resource allocation. Auton. Agents Multi Agent Syst. Nhan-Tam Nguyen, Trung Thanh Nguyen, Magnus Roos, Jörg Rothe
2014	B	`conf`	False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time. LATIN Anja Rey, Jörg Rothe
2014	J	`jnl`	False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time. J. Artif. Intell. Res. Anja Rey, Jörg Rothe
2014	J	`jnl`	Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods. Discret. Appl. Math. Trung Thanh Nguyen, Jörg Rothe
2014	A	`conf`	Scoring Rules for the Allocation of Indivisible Goods. ECAI Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe
2014	—	`conf`	The Margin of Victory in Schulze, Cup, and Copeland Elections: Complexity of the Regular and Exact Variants. STAIRS Yannick Reisch, Jörg Rothe, Lena Schend
2014	J	`jnl`	The complexity of online manipulation of sequential elections. J. Comput. Syst. Sci. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2014	J	`jnl`	The complexity of probabilistic lobbying. Discret. Optim. Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Jörg Rothe
2014	Misc	`conf`	Toward the Complexity of the Existence of Wonderfully Stable Partitions and Strictly Core Stable Coalition Structures in Hedonic Games. ISAIM Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend
2013	—	`conf`	A Richer Understanding of the Complexity of Election Systems. Fundamental Problems in Computing Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2013	J	`jnl`	A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation. Ann. Math. Artif. Intell. Trung Thanh Nguyen, Magnus Roos, Jörg Rothe
2013	J	`jnl`	Algorithms, approximation, and empirical studies in behavioral and computational social choice - Preface. Ann. Math. Artif. Intell. Judy Goldsmith, Jörg Rothe
2013	J	`jnl`	Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey. Ann. Math. Artif. Intell. Jörg Rothe, Lena Schend
2013	J	`jnl`	Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting. CoRR Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend
2013	—	`conf`	Computational Aspects of Manipulation and Control in Judgment Aggregation. ADT Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe
2013	A	`conf`	Envy-ratio and average-nash social welfare optimization in multiagent resource allocation. AAMAS Trung Thanh Nguyen, Jörg Rothe
2013	J	`jnl`	False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time CoRR Anja Rey, Jörg Rothe
2013	—	`conf`	How to Decrease the Degree of Envy in Allocations of Indivisible Goods. ADT Trung Thanh Nguyen, Jörg Rothe
2013	J	`jnl`	The Complexity of Computing Minimal Unidirectional Covering Sets. Theory Comput. Syst. Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe
2013	B	`conf`	The Complexity of Online Manipulation of Sequential Elections. TARK Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2013	J	`jnl`	The Complexity of Online Manipulation of Sequential Elections. CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	Misc	`conf`	A Survey of Approximability and Inapproximability Results for Social Welfare Optimization in Multiagent Resource Allocation. ISAIM Trung Thanh Nguyen, Magnus Roos, Jörg Rothe
2012	A	`conf`	Campaigns for lazy voters: truncated ballots. AAMAS Dorothea Baumeister, Piotr Faliszewski, Jérôme Lang, Jörg Rothe
2012	—	`conf`	Complexity and Approximability of Egalitarian Nash Product Social Welfare Optimization in Multiagent Resource Allocation. STAIRS Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe
2012	A	`conf`	Complexity and approximability of social welfare optimization in multiagent resource allocation. AAMAS Nhan-Tam Nguyen, Trung Thanh Nguyen, Magnus Roos, Jörg Rothe
2012	J	`jnl`	Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach CoRR Jörg Rothe, Lena Schend
2012	B	`conf`	Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach. SEA Jörg Rothe, Lena Schend
2012	—	`conf`	Control in Judgment Aggregation. STAIRS Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe
2012	J	`jnl`	Controlling Candidate-Sequential Elections CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	A	`conf`	Controlling Candidate-Sequential Elections. ECAI Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	Misc	`conf`	Exact Optimization of Social Welfare by the Nash Product is DP-Complete. ISAIM Nhan-Tam Nguyen, Magnus Roos, Jörg Rothe
2012	J	`jnl`	Online Voter Control in Sequential Elections CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	A	`conf`	Online Voter Control in Sequential Elections. ECAI Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	A	`conf`	Probabilistic Path-Disruption Games. ECAI Anja Rey, Jörg Rothe
2012	—	`conf`	Probabilistic Path-Disruption Games. STAIRS Anja Rey, Jörg Rothe
2012	J	`jnl`	Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules. Inf. Process. Lett. Dorothea Baumeister, Jörg Rothe
2012	J	`jnl`	The Complexity of Online Manipulation of Sequential Elections CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2012	A	`conf`	The Possible Winner Problem with Uncertain Weights. ECAI Dorothea Baumeister, Magnus Roos, Jörg Rothe, Lena Schend, Lirong Xia
2012	Misc	`conf`	Typical-Case Challenges to Complexity Shields That Are Supposed to Protect Elections Against Manipulation and Control: A Survey. ISAIM Jörg Rothe, Lena Schend
2011	—	`conf`	Bribery in Path-Disruption Games. ADT Anja Rey, Jörg Rothe
2011	A	`conf`	Computational complexity of two variants of the possible winner problem. AAMAS Dorothea Baumeister, Magnus Roos, Jörg Rothe
2011	J	`jnl`	Control Complexity in Bucklin and Fallback Voting CoRR Gábor Erdélyi, Michael R. Fellows, Lena Piras, Jörg Rothe
2011	—	`book`	Einführung in Computational Social Choice: Individuelle Strategien und kollektive Entscheidungen beim Spielen, Wählen und Teilen. Jörg Rothe, Dorothea Baumeister, Claudia Lindner, Irene Rothe
2011	—	`conf`	How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation. ADT Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe
2011	A*	`conf`	How to Calibrate the Scores of Biased Reviewers by Quadratic Programming. AAAI Magnus Roos, Jörg Rothe, Björn Scheuermann
2011	J	`jnl`	Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules CoRR Dorothea Baumeister, Jörg Rothe
2011	A	`conf`	The complexity of voter partition in Bucklin and fallback voting: solving three open problems. AAMAS Gábor Erdélyi, Lena Piras, Jörg Rothe
2011	J	`jnl`	The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Inf. Comput. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2010	J	`jnl`	Bucklin Voting is Broadly Resistant to Control CoRR Gábor Erdélyi, Lena Piras, Jörg Rothe
2010	A	`conf`	Complexity of Merging and Splitting for the Probabilistic Banzhaf Power Index in Weighted Voting Games. ECAI Anja Rey, Jörg Rothe
2010	A	`conf`	Complexity of social welfare optimization in multiagent resource allocation. AAMAS Magnus Roos, Jörg Rothe
2010	J	`jnl`	Control Complexity in Fallback Voting CoRR Gábor Erdélyi, Lena Piras, Jörg Rothe
2010	—	`conf`	Control Complexity in Fallback Voting. CATS Gábor Erdélyi, Jörg Rothe
2010	—	`book`	Exakte Algorithmen für schwere Graphenprobleme. Frank Gurski, Irene Rothe, Jörg Rothe, Egon Wanke
2010	—	`conf`	Merging and Splitting for Power Indices in Weighted Voting Games and Network Flow Games on Hypergraphs. STAIRS Anja Rey, Jörg Rothe
2010	A	`conf`	Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. ECAI Dorothea Baumeister, Jörg Rothe
2010	C	`conf`	The Complexity of Computing Minimal Unidirectional Covering Sets. CIAC Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe
2009	J	`jnl`	Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP CoRR Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jörg Rothe
2009	J	`jnl`	Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols CoRR Claudia Lindner, Jörg Rothe
2009	—	`conf`	Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols. WINE Claudia Lindner, Jörg Rothe
2009	J	`jnl`	Editorial: Math. Log. Quart. 4/2009. Math. Log. Q. Paul W. Goldberg, Jörg Rothe
2009	J	`jnl`	Frequency of correctness versus average polynomial time. Inf. Process. Lett. Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2009	J	`jnl`	Generalized juntas and NP-hard sets. Theor. Comput. Sci. Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2009	J	`jnl`	Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. Math. Log. Q. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2009	J	`jnl`	Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. J. Artif. Intell. Res. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2009	J	`jnl`	Satisfiability Parsimoniously Reduces to the Tantrix Fundam. Informaticae Dorothea Baumeister, Jörg Rothe
2009	J	`jnl`	Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control. Math. Log. Q. Gábor Erdélyi, Markus Nowak, Jörg Rothe
2009	J	`jnl`	The Complexity of Probabilistic Lobbying CoRR Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe
2009	—	`conf`	The Complexity of Probabilistic Lobbying. ADT Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe
2009	J	`jnl`	The Cost of Stability in Coalitional Games CoRR Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein
2009	B	`conf`	The Cost of Stability in Coalitional Games. SAGT Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein
2009	J	`jnl`	The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2009	—	`conf`	The cost of stability in weighted voting games. AAMAS (2) Yoram Bachrach, Reshef Meir, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein
2009	B	`conf`	The shield that never was: societies with single-peaked preferences are more open to manipulation and control. TARK Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2009	J	`jnl`	The three-color and two-color Tantrix Inf. Comput. Dorothea Baumeister, Jörg Rothe
2008	C	`conf`	Copeland Voting Fully Resists Constructive Control. AAIM Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2008	J	`jnl`	Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions. Theor. Comput. Sci. Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena
2008	J	`jnl`	Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas CoRR Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2008	—	`book`	Komplexitätstheorie und Kryptologie. Eine Einführung in Kryptokomplexität. Jörg Rothe
2008	J	`jnl`	Llull and Copeland Voting Computationally Resist Bribery and Control CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2008	B	`conf`	Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control. MFCS Gábor Erdélyi, Markus Nowak, Jörg Rothe
2008	J	`jnl`	Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control CoRR Gábor Erdélyi, Markus Nowak, Jörg Rothe
2008	C	`conf`	The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions. LATA Dorothea Baumeister, Jörg Rothe
2007	J	`jnl`	An improved exact algorithm for the domatic number problem. Inf. Process. Lett. Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto
2007	J	`jnl`	Anyone but him: The complexity of precluding an alternative. Artif. Intell. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2007	J	`jnl`	Copeland Voting Fully Resists Constructive Control CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2007	A*	`conf`	Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. IJCAI Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2007	A*	`conf`	Llull and Copeland Voting Broadly Resist Bribery and Control. AAAI Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2007	B	`conf`	On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. FCT Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2007	J	`jnl`	On Approximating Optimal Weighted Lobbying, and Frequency of Correctness versus Average-Case Polynomial Time CoRR Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2007	J	`jnl`	Quantum cryptography: A survey. ACM Comput. Surv. Dagmar Bruß, Gábor Erdélyi, Tim Meyer, Tobias Riege, Jörg Rothe
2007	J	`jnl`	Review of "Complexity and Cryptography: An Introduction by John Talbot and Dominic Welsh", Cambridge University Press, 2006, 292 pages. SIGACT News Jörg Rothe
2007	C	`conf`	Satisfiability Parsimoniously Reduces to the Tantrix MCU Dorothea Baumeister, Jörg Rothe
2007	J	`jnl`	Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem CoRR Dorothea Baumeister, Jörg Rothe
2007	J	`jnl`	The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions CoRR Dorothea Baumeister, Jörg Rothe
2006	J	`jnl`	A Richer Understanding of the Complexity of Election Systems CoRR Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2006	J	`jnl`	An Improved Exact Algorithm for the Domatic Number Problem CoRR Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto
2006	J	`jnl`	Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey. J. Univers. Comput. Sci. Tobias Riege, Jörg Rothe
2006	J	`jnl`	Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems. Electron. Colloquium Comput. Complex. Tobias Riege, Jörg Rothe
2006	J	`jnl`	Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem. Theory Comput. Syst. Tobias Riege, Jörg Rothe
2006	J	`jnl`	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. Jörg Rothe, Hiroki Arimura
2006	J	`jnl`	Hybrid Elections Broaden Complexity-Theoretic Resistance to Control CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2006	J	`jnl`	If P neq NP then some strongly noninvertible functions are invertible. Theor. Comput. Sci. Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
2006	J	`jnl`	Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem. Electron. Colloquium Comput. Complex. Tobias Riege, Jörg Rothe
2006	J	`jnl`	Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem. J. Univers. Comput. Sci. Tobias Riege, Jörg Rothe
2006	J	`jnl`	On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P. Inf. Process. Lett. André Große, Jörg Rothe, Gerd Wechsung
2006	J	`jnl`	Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. RAIRO Theor. Informatics Appl. Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
2005	B	`conf`	An Exact 2.9416 MFCS Tobias Riege, Jörg Rothe
2005	J	`jnl`	An Exact 2.9416 CoRR Tobias Riege, Jörg Rothe
2005	J	`jnl`	Anyone but Him: The Complexity of Precluding an Alternative CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2005	A*	`conf`	Anyone but Him: The Complexity of Precluding an Alternative. AAAI Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2005	—	`book`	Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. Jörg Rothe
2005	J	`jnl`	Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory CoRR Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena
2005	—	`conf`	Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory. ICTCS Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena
2005	J	`jnl`	Quantum Cryptography: A Survey Electron. Colloquium Comput. Complex. Gábor Erdélyi, Tobias Riege, Jörg Rothe
2004	—	`conf`	Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy. Algebraic Methods in Computational Complexity Jörg Rothe
2003	J	`jnl`	Exact Complexity of the Winner Problem for Young Elections. Theory Comput. Syst. Jörg Rothe, Holger Spakowski, Jörg Vogel
2003	J	`jnl`	Exact complexity of Exact-Four-Colorability. Inf. Process. Lett. Jörg Rothe
2002	J	`jnl`	Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem CoRR Tobias Riege, Jörg Rothe
2002	J	`jnl`	Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem Electron. Colloquium Comput. Complex. Tobias Riege, Jörg Rothe
2002	J	`jnl`	Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones. Theory Comput. Syst. André Große, Jörg Rothe, Gerd Wechsung
2002	—	`conf`	Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections. IFIP TCS Jörg Rothe, Holger Spakowski, Jörg Vogel
2002	J	`jnl`	Kryptographische Protokolle und Null-Information. Inform. Spektrum Jörg Rothe
2002	J	`jnl`	On characterizing the existence of partial one-way permutations. Inf. Process. Lett. Jörg Rothe, Lane A. Hemaspaandra
2002	B	`conf`	Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. WG Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
2002	J	`jnl`	Some facets of complexity theory and cryptography: A five-lecture tutorial. ACM Comput. Surv. Jörg Rothe
2001	J	`jnl`	A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs CoRR André Große, Jörg Rothe, Gerd Wechsung
2001	J	`jnl`	Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones CoRR André Große, Jörg Rothe, Gerd Wechsung
2001	J	`jnl`	Exact Complexity of Exact-Four-Colorability CoRR Jörg Rothe
2001	J	`jnl`	Exact Complexity of the Winner Problem for Young Elections CoRR Jörg Rothe, Holger Spakowski, Jörg Vogel
2001	B	`conf`	If P != NP Then Some Strongly Noninvertible Functions Are Invertible. FCT Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
2001	J	`jnl`	Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP CoRR Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
2001	—	`conf`	Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions. ICTCS André Große, Jörg Rothe, Gerd Wechsung
2001	J	`jnl`	Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial CoRR Jörg Rothe
2001	J	`jnl`	Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial Electron. Colloquium Comput. Complex. Jörg Rothe
2000	J	`jnl`	A second step towards complexity-theoretic analogs of Rice's Theorem. Theor. Comput. Sci. Lane A. Hemaspaandra, Jörg Rothe
2000	J	`jnl`	Characterizing the existence of one-way permutations. Theor. Comput. Sci. Lane A. Hemaspaandra, Jörg Rothe
2000	J	`jnl`	Corrigendum to "Upward separation for FewP and related classes". Inf. Process. Lett. Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe
2000	J	`jnl`	Heuristics Versus Completeness for Graph Coloring. Chic. J. Theor. Comput. Sci. Jörg Rothe
2000	J	`jnl`	If P \neq NP then Some Strongly Noninvertible Functions are Invertible CoRR Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
2000	J	`jnl`	Restrictive Acceptance Suffices for Equivalence Problems. LMS J. Comput. Math. Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
2000	J	`jnl`	Tally NP Sets and Easy Census Functions. Inf. Comput. Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe
1999	J	`jnl`	A Second Step Towards Complexity-Theoretic Analogs of Rice's Theorem CoRR Lane A. Hemaspaandra, Jörg Rothe
1999	J	`jnl`	Boolean Operations, Joins, and the Extended Low Hierarchy CoRR Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
1999	J	`jnl`	Characterizations of the Existence of Partial and Total One-Way Permutations CoRR Jörg Rothe, Lane A. Hemaspaandra
1999	J	`jnl`	Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory. J. Comput. Syst. Sci. Lane A. Hemaspaandra, Jörg Rothe
1999	J	`jnl`	Easy Sets and Hard Certificate Schemes CoRR Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
1999	J	`jnl`	Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1999	J	`jnl`	Immunity and simplicity for exact counting and other counting classes. RAIRO Theor. Informatics Appl. Jörg Rothe
1999	J	`jnl`	One-Way Functions in Worst-Case Cryptography: Algebraic and Security Properties CoRR Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe
1999	J	`jnl`	One-way functions in worst-case cryptography: algebraic and security properties are on the house. SIGACT News Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe
1999	J	`jnl`	Polynomial-Time Multi-Selectivity CoRR Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
1999	J	`jnl`	Raising NP Lower Bounds to Parallel NP Lower Bounds CoRR Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1999	J	`jnl`	Restrictive Acceptance Suffices for Equivalence Problems CoRR Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
1999	B	`conf`	Restrictive Acceptance Suffices for Equivalence Problems. FCT Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
1999	J	`jnl`	Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets CoRR Lane A. Hemaspaandra, Jörg Rothe
1998	B	`conf`	A Second Step Towards Circuit Complexity-Theoretic Analogs of Rice's Theorem. MFCS Lane A. Hemaspaandra, Jörg Rothe
1998	J	`jnl`	Boolean Operations, Joins, and the Extended Low Hierarchy. Theor. Comput. Sci. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
1998	J	`jnl`	Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function CoRR Lane A. Hemaspaandra, Jörg Rothe
1998	J	`jnl`	Immunity and Simplicity for Exact Counting and Other Counting Classes CoRR Jörg Rothe
1998	J	`jnl`	Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP. Inf. Process. Lett. Edith Hemaspaandra, Jörg Rothe
1998	J	`jnl`	Tally NP Sets and Easy Census Functions CoRR Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe
1998	B	`conf`	Tally NP Sets and Easy Census Functions. MFCS Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe
1997	J	`jnl`	Easy Sets and Hard Certificate Schemes. Acta Informatica Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
1997	A*	`conf`	Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP. ICALP Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1997	J	`jnl`	Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. J. ACM Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1997	C	`conf`	On Sets with Easy Certificates and the Existence of One-Way Permutations. CIAC Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
1997	J	`jnl`	Polynomial-Time Multi-Selectivity. J. Univers. Comput. Sci. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
1997	J	`jnl`	Raising NP lower bounds to parallel NP lower bounds. SIGACT News Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
1997	J	`jnl`	Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets. SIAM J. Comput. Lane A. Hemaspaandra, Jörg Rothe
1996	J	`jnl`	Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems Electron. Colloquium Comput. Complex. Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
1996	Misc	`conf`	The Join Can Lower Complexity. COCOON Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
1995	Misc	`conf`	Intersection Suffices for Boolean Hierarchy Equivalence. COCOON Lane A. Hemaspaandra, Jörg Rothe
1995	—	`—`	On some promise classes in structural complexity theory. Jörg Rothe
1994	J	`jnl`	Upward Separation for FewP and Related Classes. Inf. Process. Lett. Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe