Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jörg Rothe
@article{DBLP:journals/mst/GurskiRW24,
author = {Frank Gurski and
J{\"{o}}rg Rothe and
Robin Weishaupt},
title = {Stability, Vertex Stability, and Unfrozenness for Special Graph Classes},
journal = {Theory Comput. Syst.},
volume = {68},
number = {1},
pages = {75--102},
year = {2024},
url = {https://doi.org/10.1007/s00224-023-10149-5},
doi = {10.1007/S00224-023-10149-5},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/GurskiRW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/HoffjanKR24,
author = {Matthias Hoffjan and
Anna Maria Kerkmann and
J{\"{o}}rg Rothe},
editor = {Jos{\'{e}} A. Soto and
Andreas Wiese},
title = {Core Stability in Altruistic Coalition Formation Games},
booktitle = {{LATIN} 2024: Theoretical Informatics - 16th Latin American Symposium,
Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {14579},
pages = {320--333},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-55601-2\_21},
doi = {10.1007/978-3-031-55601-2\_21},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/HoffjanKR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/LaussmannRS24,
author = {Christian Lau{\ss}mann and
J{\"{o}}rg Rothe and
Tessa Seeger},
editor = {Henning Fernau and
Serge Gaspers and
Ralf Klasing},
title = {Apportionment with Thresholds: Strategic Campaigns are Easy in the
Top-Choice but Hard in the Second-Chance Mode},
booktitle = {{SOFSEM} 2024: Theory and Practice of Computer Science - 49th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2024, Cochem, Germany, February 19-23, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14519},
pages = {355--368},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-52113-3\_25},
doi = {10.1007/978-3-031-52113-3\_25},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/LaussmannRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/NguyenR23,
author = {Trung Thanh Nguyen and
J{\"{o}}rg Rothe},
title = {Fair and efficient allocation with few agent types, few item types,
or small value levels},
journal = {Artif. Intell.},
volume = {314},
pages = {103820},
year = {2023},
url = {https://doi.org/10.1016/j.artint.2022.103820},
doi = {10.1016/J.ARTINT.2022.103820},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ai/NguyenR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BaumeisterNRRSWX23,
author = {Dorothea Baumeister and
Marc Neveling and
Magnus Roos and
J{\"{o}}rg Rothe and
Lena Schend and
Robin Weishaupt and
Lirong Xia},
title = {The possible winner with uncertain weights problem},
journal = {J. Comput. Syst. Sci.},
volume = {138},
pages = {103464},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2023.103464},
doi = {10.1016/J.JCSS.2023.103464},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BaumeisterNRRSWX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/0001RT23,
author = {Joanna Kaczmarek and
J{\"{o}}rg Rothe and
Nimrod Talmon},
editor = {Kobi Gal and
Ann Now{\'{e}} and
Grzegorz J. Nalepa and
Roy Fairstein and
Roxana Radulescu},
title = {Complexity of Control by Adding or Deleting Edges in Graph-Restricted
Weighted Voting Games},
booktitle = {{ECAI} 2023 - 26th European Conference on Artificial Intelligence,
September 30 - October 4, 2023, Krak{\'{o}}w, Poland - Including
12th Conference on Prestigious Applications of Intelligent Systems
{(PAIS} 2023)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {372},
pages = {1190--1197},
publisher = {{IOS} Press},
year = {2023},
url = {https://doi.org/10.3233/FAIA230395},
doi = {10.3233/FAIA230395},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ecai/0001RT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/0004R23,
author = {Trung Thanh Nguyen and
J{\"{o}}rg Rothe},
title = {Complexity Results and Exact Algorithms for Fair Division of Indivisible
Items: {A} Survey},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {6732--6740},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/754},
doi = {10.24963/IJCAI.2023/754},
timestamp = {Mon, 28 Aug 2023 17:23:07 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/0004R23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-05674,
author = {Anna Maria Kerkmann and
Simon Cramer and
J{\"{o}}rg Rothe},
title = {Altruism in Coalition Formation Games},
journal = {CoRR},
volume = {abs/2301.05674},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.05674},
doi = {10.48550/ARXIV.2301.05674},
eprinttype = {arXiv},
eprint = {2301.05674},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-05674.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/MaushagenNRS22,
author = {Cynthia Maushagen and
Marc Neveling and
J{\"{o}}rg Rothe and
Ann{-}Kathrin Selker},
title = {Complexity of shift bribery for iterative voting rules},
journal = {Ann. Math. Artif. Intell.},
volume = {90},
number = {10},
pages = {1017--1054},
year = {2022},
url = {https://doi.org/10.1007/s10472-022-09802-5},
doi = {10.1007/S10472-022-09802-5},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amai/MaushagenNRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/KerkmannNRRRSW22,
author = {Anna Maria Kerkmann and
Nhan{-}Tam Nguyen and
Anja Rey and
Lisa Rey and
J{\"{o}}rg Rothe and
Lena Schend and
Alessandra Wiechers},
title = {Altruistic Hedonic Games},
journal = {J. Artif. Intell. Res.},
volume = {75},
year = {2022},
url = {https://doi.org/10.1613/jair.1.13706},
doi = {10.1613/JAIR.1.13706},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/KerkmannNRRRSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FreiHR22,
author = {Fabian Frei and
Edith Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Complexity of stability},
journal = {J. Comput. Syst. Sci.},
volume = {123},
pages = {103--121},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2021.07.001},
doi = {10.1016/J.JCSS.2021.07.001},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/FreiHR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HemaspaandraHR22,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {The complexity of online bribery in sequential elections},
journal = {J. Comput. Syst. Sci.},
volume = {127},
pages = {66--90},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2022.01.006},
doi = {10.1016/J.JCSS.2022.01.006},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/HemaspaandraHR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BrandesLR22,
author = {Ulrik Brandes and
Christian Lau{\ss}mann and
J{\"{o}}rg Rothe},
editor = {Piotr Faliszewski and
Viviana Mascardi and
Catherine Pelachaud and
Matthew E. Taylor},
title = {Voting for Centrality},
booktitle = {21st International Conference on Autonomous Agents and Multiagent
Systems, {AAMAS} 2022, Auckland, New Zealand, May 9-13, 2022},
pages = {1554--1556},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
{(IFAAMAS)}},
year = {2022},
url = {https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p1554.pdf},
doi = {10.5555/3535850.3536032},
timestamp = {Mon, 18 Jul 2022 17:13:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/BrandesLR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/KerkmannR22,
author = {Anna Maria Kerkmann and
J{\"{o}}rg Rothe},
editor = {Piotr Faliszewski and
Viviana Mascardi and
Catherine Pelachaud and
Matthew E. Taylor},
title = {Popularity and Strict Popularity in Altruistic Hedonic Games and Minimum-Based
Altruistic Hedonic Games},
booktitle = {21st International Conference on Autonomous Agents and Multiagent
Systems, {AAMAS} 2022, Auckland, New Zealand, May 9-13, 2022},
pages = {1657--1659},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
{(IFAAMAS)}},
year = {2022},
url = {https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p1657.pdf},
doi = {10.5555/3535850.3536067},
timestamp = {Mon, 18 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/KerkmannR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/CramerKR22,
author = {Simon Cramer and
Anna Maria Kerkmann and
J{\"{o}}rg Rothe},
title = {Min-Based Altruism in Coalition Formation Games},
booktitle = {Proceedings of the International Symposium on Artificial Intelligence
and Mathematics 2022 {(ISAIM} 2022), Fort Lauderdale, Florida, USA,
January 3-5, 2022},
year = {2022},
url = {https://isaim2022.cs.ou.edu/papers/ISAIM2022\_Games\_Cramer\_et\_al.pdf},
timestamp = {Wed, 20 Mar 2024 17:48:41 +0100},
biburl = {https://dblp.org/rec/conf/isaim/CramerKR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/KaczmarekR22,
author = {Joanna Kaczmarek and
J{\"{o}}rg Rothe},
title = {Controlling Weighted Voting Games by Deleting or Adding Players with
or without Changing the Quota},
booktitle = {Proceedings of the International Symposium on Artificial Intelligence
and Mathematics 2022 {(ISAIM} 2022), Fort Lauderdale, Florida, USA,
January 3-5, 2022},
year = {2022},
url = {https://isaim2022.cs.ou.edu/papers/ISAIM2022\_Games\_Kaczmarek\_Rothe.pdf},
timestamp = {Wed, 20 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaim/KaczmarekR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/KaczmarekR22,
author = {Joanna Kaczmarek and
J{\"{o}}rg Rothe},
editor = {Cristina Bazgan and
Henning Fernau},
title = {Controlling Weighted Voting Games by Deleting or Adding Players with
or Without Changing the Quota},
booktitle = {Combinatorial Algorithms - 33rd International Workshop, {IWOCA} 2022,
Trier, Germany, June 7-9, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13270},
pages = {355--368},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06678-8\_26},
doi = {10.1007/978-3-031-06678-8\_26},
timestamp = {Wed, 03 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/KaczmarekR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/eumas/2022,
editor = {Dorothea Baumeister and
J{\"{o}}rg Rothe},
title = {Multi-Agent Systems - 19th European Conference, {EUMAS} 2022, D{\"{u}}sseldorf,
Germany, September 14-16, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13442},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20614-6},
doi = {10.1007/978-3-031-20614-6},
isbn = {978-3-031-20613-9},
timestamp = {Wed, 21 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/eumas/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/ErdelyiNRRYZ21,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Marc Neveling and
Christian Reger and
J{\"{o}}rg Rothe and
Yongjie Yang and
Roman Zorn},
title = {Towards completing the puzzle: complexity of control by replacing,
adding, and deleting candidates or voters},
journal = {Auton. Agents Multi Agent Syst.},
volume = {35},
number = {2},
pages = {41},
year = {2021},
url = {https://doi.org/10.1007/s10458-021-09523-9},
doi = {10.1007/S10458-021-09523-9},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aamas/ErdelyiNRRYZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/BaumeisterJNNR21,
author = {Dorothea Baumeister and
Matti J{\"{a}}rvisalo and
Daniel Neugebauer and
Andreas Niskanen and
J{\"{o}}rg Rothe},
title = {Acceptance in incomplete argumentation frameworks},
journal = {Artif. Intell.},
volume = {295},
pages = {103470},
year = {2021},
url = {https://doi.org/10.1016/j.artint.2021.103470},
doi = {10.1016/J.ARTINT.2021.103470},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/BaumeisterJNNR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/NevelingR21,
author = {Marc Neveling and
J{\"{o}}rg Rothe},
title = {Control complexity in Borda elections: Solving all open cases of offline
control and some cases of online control},
journal = {Artif. Intell.},
volume = {298},
pages = {103508},
year = {2021},
url = {https://doi.org/10.1016/j.artint.2021.103508},
doi = {10.1016/J.ARTINT.2021.103508},
timestamp = {Thu, 05 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/NevelingR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/expert/SkibaNR21,
author = {Kenneth Skiba and
Daniel Neugebauer and
J{\"{o}}rg Rothe},
title = {Complexity of Nonempty Existence Problems in Incomplete Argumentation
Frameworks},
journal = {{IEEE} Intell. Syst.},
volume = {36},
number = {2},
pages = {13--24},
year = {2021},
url = {https://doi.org/10.1109/MIS.2020.3046782},
doi = {10.1109/MIS.2020.3046782},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/expert/SkibaNR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/flap/BaumeisterNR21,
author = {Dorothea Baumeister and
Daniel Neugebauer and
J{\"{o}}rg Rothe},
title = {Collective Acceptability in Abstract Argumentation},
journal = {{FLAP}},
volume = {8},
number = {6},
pages = {1503--1542},
year = {2021},
url = {https://collegepublications.co.uk/ifcolog/?00048},
timestamp = {Fri, 27 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/flap/BaumeisterNR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NguyenR21,
author = {Trung Thanh Nguyen and
J{\"{o}}rg Rothe},
title = {Improved bi-criteria approximation schemes for load balancing on unrelated
machines with cost constraints},
journal = {Theor. Comput. Sci.},
volume = {858},
pages = {35--48},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2020.12.022},
doi = {10.1016/J.TCS.2020.12.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NguyenR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KerkmannNR21,
author = {Anna Maria Kerkmann and
Nhan{-}Tam Nguyen and
J{\"{o}}rg Rothe},
title = {Local fairness in hedonic games via individual threshold coalitions},
journal = {Theor. Comput. Sci.},
volume = {877},
pages = {1--17},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.03.027},
doi = {10.1016/J.TCS.2021.03.027},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KerkmannNR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/Rothe21,
author = {J{\"{o}}rg Rothe},
title = {Thou Shalt Love Thy Neighbor as Thyself When Thou Playest: Altruism
in Game Theory},
booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI}
2021, Thirty-Third Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9,
2021},
pages = {15070--15077},
publisher = {{AAAI} Press},
year = {2021},
url = {https://doi.org/10.1609/aaai.v35i17.17770},
doi = {10.1609/AAAI.V35I17.17770},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/Rothe21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/KaczmarekR21,
author = {Joanna Kaczmarek and
J{\"{o}}rg Rothe},
editor = {Dimitris Fotakis and
David R{\'{\i}}os Insua},
title = {Manipulation in Communication Structures of Graph-Restricted Weighted
Voting Games},
booktitle = {Algorithmic Decision Theory - 7th International Conference, {ADT}
2021, Toulouse, France, November 3-5, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13023},
pages = {194--208},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-87756-9\_13},
doi = {10.1007/978-3-030-87756-9\_13},
timestamp = {Mon, 06 Nov 2023 15:27:23 +0100},
biburl = {https://dblp.org/rec/conf/aldt/KaczmarekR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecsqaru/NeugebauerRS21,
author = {Daniel Neugebauer and
J{\"{o}}rg Rothe and
Kenneth Skiba},
editor = {Jirina Vejnarov{\'{a}} and
Nic Wilson},
title = {Complexity of Nonemptiness in Control Argumentation Frameworks},
booktitle = {Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- 16th European Conference, {ECSQARU} 2021, Prague, Czech Republic,
September 21-24, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12897},
pages = {117--129},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86772-0\_9},
doi = {10.1007/978-3-030-86772-0\_9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ecsqaru/NeugebauerRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/NevelingRW21,
author = {Marc Neveling and
J{\"{o}}rg Rothe and
Robin Weishaupt},
editor = {Evripidis Bampis and
Aris Pagourtzis},
title = {The Possible Winner Problem with Uncertain Weights Revisited},
booktitle = {Fundamentals of Computation Theory - 23rd International Symposium,
{FCT} 2021, Athens, Greece, September 12-15, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12867},
pages = {399--412},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86593-1\_28},
doi = {10.1007/978-3-030-86593-1\_28},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/NevelingRW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/WeishauptR21,
author = {Robin Weishaupt and
J{\"{o}}rg Rothe},
editor = {Claudio Sacerdoti Coen and
Ivano Salvo},
title = {Stability of Special Graph Classes},
booktitle = {Proceedings of the 22nd Italian Conference on Theoretical Computer
Science, Bologna, Italy, September 13-15, 2021},
series = {{CEUR} Workshop Proceedings},
volume = {3072},
pages = {234--248},
publisher = {CEUR-WS.org},
year = {2021},
url = {https://ceur-ws.org/Vol-3072/paper20.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:17 +0100},
biburl = {https://dblp.org/rec/conf/ictcs/WeishauptR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-01496,
author = {Robin Weishaupt and
J{\"{o}}rg Rothe},
title = {Stability of Special Graph Classes},
journal = {CoRR},
volume = {abs/2106.01496},
year = {2021},
url = {https://arxiv.org/abs/2106.01496},
eprinttype = {arXiv},
eprint = {2106.01496},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-01496.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-05402,
author = {Peter Kern and
Daniel Neugebauer and
J{\"{o}}rg Rothe and
Ren{\'{e}} L. Schilling and
Dietrich Stoyan and
Robin Weishaupt},
title = {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},
journal = {CoRR},
volume = {abs/2111.05402},
year = {2021},
url = {https://arxiv.org/abs/2111.05402},
eprinttype = {arXiv},
eprint = {2111.05402},
timestamp = {Tue, 16 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-05402.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/ElkindGRR21,
author = {Edith Elkind and
Judy Goldsmith and
Anja Rey and
J{\"{o}}rg Rothe},
title = {Coalition Formation Games (Dagstuhl Seminar 21331)},
journal = {Dagstuhl Reports},
volume = {11},
number = {7},
pages = {1--15},
year = {2021},
url = {https://doi.org/10.4230/DagRep.11.7.1},
doi = {10.4230/DAGREP.11.7.1},
timestamp = {Thu, 23 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/ElkindGRR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/LangeNR20,
author = {Pascal Lange and
Nhan{-}Tam Nguyen and
J{\"{o}}rg Rothe},
title = {The price to pay for forgoing normalization in fair division of indivisible
goods},
journal = {Ann. Math. Artif. Intell.},
volume = {88},
number = {7},
pages = {817--832},
year = {2020},
url = {https://doi.org/10.1007/s10472-019-09659-1},
doi = {10.1007/S10472-019-09659-1},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/LangeNR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/KerkmannLRRSS20,
author = {Anna Maria Kerkmann and
J{\'{e}}r{\^{o}}me Lang and
Anja Rey and
J{\"{o}}rg Rothe and
Hilmar Schadrack and
Lena Schend},
title = {Hedonic Games with Ordinal Preferences and Thresholds},
journal = {J. Artif. Intell. Res.},
volume = {67},
pages = {705--756},
year = {2020},
url = {https://doi.org/10.1613/jair.1.11531},
doi = {10.1613/JAIR.1.11531},
timestamp = {Wed, 15 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/KerkmannLRRSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BaumeisterEERS20,
author = {Dorothea Baumeister and
G{\'{a}}bor Erd{\'{e}}lyi and
Olivia Johanna Erd{\'{e}}lyi and
J{\"{o}}rg Rothe and
Ann{-}Kathrin Selker},
title = {Complexity of control in judgment aggregation for uniform premise-based
quota rules},
journal = {J. Comput. Syst. Sci.},
volume = {112},
pages = {13--33},
year = {2020},
url = {https://doi.org/10.1016/j.jcss.2020.03.001},
doi = {10.1016/J.JCSS.2020.03.001},
timestamp = {Wed, 27 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BaumeisterEERS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/NiskanenNJR20,
author = {Andreas Niskanen and
Daniel Neugebauer and
Matti J{\"{a}}rvisalo and
J{\"{o}}rg Rothe},
title = {Deciding Acceptance in Incomplete Argumentation Frameworks},
booktitle = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI}
2020, The Thirty-Second Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2020, New York, NY, USA,
February 7-12, 2020},
pages = {2942--2949},
publisher = {{AAAI} Press},
year = {2020},
url = {https://doi.org/10.1609/aaai.v34i03.5686},
doi = {10.1609/AAAI.V34I03.5686},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/NiskanenNJR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/NevelingR20,
author = {Marc Neveling and
J{\"{o}}rg Rothe},
editor = {Amal El Fallah Seghrouchni and
Gita Sukthankar and
Bo An and
Neil Yorke{-}Smith},
title = {The Complexity of Cloning Candidates in Multiwinner Elections},
booktitle = {Proceedings of the 19th International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} '20, Auckland, New Zealand, May 9-13,
2020},
pages = {922--930},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
year = {2020},
url = {https://dl.acm.org/doi/10.5555/3398761.3398869},
doi = {10.5555/3398761.3398869},
timestamp = {Tue, 26 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/NevelingR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BaumeisterHR20,
author = {Dorothea Baumeister and
Tobias Hogrebe and
J{\"{o}}rg Rothe},
editor = {Amal El Fallah Seghrouchni and
Gita Sukthankar and
Bo An and
Neil Yorke{-}Smith},
title = {Towards Reality: Smoothed Analysis in Computational Social Choice},
booktitle = {Proceedings of the 19th International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} '20, Auckland, New Zealand, May 9-13,
2020},
pages = {1691--1695},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
year = {2020},
url = {https://dl.acm.org/doi/10.5555/3398761.3398955},
doi = {10.5555/3398761.3398955},
timestamp = {Tue, 26 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/BaumeisterHR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/NevelingRZ20,
author = {Marc Neveling and
J{\"{o}}rg Rothe and
Roman Zorn},
editor = {Henning Fernau},
title = {The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections
by Replacing Candidates or Voters},
booktitle = {Computer Science - Theory and Applications - 15th International Computer
Science Symposium in Russia, {CSR} 2020, Yekaterinburg, Russia, June
29 - July 3, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12159},
pages = {314--327},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-50026-9\_23},
doi = {10.1007/978-3-030-50026-9\_23},
timestamp = {Mon, 22 Jun 2020 16:07:02 +0200},
biburl = {https://dblp.org/rec/conf/csr/NevelingRZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/MaushagenR20,
author = {Cynthia Maushagen and
J{\"{o}}rg Rothe},
editor = {Giuseppe De Giacomo and
Alejandro Catal{\'{a}} and
Bistra Dilkina and
Michela Milano and
Sen{\'{e}}n Barro and
Alberto Bugar{\'{\i}}n and
J{\'{e}}r{\^{o}}me Lang},
title = {The Last Voting Rule Is Home: Complexity of Control by Partition of
Candidates or Voters in Maximin Elections},
booktitle = {{ECAI} 2020 - 24th European Conference on Artificial Intelligence,
29 August-8 September 2020, Santiago de Compostela, Spain, August
29 - September 8, 2020 - Including 10th Conference on Prestigious
Applications of Artificial Intelligence {(PAIS} 2020)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {325},
pages = {163--170},
publisher = {{IOS} Press},
year = {2020},
url = {https://doi.org/10.3233/FAIA200089},
doi = {10.3233/FAIA200089},
timestamp = {Fri, 09 Apr 2021 18:50:05 +0200},
biburl = {https://dblp.org/rec/conf/ecai/MaushagenR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/SkibaNR20,
author = {Kenneth Skiba and
Daniel Neugebauer and
J{\"{o}}rg Rothe},
editor = {Giuseppe De Giacomo and
Alejandro Catal{\'{a}} and
Bistra Dilkina and
Michela Milano and
Sen{\'{e}}n Barro and
Alberto Bugar{\'{\i}}n and
J{\'{e}}r{\^{o}}me Lang},
title = {Complexity of Possible and Necessary Existence Problems in Abstract
Argumentation},
booktitle = {{ECAI} 2020 - 24th European Conference on Artificial Intelligence,
29 August-8 September 2020, Santiago de Compostela, Spain, August
29 - September 8, 2020 - Including 10th Conference on Prestigious
Applications of Artificial Intelligence {(PAIS} 2020)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {325},
pages = {897--904},
publisher = {{IOS} Press},
year = {2020},
url = {https://doi.org/10.3233/FAIA200181},
doi = {10.3233/FAIA200181},
timestamp = {Fri, 29 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ecai/SkibaNR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/WiechersR20,
author = {Alessandra Wiechers and
J{\"{o}}rg Rothe},
editor = {Sebastian Rudolph and
Goreti Marreiros},
title = {Stability in Minimization-Based Altruistic Hedonic Games},
booktitle = {Proceedings of the 9th European Starting {AI} Researchers' Symposium
2020 co-located with 24th European Conference on Artificial Intelligence
{(ECAI} 2020), Santiago Compostela, Spain, August, 2020},
series = {{CEUR} Workshop Proceedings},
volume = {2655},
publisher = {CEUR-WS.org},
year = {2020},
url = {https://ceur-ws.org/Vol-2655/paper3.pdf},
timestamp = {Fri, 10 Mar 2023 16:22:14 +0100},
biburl = {https://dblp.org/rec/conf/ecai/WiechersR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/0004R20,
author = {Trung Thanh Nguyen and
J{\"{o}}rg Rothe},
editor = {Christian Bessiere},
title = {Approximate Pareto Set for Fair and Efficient Allocation: Few Agent
Types or Few Resource Types},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI} 2020},
pages = {290--296},
publisher = {ijcai.org},
year = {2020},
url = {https://doi.org/10.24963/ijcai.2020/41},
doi = {10.24963/IJCAI.2020/41},
timestamp = {Mon, 20 Jul 2020 12:38:52 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/0004R20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/KerkmannR20,
author = {Anna Maria Kerkmann and
J{\"{o}}rg Rothe},
editor = {Christian Bessiere},
title = {Altruism in Coalition Formation Games},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI} 2020},
pages = {347--353},
publisher = {ijcai.org},
year = {2020},
url = {https://doi.org/10.24963/ijcai.2020/49},
doi = {10.24963/IJCAI.2020/49},
timestamp = {Mon, 13 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/KerkmannR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/0004R20,
author = {Trung Thanh Nguyen and
J{\"{o}}rg Rothe},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated
Machines with Costs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.14},
doi = {10.4230/LIPICS.ISAAC.2020.14},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/isaac/0004R20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FreiHR20,
author = {Fabian Frei and
Edith Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Complexity of Stability},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {19:1--19:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.19},
doi = {10.4230/LIPICS.ISAAC.2020.19},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FreiHR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/KerkmannR20,
author = {Anna Maria Kerkmann and
J{\"{o}}rg Rothe},
title = {Altruism in Coalition Formation Games},
booktitle = {International Symposium on Artificial Intelligence and Mathematics,
{ISAIM} 2020, Fort Lauderdale, Florida, USA, January 6-8, 2020},
year = {2020},
url = {http://isaim2020.cs.ou.edu/papers/ISAIM2020\_Kerkmann\_Rothe.pdf},
timestamp = {Wed, 20 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaim/KerkmannR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/NevelingRZ20,
author = {Marc Neveling and
J{\"{o}}rg Rothe and
Roman Zorn},
title = {The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections
by Replacing Candidates or Voters},
booktitle = {International Symposium on Artificial Intelligence and Mathematics,
{ISAIM} 2020, Fort Lauderdale, Florida, USA, January 6-8, 2020},
year = {2020},
url = {http://isaim2020.cs.ou.edu/papers/ISAIM2020\_Neveling\_etal.pdf},
timestamp = {Wed, 20 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaim/NevelingRZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aicom/KuckuckR19,
author = {Benno Kuckuck and
J{\"{o}}rg Rothe},
title = {Duplication monotonicity in the allocation of indivisible goods},
journal = {{AI} Commun.},
volume = {32},
number = {4},
pages = {253--270},
year = {2019},
url = {https://doi.org/10.3233/AIC-190613},
doi = {10.3233/AIC-190613},
timestamp = {Fri, 18 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aicom/KuckuckR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/Rothe19,
author = {J{\"{o}}rg Rothe},
title = {Borda Count in Collective Decision Making: {A} Summary of Recent Results},
booktitle = {The Thirty-Third {AAAI} Conference on Artificial Intelligence, {AAAI}
2019, The Thirty-First Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2019, The Ninth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2019, Honolulu, Hawaii,
USA, January 27 - February 1, 2019},
pages = {9830--9836},
publisher = {{AAAI} Press},
year = {2019},
url = {https://doi.org/10.1609/aaai.v33i01.33019830},
doi = {10.1609/AAAI.V33I01.33019830},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/Rothe19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/KuckuckRW19,
author = {Benno Kuckuck and
J{\"{o}}rg Rothe and
Anke Wei{\ss}enfeld},
editor = {Sasa Pekec and
Kristen Brent Venable},
title = {Refugee Allocation in the Setting of Hedonic Games},
booktitle = {Algorithmic Decision Theory - 6th International Conference, {ADT}
2019, Durham, NC, USA, October 25-27, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11834},
pages = {65--80},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-31489-7\_5},
doi = {10.1007/978-3-030-31489-7\_5},
timestamp = {Thu, 10 Oct 2019 19:48:37 +0200},
biburl = {https://dblp.org/rec/conf/aldt/KuckuckRW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/LangeR19,
author = {Pascal Lange and
J{\"{o}}rg Rothe},
editor = {Sasa Pekec and
Kristen Brent Venable},
title = {Optimizing Social Welfare in Social Networks},
booktitle = {Algorithmic Decision Theory - 6th International Conference, {ADT}
2019, Durham, NC, USA, October 25-27, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11834},
pages = {81--96},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-31489-7\_6},
doi = {10.1007/978-3-030-31489-7\_6},
timestamp = {Thu, 10 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aldt/LangeR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/KerkmannR19,
author = {Anna Maria Kerkmann and
J{\"{o}}rg Rothe},
editor = {Edith Elkind and
Manuela Veloso and
Noa Agmon and
Matthew E. Taylor},
title = {Stability in FEN-Hedonic Games for Single-Player Deviations},
booktitle = {Proceedings of the 18th International Conference on Autonomous Agents
and MultiAgent Systems, {AAMAS} '19, Montreal, QC, Canada, May 13-17,
2019},
pages = {891--899},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
year = {2019},
url = {http://dl.acm.org/citation.cfm?id=3331782},
timestamp = {Wed, 29 May 2019 16:36:58 +0200},
biburl = {https://dblp.org/rec/conf/atal/KerkmannR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/abs-1907-09108,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {Lawrence S. Moss},
title = {The Complexity of Online Bribery in Sequential Elections (Extended
Abstract)},
booktitle = {Proceedings Seventeenth Conference on Theoretical Aspects of Rationality
and Knowledge, {TARK} 2019, Toulouse, France, 17-19 July 2019},
series = {{EPTCS}},
volume = {297},
pages = {233--251},
year = {2019},
url = {https://doi.org/10.4204/EPTCS.297.16},
doi = {10.4204/EPTCS.297.16},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-09108.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-08308,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {The Complexity of Online Bribery in Sequential Elections},
journal = {CoRR},
volume = {abs/1906.08308},
year = {2019},
url = {http://arxiv.org/abs/1906.08308},
eprinttype = {arXiv},
eprint = {1906.08308},
timestamp = {Mon, 24 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-08308.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-00305,
author = {Fabian Frei and
Edith Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Complexity of Stability},
journal = {CoRR},
volume = {abs/1910.00305},
year = {2019},
url = {http://arxiv.org/abs/1910.00305},
eprinttype = {arXiv},
eprint = {1910.00305},
timestamp = {Fri, 04 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-00305.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/HeinenNNR18,
author = {Tobias Heinen and
Nhan{-}Tam Nguyen and
Trung Thanh Nguyen and
J{\"{o}}rg Rothe},
title = {Approximation and complexity of the optimization and existence problems
for maximin share, proportional share, and minimax share allocation
of indivisible goods},
journal = {Auton. Agents Multi Agent Syst.},
volume = {32},
number = {6},
pages = {741--778},
year = {2018},
url = {https://doi.org/10.1007/s10458-018-9393-0},
doi = {10.1007/S10458-018-9393-0},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aamas/HeinenNNR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/BaumeisterNRS18,
author = {Dorothea Baumeister and
Daniel Neugebauer and
J{\"{o}}rg Rothe and
Hilmar Schadrack},
title = {Verification in incomplete argumentation frameworks},
journal = {Artif. Intell.},
volume = {264},
pages = {1--26},
year = {2018},
url = {https://doi.org/10.1016/j.artint.2018.08.001},
doi = {10.1016/J.ARTINT.2018.08.001},
timestamp = {Wed, 19 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/BaumeisterNRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/MaushagenR18,
author = {Cynthia Maushagen and
J{\"{o}}rg Rothe},
title = {Complexity of control by partitioning veto elections and of control
by adding candidates to plurality elections},
journal = {Ann. Math. Artif. Intell.},
volume = {82},
number = {4},
pages = {219--244},
year = {2018},
url = {https://doi.org/10.1007/s10472-017-9565-7},
doi = {10.1007/S10472-017-9565-7},
timestamp = {Fri, 01 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/MaushagenR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/BachrachEMMPRRZ18,
author = {Yoram Bachrach and
Edith Elkind and
Enrico Malizia and
Reshef Meir and
Dmitrii V. Pasechnik and
Jeffrey S. Rosenschein and
J{\"{o}}rg Rothe and
Michael Zuckerman},
title = {Bounds on the Cost of Stabilizing a Cooperative Game},
journal = {J. Artif. Intell. Res.},
volume = {63},
pages = {987--1023},
year = {2018},
url = {https://doi.org/10.1613/jair.1.11270},
doi = {10.1613/JAIR.1.11270},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/BachrachEMMPRRZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mss/RotheSS18,
author = {J{\"{o}}rg Rothe and
Hilmar Schadrack and
Lena Schend},
title = {Borda-induced hedonic games with friends, enemies, and neutral players},
journal = {Math. Soc. Sci.},
volume = {96},
pages = {21--36},
year = {2018},
url = {https://doi.org/10.1016/j.mathsocsci.2018.08.003},
doi = {10.1016/J.MATHSOCSCI.2018.08.003},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mss/RotheSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scw/NguyenBR18,
author = {Nhan{-}Tam Nguyen and
Dorothea Baumeister and
J{\"{o}}rg Rothe},
title = {Strategy-proofness of scoring allocation correspondences for indivisible
goods},
journal = {Soc. Choice Welf.},
volume = {50},
number = {1},
pages = {101--122},
year = {2018},
url = {https://doi.org/10.1007/s00355-017-1075-3},
doi = {10.1007/S00355-017-1075-3},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scw/NguyenBR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/BaumeisterNRS18,
author = {Dorothea Baumeister and
Daniel Neugebauer and
J{\"{o}}rg Rothe and
Hilmar Schadrack},
editor = {Sheila A. McIlraith and
Kilian Q. Weinberger},
title = {Complexity of Verification in Incomplete Argumentation Frameworks},
booktitle = {Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence,
(AAAI-18), the 30th innovative Applications of Artificial Intelligence
(IAAI-18), and the 8th {AAAI} Symposium on Educational Advances in
Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February
2-7, 2018},
pages = {1753--1760},
publisher = {{AAAI} Press},
year = {2018},
url = {https://doi.org/10.1609/aaai.v32i1.11562},
doi = {10.1609/AAAI.V32I1.11562},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/BaumeisterNRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/at/KuckuckR18,
author = {Benno Kuckuck and
J{\"{o}}rg Rothe},
editor = {Marin Lujak},
title = {Monotonicity, Duplication Monotonicity, and Pareto Optimality in the
Scoring-Based Allocation of Indivisible Goods},
booktitle = {Agreement Technologies - 6th International Conference, {AT} 2018,
Bergen, Norway, December 6-7, 2018, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {11327},
pages = {173--189},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-17294-7\_13},
doi = {10.1007/978-3-030-17294-7\_13},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/at/KuckuckR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/KuckuckR18,
author = {Benno Kuckuck and
J{\"{o}}rg Rothe},
editor = {Elisabeth Andr{\'{e}} and
Sven Koenig and
Mehdi Dastani and
Gita Sukthankar},
title = {Sequential Allocation Rules are Separable: Refuting a Conjecture on
Scoring-Based Allocation of Indivisible Goods},
booktitle = {Proceedings of the 17th International Conference on Autonomous Agents
and MultiAgent Systems, {AAMAS} 2018, Stockholm, Sweden, July 10-15,
2018},
pages = {650--658},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC, {USA} / {ACM}},
year = {2018},
url = {http://dl.acm.org/citation.cfm?id=3237480},
timestamp = {Sat, 30 Sep 2023 09:34:53 +0200},
biburl = {https://dblp.org/rec/conf/atal/KuckuckR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/MaushagenNRS18,
author = {Cynthia Maushagen and
Marc Neveling and
J{\"{o}}rg Rothe and
Ann{-}Kathrin Selker},
editor = {Elisabeth Andr{\'{e}} and
Sven Koenig and
Mehdi Dastani and
Gita Sukthankar},
title = {Complexity of Shift Bribery in Iterative Elections},
booktitle = {Proceedings of the 17th International Conference on Autonomous Agents
and MultiAgent Systems, {AAMAS} 2018, Stockholm, Sweden, July 10-15,
2018},
pages = {1567--1575},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC, {USA} / {ACM}},
year = {2018},
url = {http://dl.acm.org/citation.cfm?id=3237933},
timestamp = {Mon, 16 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/MaushagenNRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/comma/BaumeisterNR18,
author = {Dorothea Baumeister and
Daniel Neugebauer and
J{\"{o}}rg Rothe},
editor = {Sanjay Modgil and
Katarzyna Budzynska and
John Lawrence},
title = {Credulous and Skeptical Acceptance in Incomplete Argumentation Frameworks},
booktitle = {Computational Models of Argument - Proceedings of {COMMA} 2018, Warsaw,
Poland, 12-14 September 2018},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {305},
pages = {181--192},
publisher = {{IOS} Press},
year = {2018},
url = {https://doi.org/10.3233/978-1-61499-906-5-181},
doi = {10.3233/978-1-61499-906-5-181},
timestamp = {Fri, 29 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/comma/BaumeisterNR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/LangeNR18,
author = {Pascal Lange and
Nhan{-}Tam Nguyen and
J{\"{o}}rg Rothe},
title = {The Price to Pay for Forgoing Normalization in Fair Division of Indivisible
Goods},
booktitle = {International Symposium on Artificial Intelligence and Mathematics,
{ISAIM} 2018, Fort Lauderdale, Florida, USA, January 3-5, 2018},
year = {2018},
url = {https://isaim2018.cs.ou.edu/papers/ISAIM2018\_Lange\_etal.pdf},
timestamp = {Wed, 20 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaim/LangeNR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/MaushagenNRS18,
author = {Cynthia Maushagen and
Marc Neveling and
J{\"{o}}rg Rothe and
Ann{-}Kathrin Selker},
title = {Complexity of Shift Bribery in Hare, Coombs, Baldwin, and Nanson Elections},
booktitle = {International Symposium on Artificial Intelligence and Mathematics,
{ISAIM} 2018, Fort Lauderdale, Florida, USA, January 3-5, 2018},
year = {2018},
url = {https://isaim2018.cs.ou.edu/papers/ISAIM2018\_Maushagen\_etal.pdf},
timestamp = {Wed, 20 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaim/MaushagenNRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/BaumeisterBLNNR17,
author = {Dorothea Baumeister and
Sylvain Bouveret and
J{\'{e}}r{\^{o}}me Lang and
Nhan{-}Tam Nguyen and
Trung Thanh Nguyen and
J{\"{o}}rg Rothe and
Abdallah Saffidine},
title = {Positional scoring-based allocation of indivisible goods},
journal = {Auton. Agents Multi Agent Syst.},
volume = {31},
number = {3},
pages = {628--655},
year = {2017},
url = {https://doi.org/10.1007/s10458-016-9340-x},
doi = {10.1007/S10458-016-9340-X},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aamas/BaumeisterBLNNR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/HemaspaandraHR17,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {The complexity of online voter control in sequential elections},
journal = {Auton. Agents Multi Agent Syst.},
volume = {31},
number = {5},
pages = {1055--1076},
year = {2017},
url = {https://doi.org/10.1007/s10458-016-9349-1},
doi = {10.1007/S10458-016-9349-1},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aamas/HemaspaandraHR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ReyRM17,
author = {Anja Rey and
J{\"{o}}rg Rothe and
Adrian Marple},
title = {Path-Disruption Games: Bribery and a Probabilistic Model},
journal = {Theory Comput. Syst.},
volume = {60},
number = {2},
pages = {222--252},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9669-1},
doi = {10.1007/S00224-016-9669-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ReyRM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HemaspaandraHR17,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {The complexity of controlling candidate-sequential elections},
journal = {Theor. Comput. Sci.},
volume = {678},
pages = {14--21},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.03.037},
doi = {10.1016/J.TCS.2017.03.037},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraHR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/NevelingR17,
author = {Marc Neveling and
J{\"{o}}rg Rothe},
editor = {Satinder Singh and
Shaul Markovitch},
title = {Solving Seven Open Problems of Offline and Online Control in Borda
Elections},
booktitle = {Proceedings of the Thirty-First {AAAI} Conference on Artificial Intelligence,
February 4-9, 2017, San Francisco, California, {USA}},
pages = {3029--3035},
publisher = {{AAAI} Press},
year = {2017},
url = {https://doi.org/10.1609/aaai.v31i1.10703},
doi = {10.1609/AAAI.V31I1.10703},
timestamp = {Mon, 04 Sep 2023 14:40:32 +0200},
biburl = {https://dblp.org/rec/conf/aaai/NevelingR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/Nguyen0R17,
author = {Nhan{-}Tam Nguyen and
Trung Thanh Nguyen and
J{\"{o}}rg Rothe},
editor = {Kate Larson and
Michael Winikoff and
Sanmay Das and
Edmund H. Durfee},
title = {Approximate Solutions To Max-Min Fair and Proportionally Fair Allocations
of Indivisible Goods},
booktitle = {Proceedings of the 16th Conference on Autonomous Agents and MultiAgent
Systems, {AAMAS} 2017, S{\~{a}}o Paulo, Brazil, May 8-12, 2017},
pages = {262--271},
publisher = {{ACM}},
year = {2017},
url = {http://dl.acm.org/citation.cfm?id=3091169},
timestamp = {Wed, 27 Sep 2017 07:24:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/Nguyen0R17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/MaushagenR17,
author = {Cynthia Maushagen and
J{\"{o}}rg Rothe},
editor = {Kate Larson and
Michael Winikoff and
Sanmay Das and
Edmund H. Durfee},
title = {Complexity of Control by Partition of Voters and of Voter Groups in
Veto and Other Scoring Protocols},
booktitle = {Proceedings of the 16th Conference on Autonomous Agents and MultiAgent
Systems, {AAMAS} 2017, S{\~{a}}o Paulo, Brazil, May 8-12, 2017},
pages = {615--623},
publisher = {{ACM}},
year = {2017},
url = {http://dl.acm.org/citation.cfm?id=3091214},
timestamp = {Thu, 11 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/MaushagenR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/NevelingR17,
author = {Marc Neveling and
J{\"{o}}rg Rothe},
editor = {Dario Della Monica and
Aniello Murano and
Sasha Rubin and
Luigi Sauro},
title = {Closing the Gap of Control Complexity in Borda Elections: Solving
ten open cases},
booktitle = {Joint Proceedings of the 18th Italian Conference on Theoretical Computer
Science and the 32nd Italian Conference on Computational Logic co-located
with the 2017 {IEEE} International Workshop on Measurements and Networking
{(2017} {IEEE} M{\&}N), Naples, Italy, September 26-28, 2017},
series = {{CEUR} Workshop Proceedings},
volume = {1949},
pages = {138--149},
publisher = {CEUR-WS.org},
year = {2017},
url = {https://ceur-ws.org/Vol-1949/ICTCSpaper12.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:17 +0100},
biburl = {https://dblp.org/rec/conf/ictcs/NevelingR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/aldt/2017,
editor = {J{\"{o}}rg Rothe},
title = {Algorithmic Decision Theory - 5th International Conference, {ADT}
2017, Luxembourg, Luxembourg, October 25-27, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10576},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-67504-6},
doi = {10.1007/978-3-319-67504-6},
isbn = {978-3-319-67503-9},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aldt/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/ReyRSS16,
author = {Anja Rey and
J{\"{o}}rg Rothe and
Hilmar Schadrack and
Lena Schend},
title = {Toward the complexity of the existence of wonderfully stable partitions
and strictly core stable coalition structures in enemy-oriented hedonic
games},
journal = {Ann. Math. Artif. Intell.},
volume = {77},
number = {3-4},
pages = {317--333},
year = {2016},
url = {https://doi.org/10.1007/s10472-015-9461-y},
doi = {10.1007/S10472-015-9461-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/ReyRSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/NguyenR16,
author = {Nhan{-}Tam Nguyen and
J{\"{o}}rg Rothe},
editor = {Catholijn M. Jonker and
Stacy Marsella and
John Thangarajah and
Karl Tuyls},
title = {Local Fairness in Hedonic Games via Individual Threshold Coalitions},
booktitle = {Proceedings of the 2016 International Conference on Autonomous Agents
{\&} Multiagent Systems, Singapore, May 9-13, 2016},
pages = {232--241},
publisher = {{ACM}},
year = {2016},
url = {http://dl.acm.org/citation.cfm?id=2936961},
timestamp = {Fri, 20 May 2016 20:33:29 +0200},
biburl = {https://dblp.org/rec/conf/atal/NguyenR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/NguyenRRRS16,
author = {Nhan{-}Tam Nguyen and
Anja Rey and
Lisa Rey and
J{\"{o}}rg Rothe and
Lena Schend},
editor = {Catholijn M. Jonker and
Stacy Marsella and
John Thangarajah and
Karl Tuyls},
title = {Altruistic Hedonic Games},
booktitle = {Proceedings of the 2016 International Conference on Autonomous Agents
{\&} Multiagent Systems, Singapore, May 9-13, 2016},
pages = {251--259},
publisher = {{ACM}},
year = {2016},
url = {http://dl.acm.org/citation.cfm?id=2936963},
timestamp = {Fri, 20 May 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/NguyenRRRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/ReyR16,
author = {Anja Rey and
J{\"{o}}rg Rothe},
editor = {Catholijn M. Jonker and
Stacy Marsella and
John Thangarajah and
Karl Tuyls},
title = {Structural Control in Weighted Voting Games: (Extended Abstract)},
booktitle = {Proceedings of the 2016 International Conference on Autonomous Agents
{\&} Multiagent Systems, Singapore, May 9-13, 2016},
pages = {1371--1372},
publisher = {{ACM}},
year = {2016},
url = {http://dl.acm.org/citation.cfm?id=2937165},
timestamp = {Fri, 20 May 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/ReyR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/MaushagenR16,
author = {Cynthia Maushagen and
J{\"{o}}rg Rothe},
editor = {Gal A. Kaminka and
Maria Fox and
Paolo Bouquet and
Eyke H{\"{u}}llermeier and
Virginia Dignum and
Frank Dignum and
Frank van Harmelen},
title = {Complexity of Control by Partitioning Veto and Maximin Elections and
of Control by Adding Candidates to Plurality Elections},
booktitle = {{ECAI} 2016 - 22nd European Conference on Artificial Intelligence,
29 August-2 September 2016, The Hague, The Netherlands - Including
Prestigious Applications of Artificial Intelligence {(PAIS} 2016)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {285},
pages = {277--285},
publisher = {{IOS} Press},
year = {2016},
url = {https://doi.org/10.3233/978-1-61499-672-9-277},
doi = {10.3233/978-1-61499-672-9-277},
timestamp = {Tue, 02 Nov 2021 15:59:05 +0100},
biburl = {https://dblp.org/rec/conf/ecai/MaushagenR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/MaushagenR16,
author = {Cynthia Maushagen and
J{\"{o}}rg Rothe},
title = {Complexity of Control by Partitioning Veto and Maximin Elections},
booktitle = {International Symposium on Artificial Intelligence and Mathematics,
{ISAIM} 2016, Fort Lauderdale, Florida, USA, January 4-6, 2016},
year = {2016},
url = {https://isaim2016.cs.ou.edu/papers/ISAIM2016\_Maushagen\_Rothe.pdf},
timestamp = {Wed, 20 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaim/MaushagenR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ReyR16,
author = {Anja Rey and
J{\"{o}}rg Rothe},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {Structural Control in Weighted Voting Games},
booktitle = {41st International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
series = {LIPIcs},
volume = {58},
pages = {80:1--80:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.80},
doi = {10.4230/LIPICS.MFCS.2016.80},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/ReyR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stairs/PersienRR16,
author = {Victor Persien and
Anja Rey and
J{\"{o}}rg Rothe},
editor = {David Pearce and
Helena Sofia Pinto},
title = {Cost of Stability and Least Core in Path-Disruption Games},
booktitle = {{STAIRS} 2016 - Proceedings of the Eighth European Starting {AI} Researcher
Symposium, The Hague, The Netherlands, August 29-30, 2016},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {284},
pages = {99--110},
publisher = {{IOS} Press},
year = {2016},
url = {https://doi.org/10.3233/978-1-61499-682-8-99},
doi = {10.3233/978-1-61499-682-8-99},
timestamp = {Mon, 01 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stairs/PersienRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/16/Rothe16,
author = {J{\"{o}}rg Rothe},
editor = {J{\"{o}}rg Rothe},
title = {Playing, Voting, and Dividing},
booktitle = {Economics and Computation, An Introduction to Algorithmic Game Theory,
Computational Social Choice, and Fair Division},
series = {Springer texts in business and economics},
pages = {1--37},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-47904-9\_1},
doi = {10.1007/978-3-662-47904-9\_1},
timestamp = {Sat, 03 Aug 2019 17:47:35 +0200},
biburl = {https://dblp.org/rec/books/sp/16/Rothe16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/16/FaliszewskiRR16,
author = {Piotr Faliszewski and
Irene Rothe and
J{\"{o}}rg Rothe},
editor = {J{\"{o}}rg Rothe},
title = {Noncooperative Game Theory},
booktitle = {Economics and Computation, An Introduction to Algorithmic Game Theory,
Computational Social Choice, and Fair Division},
series = {Springer texts in business and economics},
pages = {41--134},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-47904-9\_2},
doi = {10.1007/978-3-662-47904-9\_2},
timestamp = {Sat, 03 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/16/FaliszewskiRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/16/ElkindR16,
author = {Edith Elkind and
J{\"{o}}rg Rothe},
editor = {J{\"{o}}rg Rothe},
title = {Cooperative Game Theory},
booktitle = {Economics and Computation, An Introduction to Algorithmic Game Theory,
Computational Social Choice, and Fair Division},
series = {Springer texts in business and economics},
pages = {135--193},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-47904-9\_3},
doi = {10.1007/978-3-662-47904-9\_3},
timestamp = {Sat, 03 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/16/ElkindR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/16/BaumeisterR16,
author = {Dorothea Baumeister and
J{\"{o}}rg Rothe},
editor = {J{\"{o}}rg Rothe},
title = {Preference Aggregation by Voting},
booktitle = {Economics and Computation, An Introduction to Algorithmic Game Theory,
Computational Social Choice, and Fair Division},
series = {Springer texts in business and economics},
pages = {197--325},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-47904-9\_4},
doi = {10.1007/978-3-662-47904-9\_4},
timestamp = {Sat, 03 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/16/BaumeisterR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/16/HemaspaandraHR16,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {J{\"{o}}rg Rothe},
title = {The Complexity of Manipulative Actions in Single-Peaked Societies},
booktitle = {Economics and Computation, An Introduction to Algorithmic Game Theory,
Computational Social Choice, and Fair Division},
series = {Springer texts in business and economics},
pages = {327--360},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-47904-9\_5},
doi = {10.1007/978-3-662-47904-9\_5},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/16/HemaspaandraHR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/16/BaumeisterER16,
author = {Dorothea Baumeister and
G{\'{a}}bor Erd{\'{e}}lyi and
J{\"{o}}rg Rothe},
editor = {J{\"{o}}rg Rothe},
title = {Judgment Aggregation},
booktitle = {Economics and Computation, An Introduction to Algorithmic Game Theory,
Computational Social Choice, and Fair Division},
series = {Springer texts in business and economics},
pages = {361--391},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-47904-9\_6},
doi = {10.1007/978-3-662-47904-9\_6},
timestamp = {Sat, 03 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/16/BaumeisterER16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/16/LindnerR16,
author = {Claudia Lindner and
J{\"{o}}rg Rothe},
editor = {J{\"{o}}rg Rothe},
title = {Cake-Cutting: Fair Division of Divisible Goods},
booktitle = {Economics and Computation, An Introduction to Algorithmic Game Theory,
Computational Social Choice, and Fair Division},
series = {Springer texts in business and economics},
pages = {395--491},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-47904-9\_7},
doi = {10.1007/978-3-662-47904-9\_7},
timestamp = {Wed, 03 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/sp/16/LindnerR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/16/LangR16,
author = {J{\'{e}}r{\^{o}}me Lang and
J{\"{o}}rg Rothe},
editor = {J{\"{o}}rg Rothe},
title = {Fair Division of Indivisible Goods},
booktitle = {Economics and Computation, An Introduction to Algorithmic Game Theory,
Computational Social Choice, and Fair Division},
series = {Springer texts in business and economics},
pages = {493--550},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-47904-9\_8},
doi = {10.1007/978-3-662-47904-9\_8},
timestamp = {Sat, 03 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/16/LangR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/sp/R2016,
editor = {J{\"{o}}rg Rothe},
title = {Economics and Computation, An Introduction to Algorithmic Game Theory,
Computational Social Choice, and Fair Division},
series = {Springer texts in business and economics},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-47904-9},
doi = {10.1007/978-3-662-47904-9},
isbn = {978-3-662-47903-2},
timestamp = {Sat, 03 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/R2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/choice/FaliszewskiR16,
author = {Piotr Faliszewski and
J{\"{o}}rg Rothe},
editor = {Felix Brandt and
Vincent Conitzer and
Ulle Endriss and
J{\'{e}}r{\^{o}}me Lang and
Ariel D. Procaccia},
title = {Control and Bribery in Voting},
booktitle = {Handbook of Computational Social Choice},
pages = {146--168},
publisher = {Cambridge University Press},
year = {2016},
url = {https://doi.org/10.1017/CBO9781107446984.008},
doi = {10.1017/CBO9781107446984.008},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/choice/FaliszewskiR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/FaliszewskiRRS15,
author = {Piotr Faliszewski and
Yannick Reisch and
J{\"{o}}rg Rothe and
Lena Schend},
title = {Complexity of manipulation, bribery, and campaign management in Bucklin
and fallback voting},
journal = {Auton. Agents Multi Agent Syst.},
volume = {29},
number = {6},
pages = {1091--1124},
year = {2015},
url = {https://doi.org/10.1007/s10458-014-9277-x},
doi = {10.1007/S10458-014-9277-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aamas/FaliszewskiRRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ErdelyiFRS15,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Michael R. Fellows and
J{\"{o}}rg Rothe and
Lena Schend},
title = {Control complexity in Bucklin and fallback voting: {A} theoretical
analysis},
journal = {J. Comput. Syst. Sci.},
volume = {81},
number = {4},
pages = {632--660},
year = {2015},
url = {https://doi.org/10.1016/j.jcss.2014.11.002},
doi = {10.1016/J.JCSS.2014.11.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ErdelyiFRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ErdelyiFRS15a,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Michael R. Fellows and
J{\"{o}}rg Rothe and
Lena Schend},
title = {Control complexity in Bucklin and fallback voting: An experimental
analysis},
journal = {J. Comput. Syst. Sci.},
volume = {81},
number = {4},
pages = {661--670},
year = {2015},
url = {https://doi.org/10.1016/j.jcss.2014.11.003},
doi = {10.1016/J.JCSS.2014.11.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ErdelyiFRS15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mss/BaumeisterEER15,
author = {Dorothea Baumeister and
G{\'{a}}bor Erd{\'{e}}lyi and
Olivia Johanna Erd{\'{e}}lyi and
J{\"{o}}rg Rothe},
title = {Complexity of manipulation and bribery in judgment aggregation for
uniform premise-based quota rules},
journal = {Math. Soc. Sci.},
volume = {76},
pages = {19--30},
year = {2015},
url = {https://doi.org/10.1016/j.mathsocsci.2015.03.006},
doi = {10.1016/J.MATHSOCSCI.2015.03.006},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mss/BaumeisterEER15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/BaumeisterNR15,
author = {Dorothea Baumeister and
Daniel Neugebauer and
J{\"{o}}rg Rothe},
editor = {Toby Walsh},
title = {Verification in Attack-Incomplete Argumentation Frameworks},
booktitle = {Algorithmic Decision Theory - 4th International Conference, {ADT}
2015, Lexington, KY, USA, September 27-30, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9346},
pages = {341--358},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-23114-3\_21},
doi = {10.1007/978-3-319-23114-3\_21},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/aldt/BaumeisterNR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/BaumeisterRS15,
author = {Dorothea Baumeister and
J{\"{o}}rg Rothe and
Hilmar Schadrack},
editor = {Toby Walsh},
title = {Verification in Argument-Incomplete Argumentation Frameworks},
booktitle = {Algorithmic Decision Theory - 4th International Conference, {ADT}
2015, Lexington, KY, USA, September 27-30, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9346},
pages = {359--376},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-23114-3\_22},
doi = {10.1007/978-3-319-23114-3\_22},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aldt/BaumeisterRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/BaumeisterRS15a,
author = {Dorothea Baumeister and
J{\"{o}}rg Rothe and
Ann{-}Kathrin Selker},
editor = {Toby Walsh},
title = {Complexity of Bribery and Control for Uniform Premise-Based Quota
Rules Under Various Preference Types},
booktitle = {Algorithmic Decision Theory - 4th International Conference, {ADT}
2015, Lexington, KY, USA, September 27-30, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9346},
pages = {432--448},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-23114-3\_26},
doi = {10.1007/978-3-319-23114-3\_26},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aldt/BaumeisterRS15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/HeinenNR15,
author = {Tobias Heinen and
Nhan{-}Tam Nguyen and
J{\"{o}}rg Rothe},
editor = {Toby Walsh},
title = {Fairness and Rank-Weighted Utilitarianism in Resource Allocation},
booktitle = {Algorithmic Decision Theory - 4th International Conference, {ADT}
2015, Lexington, KY, USA, September 27-30, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9346},
pages = {521--536},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-23114-3\_31},
doi = {10.1007/978-3-319-23114-3\_31},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aldt/HeinenNR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/LangRRSS15,
author = {J{\'{e}}r{\^{o}}me Lang and
Anja Rey and
J{\"{o}}rg Rothe and
Hilmar Schadrack and
Lena Schend},
editor = {Gerhard Weiss and
Pinar Yolum and
Rafael H. Bordini and
Edith Elkind},
title = {Representing and Solving Hedonic Games with Ordinal Preferences and
Thresholds},
booktitle = {Proceedings of the 2015 International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} 2015, Istanbul, Turkey, May 4-8, 2015},
pages = {1229--1237},
publisher = {{ACM}},
year = {2015},
url = {http://dl.acm.org/citation.cfm?id=2773308},
timestamp = {Tue, 08 Mar 2022 10:12:47 +0100},
biburl = {https://dblp.org/rec/conf/atal/LangRRSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/NguyenBR15,
author = {Nhan{-}Tam Nguyen and
Dorothea Baumeister and
J{\"{o}}rg Rothe},
editor = {Qiang Yang and
Michael J. Wooldridge},
title = {Strategy-Proofness of Scoring Allocation Correspondences for Indivisible
Goods},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July
25-31, 2015},
pages = {1127--1133},
publisher = {{AAAI} Press},
year = {2015},
url = {http://ijcai.org/Abstract/15/163},
timestamp = {Tue, 20 Aug 2019 16:16:43 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/NguyenBR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/NguyenNRR14,
author = {Nhan{-}Tam Nguyen and
Trung Thanh Nguyen and
Magnus Roos and
J{\"{o}}rg Rothe},
title = {Computational complexity and approximability of social welfare optimization
in multiagent resource allocation},
journal = {Auton. Agents Multi Agent Syst.},
volume = {28},
number = {2},
pages = {256--289},
year = {2014},
url = {https://doi.org/10.1007/s10458-013-9224-2},
doi = {10.1007/S10458-013-9224-2},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aamas/NguyenNRR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/0004R14,
author = {Trung Thanh Nguyen and
J{\"{o}}rg Rothe},
title = {Minimizing envy and maximizing average Nash social welfare in the
allocation of indivisible goods},
journal = {Discret. Appl. Math.},
volume = {179},
pages = {54--68},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.09.010},
doi = {10.1016/J.DAM.2014.09.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/0004R14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/Binkele-RaibleEFGMR14,
author = {Daniel Binkele{-}Raible and
G{\'{a}}bor Erd{\'{e}}lyi and
Henning Fernau and
Judy Goldsmith and
Nicholas Mattei and
J{\"{o}}rg Rothe},
title = {The complexity of probabilistic lobbying},
journal = {Discret. Optim.},
volume = {11},
pages = {1--21},
year = {2014},
url = {https://doi.org/10.1016/j.disopt.2013.10.003},
doi = {10.1016/J.DISOPT.2013.10.003},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/Binkele-RaibleEFGMR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/ReyR14,
author = {Anja Rey and
J{\"{o}}rg Rothe},
title = {False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic
Polynomial Time},
journal = {J. Artif. Intell. Res.},
volume = {50},
pages = {573--601},
year = {2014},
url = {https://doi.org/10.1613/jair.4293},
doi = {10.1613/JAIR.4293},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/ReyR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HemaspaandraHR14,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {The complexity of online manipulation of sequential elections},
journal = {J. Comput. Syst. Sci.},
volume = {80},
number = {4},
pages = {697--710},
year = {2014},
url = {https://doi.org/10.1016/j.jcss.2013.10.001},
doi = {10.1016/J.JCSS.2013.10.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HemaspaandraHR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/FaliszewskiRRS14,
author = {Piotr Faliszewski and
Yannick Reisch and
J{\"{o}}rg Rothe and
Lena Schend},
editor = {Ana L. C. Bazzan and
Michael N. Huhns and
Alessio Lomuscio and
Paul Scerri},
title = {Complexity of manipulation, bribery, and campaign management in bucklin
and fallback voting},
booktitle = {International conference on Autonomous Agents and Multi-Agent Systems,
{AAMAS} '14, Paris, France, May 5-9, 2014},
pages = {1357--1358},
publisher = {{IFAAMAS/ACM}},
year = {2014},
url = {http://dl.acm.org/citation.cfm?id=2617471},
timestamp = {Thu, 25 Sep 2014 07:46:15 +0200},
biburl = {https://dblp.org/rec/conf/atal/FaliszewskiRRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/MarpleRR14,
author = {Adrian Marple and
Anja Rey and
J{\"{o}}rg Rothe},
editor = {Ana L. C. Bazzan and
Michael N. Huhns and
Alessio Lomuscio and
Paul Scerri},
title = {Bribery in multiple-adversary path-disruption games is hard for the
second level of the polynomial hierarchy},
booktitle = {International conference on Autonomous Agents and Multi-Agent Systems,
{AAMAS} '14, Paris, France, May 5-9, 2014},
pages = {1375--1376},
publisher = {{IFAAMAS/ACM}},
year = {2014},
url = {http://dl.acm.org/citation.cfm?id=2617480},
timestamp = {Thu, 25 Sep 2014 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/MarpleRR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/BaumeisterBLN0R14,
author = {Dorothea Baumeister and
Sylvain Bouveret and
J{\'{e}}r{\^{o}}me Lang and
Nhan{-}Tam Nguyen and
Trung Thanh Nguyen and
J{\"{o}}rg Rothe},
editor = {Torsten Schaub and
Gerhard Friedrich and
Barry O'Sullivan},
title = {Scoring Rules for the Allocation of Indivisible Goods},
booktitle = {{ECAI} 2014 - 21st European Conference on Artificial Intelligence,
18-22 August 2014, Prague, Czech Republic - Including Prestigious
Applications of Intelligent Systems {(PAIS} 2014)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {263},
pages = {75--80},
publisher = {{IOS} Press},
year = {2014},
url = {https://doi.org/10.3233/978-1-61499-419-0-75},
doi = {10.3233/978-1-61499-419-0-75},
timestamp = {Mon, 19 Jun 2023 16:36:09 +0200},
biburl = {https://dblp.org/rec/conf/ecai/BaumeisterBLN0R14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/ReyRSS14,
author = {Anja Rey and
J{\"{o}}rg Rothe and
Hilmar Schadrack and
Lena Schend},
title = {Toward the Complexity of the Existence of Wonderfully Stable Partitions
and Strictly Core Stable Coalition Structures in Hedonic Games},
booktitle = {International Symposium on Artificial Intelligence and Mathematics,
{ISAIM} 2014, Fort Lauderdale, FL, USA, January 6-8, 2014},
year = {2014},
url = {http://www.cs.uic.edu/pub/Isaim2014/WebPreferences/ISAIM2014\_CSC\_Rey\_etal.pdf},
timestamp = {Wed, 20 Mar 2024 17:48:47 +0100},
biburl = {https://dblp.org/rec/conf/isaim/ReyRSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/ReyR14,
author = {Anja Rey and
J{\"{o}}rg Rothe},
editor = {Alberto Pardo and
Alfredo Viola},
title = {False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic
Polynomial Time},
booktitle = {{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium,
Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8392},
pages = {60--71},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-642-54423-1\_6},
doi = {10.1007/978-3-642-54423-1\_6},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/ReyR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stairs/ReischRS14,
author = {Yannick Reisch and
J{\"{o}}rg Rothe and
Lena Schend},
editor = {Ulle Endriss and
Jo{\~{a}}o Leite},
title = {The Margin of Victory in Schulze, Cup, and Copeland Elections: Complexity
of the Regular and Exact Variants},
booktitle = {{STAIRS} 2014 - Proceedings of the 7th European Starting {AI} Researcher
Symposium, Prague, Czech Republic, August 18-22, 2014},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {264},
pages = {250--259},
publisher = {{IOS} Press},
year = {2014},
url = {https://doi.org/10.3233/978-1-61499-421-3-250},
doi = {10.3233/978-1-61499-421-3-250},
timestamp = {Mon, 01 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stairs/ReischRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/GoldsmithR13,
author = {Judy Goldsmith and
J{\"{o}}rg Rothe},
title = {Algorithms, approximation, and empirical studies in behavioral and
computational social choice - Preface},
journal = {Ann. Math. Artif. Intell.},
volume = {68},
number = {1-3},
pages = {3--4},
year = {2013},
url = {https://doi.org/10.1007/s10472-013-9380-8},
doi = {10.1007/S10472-013-9380-8},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/GoldsmithR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/NguyenRR13,
author = {Trung Thanh Nguyen and
Magnus Roos and
J{\"{o}}rg Rothe},
title = {A survey of approximability and inapproximability results for social
welfare optimization in multiagent resource allocation},
journal = {Ann. Math. Artif. Intell.},
volume = {68},
number = {1-3},
pages = {65--90},
year = {2013},
url = {https://doi.org/10.1007/s10472-012-9328-4},
doi = {10.1007/S10472-012-9328-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/NguyenRR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/RotheS13,
author = {J{\"{o}}rg Rothe and
Lena Schend},
title = {Challenges to complexity shields that are supposed to protect elections
against manipulation and control: a survey},
journal = {Ann. Math. Artif. Intell.},
volume = {68},
number = {1-3},
pages = {161--193},
year = {2013},
url = {https://doi.org/10.1007/s10472-013-9359-5},
doi = {10.1007/S10472-013-9359-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/RotheS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BaumeisterBF0R13,
author = {Dorothea Baumeister and
Felix Brandt and
Felix A. Fischer and
Jan Hoffmann and
J{\"{o}}rg Rothe},
title = {The Complexity of Computing Minimal Unidirectional Covering Sets},
journal = {Theory Comput. Syst.},
volume = {53},
number = {3},
pages = {467--502},
year = {2013},
url = {https://doi.org/10.1007/s00224-012-9437-9},
doi = {10.1007/S00224-012-9437-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BaumeisterBF0R13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/BaumeisterEER13,
author = {Dorothea Baumeister and
G{\'{a}}bor Erd{\'{e}}lyi and
Olivia Johanna Erd{\'{e}}lyi and
J{\"{o}}rg Rothe},
editor = {Patrice Perny and
Marc Pirlot and
Alexis Tsouki{\`{a}}s},
title = {Computational Aspects of Manipulation and Control in Judgment Aggregation},
booktitle = {Algorithmic Decision Theory - Third International Conference, {ADT}
2013, Bruxelles, Belgium, November 12-14, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8176},
pages = {71--85},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-41575-3\_6},
doi = {10.1007/978-3-642-41575-3\_6},
timestamp = {Mon, 03 Jan 2022 22:21:02 +0100},
biburl = {https://dblp.org/rec/conf/aldt/BaumeisterEER13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/NguyenR13,
author = {Trung Thanh Nguyen and
J{\"{o}}rg Rothe},
editor = {Patrice Perny and
Marc Pirlot and
Alexis Tsouki{\`{a}}s},
title = {How to Decrease the Degree of Envy in Allocations of Indivisible Goods},
booktitle = {Algorithmic Decision Theory - Third International Conference, {ADT}
2013, Bruxelles, Belgium, November 12-14, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8176},
pages = {271--284},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-41575-3\_21},
doi = {10.1007/978-3-642-41575-3\_21},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aldt/NguyenR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/0004R13,
author = {Trung Thanh Nguyen and
J{\"{o}}rg Rothe},
editor = {Maria L. Gini and
Onn Shehory and
Takayuki Ito and
Catholijn M. Jonker},
title = {Envy-ratio and average-nash social welfare optimization in multiagent
resource allocation},
booktitle = {International conference on Autonomous Agents and Multi-Agent Systems,
{AAMAS} '13, Saint Paul, MN, USA, May 6-10, 2013},
pages = {1139--1140},
publisher = {{IFAAMAS}},
year = {2013},
url = {http://dl.acm.org/citation.cfm?id=2485110},
timestamp = {Thu, 09 Sep 2021 16:09:54 +0200},
biburl = {https://dblp.org/rec/conf/atal/0004R13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/FaliszewskiHHR13,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {S. S. Ravi and
Sandeep K. Shukla},
title = {A Richer Understanding of the Complexity of Election Systems},
booktitle = {Fundamental Problems in Computing, Essays in Honor of Professor Daniel
J. Rosenkrantz},
pages = {375--406},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-1-4020-9688-4\_14},
doi = {10.1007/978-1-4020-9688-4\_14},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/FaliszewskiHHR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tark/HemaspaandraHR13,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {Burkhard C. Schipper},
title = {The Complexity of Online Manipulation of Sequential Elections},
booktitle = {Proceedings of the 14th Conference on Theoretical Aspects of Rationality
and Knowledge {(TARK} 2013), Chennai, India, January 7-9, 2013},
year = {2013},
url = {http://www.tark.org/proceedings/tark\_jan7\_13/p111-hemaspaandra.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tark/HemaspaandraHR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-1691,
author = {Anja Rey and
J{\"{o}}rg Rothe},
title = {False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic
Polynomial Time},
journal = {CoRR},
volume = {abs/1303.1691},
year = {2013},
url = {http://arxiv.org/abs/1303.1691},
eprinttype = {arXiv},
eprint = {1303.1691},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-1691.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FaliszewskiRRS13,
author = {Piotr Faliszewski and
Yannick Reisch and
J{\"{o}}rg Rothe and
Lena Schend},
title = {Complexity of Manipulation, Bribery, and Campaign Management in Bucklin
and Fallback Voting},
journal = {CoRR},
volume = {abs/1307.7322},
year = {2013},
url = {http://arxiv.org/abs/1307.7322},
eprinttype = {arXiv},
eprint = {1307.7322},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FaliszewskiRRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HemaspaandraHR13,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {The Complexity of Online Manipulation of Sequential Elections},
journal = {CoRR},
volume = {abs/1310.6997},
year = {2013},
url = {http://arxiv.org/abs/1310.6997},
eprinttype = {arXiv},
eprint = {1310.6997},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HemaspaandraHR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaumeisterR12,
author = {Dorothea Baumeister and
J{\"{o}}rg Rothe},
title = {Taking the final step to a full dichotomy of the possible winner problem
in pure scoring rules},
journal = {Inf. Process. Lett.},
volume = {112},
number = {5},
pages = {186--190},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.016},
doi = {10.1016/J.IPL.2011.11.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BaumeisterR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aamas/BaumeisterFLR12,
author = {Dorothea Baumeister and
Piotr Faliszewski and
J{\'{e}}r{\^{o}}me Lang and
J{\"{o}}rg Rothe},
editor = {Wiebe van der Hoek and
Lin Padgham and
Vincent Conitzer and
Michael Winikoff},
title = {Campaigns for lazy voters: truncated ballots},
booktitle = {International Conference on Autonomous Agents and Multiagent Systems,
{AAMAS} 2012, Valencia, Spain, June 4-8, 2012 {(3} Volumes)},
pages = {577--584},
publisher = {{IFAAMAS}},
year = {2012},
url = {http://dl.acm.org/citation.cfm?id=2343779},
timestamp = {Thu, 19 Mar 2015 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aamas/BaumeisterFLR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aamas/NguyenNRR12,
author = {Nhan{-}Tam Nguyen and
Trung Thanh Nguyen and
Magnus Roos and
J{\"{o}}rg Rothe},
editor = {Wiebe van der Hoek and
Lin Padgham and
Vincent Conitzer and
Michael Winikoff},
title = {Complexity and approximability of social welfare optimization in multiagent
resource allocation},
booktitle = {International Conference on Autonomous Agents and Multiagent Systems,
{AAMAS} 2012, Valencia, Spain, June 4-8, 2012 {(3} Volumes)},
pages = {1287--1288},
publisher = {{IFAAMAS}},
year = {2012},
url = {http://dl.acm.org/citation.cfm?id=2343967},
timestamp = {Thu, 19 Mar 2015 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aamas/NguyenNRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/BaumeisterRRSX12,
author = {Dorothea Baumeister and
Magnus Roos and
J{\"{o}}rg Rothe and
Lena Schend and
Lirong Xia},
editor = {Luc De Raedt and
Christian Bessiere and
Didier Dubois and
Patrick Doherty and
Paolo Frasconi and
Fredrik Heintz and
Peter J. F. Lucas},
title = {The Possible Winner Problem with Uncertain Weights},
booktitle = {{ECAI} 2012 - 20th European Conference on Artificial Intelligence.
Including Prestigious Applications of Artificial Intelligence {(PAIS-2012)}
System Demonstrations Track, Montpellier, France, August 27-31 , 2012},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {242},
pages = {133--138},
publisher = {{IOS} Press},
year = {2012},
url = {https://doi.org/10.3233/978-1-61499-098-7-133},
doi = {10.3233/978-1-61499-098-7-133},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ecai/BaumeisterRRSX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/HemaspaandraHR12,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {Luc De Raedt and
Christian Bessiere and
Didier Dubois and
Patrick Doherty and
Paolo Frasconi and
Fredrik Heintz and
Peter J. F. Lucas},
title = {Online Voter Control in Sequential Elections},
booktitle = {{ECAI} 2012 - 20th European Conference on Artificial Intelligence.
Including Prestigious Applications of Artificial Intelligence {(PAIS-2012)}
System Demonstrations Track, Montpellier, France, August 27-31 , 2012},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {242},
pages = {396--401},
publisher = {{IOS} Press},
year = {2012},
url = {https://doi.org/10.3233/978-1-61499-098-7-396},
doi = {10.3233/978-1-61499-098-7-396},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ecai/HemaspaandraHR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/HemaspaandraHR12a,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {Luc De Raedt and
Christian Bessiere and
Didier Dubois and
Patrick Doherty and
Paolo Frasconi and
Fredrik Heintz and
Peter J. F. Lucas},
title = {Controlling Candidate-Sequential Elections},
booktitle = {{ECAI} 2012 - 20th European Conference on Artificial Intelligence.
Including Prestigious Applications of Artificial Intelligence {(PAIS-2012)}
System Demonstrations Track, Montpellier, France, August 27-31 , 2012},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {242},
pages = {905--906},
publisher = {{IOS} Press},
year = {2012},
url = {https://doi.org/10.3233/978-1-61499-098-7-905},
doi = {10.3233/978-1-61499-098-7-905},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ecai/HemaspaandraHR12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/ReyR12,
author = {Anja Rey and
J{\"{o}}rg Rothe},
editor = {Luc De Raedt and
Christian Bessiere and
Didier Dubois and
Patrick Doherty and
Paolo Frasconi and
Fredrik Heintz and
Peter J. F. Lucas},
title = {Probabilistic Path-Disruption Games},
booktitle = {{ECAI} 2012 - 20th European Conference on Artificial Intelligence.
Including Prestigious Applications of Artificial Intelligence {(PAIS-2012)}
System Demonstrations Track, Montpellier, France, August 27-31 , 2012},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {242},
pages = {923--924},
publisher = {{IOS} Press},
year = {2012},
url = {https://doi.org/10.3233/978-1-61499-098-7-923},
doi = {10.3233/978-1-61499-098-7-923},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ecai/ReyR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/NguyenRR12,
author = {Nhan{-}Tam Nguyen and
Magnus Roos and
J{\"{o}}rg Rothe},
title = {Exact Optimization of Social Welfare by the Nash Product is DP-Complete},
booktitle = {International Symposium on Artificial Intelligence and Mathematics,
{ISAIM} 2012, Fort Lauderdale, Florida, USA, January 9-11, 2012},
year = {2012},
url = {http://www.cs.uic.edu/pub/Isaim2012/WebPreferences/ISAIM2012\_Nguyen\_etal.pdf},
timestamp = {Wed, 20 Mar 2024 17:48:48 +0100},
biburl = {https://dblp.org/rec/conf/isaim/NguyenRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/NguyenRR12a,
author = {Trung Thanh Nguyen and
Magnus Roos and
J{\"{o}}rg Rothe},
title = {A Survey of Approximability and Inapproximability Results for Social
Welfare Optimization in Multiagent Resource Allocation},
booktitle = {International Symposium on Artificial Intelligence and Mathematics,
{ISAIM} 2012, Fort Lauderdale, Florida, USA, January 9-11, 2012},
year = {2012},
url = {http://www.cs.uic.edu/pub/Isaim2012/WebPreferences/ISAIM2012\_ComSoc\_Nguyen\_etal.pdf},
timestamp = {Wed, 20 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaim/NguyenRR12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/RotheS12,
author = {J{\"{o}}rg Rothe and
Lena Schend},
title = {Typical-Case Challenges to Complexity Shields That Are Supposed to
Protect Elections Against Manipulation and Control: {A} Survey},
booktitle = {International Symposium on Artificial Intelligence and Mathematics,
{ISAIM} 2012, Fort Lauderdale, Florida, USA, January 9-11, 2012},
year = {2012},
url = {http://www.cs.uic.edu/pub/Isaim2012/WebPreferences/ISAIM2012\_ComSoc\_Rothe\_Schend.pdf},
timestamp = {Wed, 20 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaim/RotheS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stairs/BaumeisterEER12,
author = {Dorothea Baumeister and
G{\'{a}}bor Erd{\'{e}}lyi and
Olivia Johanna Erd{\'{e}}lyi and
J{\"{o}}rg Rothe},
editor = {Kristian Kersting and
Marc Toussaint},
title = {Control in Judgment Aggregation},
booktitle = {{STAIRS} 2012 - Proceedings of the Sixth Starting {AI} Researchers'
Symposium, Montpellier, France, 27-28 August 2012},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {241},
pages = {23--34},
publisher = {{IOS} Press},
year = {2012},
url = {https://doi.org/10.3233/978-1-61499-096-3-23},
doi = {10.3233/978-1-61499-096-3-23},
timestamp = {Mon, 01 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stairs/BaumeisterEER12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stairs/Nguyen0R12,
author = {Nhan{-}Tam Nguyen and
Trung Thanh Nguyen and
J{\"{o}}rg Rothe},
editor = {Kristian Kersting and
Marc Toussaint},
title = {Complexity and Approximability of Egalitarian Nash Product Social
Welfare Optimization in Multiagent Resource Allocation},
booktitle = {{STAIRS} 2012 - Proceedings of the Sixth Starting {AI} Researchers'
Symposium, Montpellier, France, 27-28 August 2012},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {241},
pages = {204--215},
publisher = {{IOS} Press},
year = {2012},
url = {https://doi.org/10.3233/978-1-61499-096-3-204},
doi = {10.3233/978-1-61499-096-3-204},
timestamp = {Mon, 01 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stairs/Nguyen0R12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stairs/ReyR12,
author = {Anja Rey and
J{\"{o}}rg Rothe},
editor = {Kristian Kersting and
Marc Toussaint},
title = {Probabilistic Path-Disruption Games},
booktitle = {{STAIRS} 2012 - Proceedings of the Sixth Starting {AI} Researchers'
Symposium, Montpellier, France, 27-28 August 2012},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {241},
pages = {264--269},
publisher = {{IOS} Press},
year = {2012},
url = {https://doi.org/10.3233/978-1-61499-096-3-264},
doi = {10.3233/978-1-61499-096-3-264},
timestamp = {Mon, 01 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stairs/ReyR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/RotheS12,
author = {J{\"{o}}rg Rothe and
Lena Schend},
editor = {Ralf Klasing},
title = {Control Complexity in Bucklin, Fallback, and Plurality Voting: An
Experimental Approach},
booktitle = {Experimental Algorithms - 11th International Symposium, {SEA} 2012,
Bordeaux, France, June 7-9, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7276},
pages = {356--368},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30850-5\_31},
doi = {10.1007/978-3-642-30850-5\_31},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/wea/RotheS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-6649,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Controlling Candidate-Sequential Elections},
journal = {CoRR},
volume = {abs/1202.6649},
year = {2012},
url = {http://arxiv.org/abs/1202.6649},
eprinttype = {arXiv},
eprint = {1202.6649},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-6649.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-6655,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {The Complexity of Online Manipulation of Sequential Elections},
journal = {CoRR},
volume = {abs/1202.6655},
year = {2012},
url = {http://arxiv.org/abs/1202.6655},
eprinttype = {arXiv},
eprint = {1202.6655},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-6655.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-0411,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Online Voter Control in Sequential Elections},
journal = {CoRR},
volume = {abs/1203.0411},
year = {2012},
url = {http://arxiv.org/abs/1203.0411},
eprinttype = {arXiv},
eprint = {1203.0411},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-0411.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-3967,
author = {J{\"{o}}rg Rothe and
Lena Schend},
title = {Control Complexity in Bucklin, Fallback, and Plurality Voting: An
Experimental Approach},
journal = {CoRR},
volume = {abs/1203.3967},
year = {2012},
url = {http://arxiv.org/abs/1203.3967},
eprinttype = {arXiv},
eprint = {1203.3967},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-3967.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/sp/Rothe11,
author = {J{\"{o}}rg Rothe and
Dorothea Baumeister and
Claudia Lindner and
Irene Rothe},
title = {Einf{\"{u}}hrung in Computational Social Choice: Individuelle
Strategien und kollektive Entscheidungen beim Spielen, W{\"{a}}hlen
und Teilen},
publisher = {Springer Spektrum},
year = {2011},
isbn = {978-3-8274-2570-6},
timestamp = {Wed, 03 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/sp/Rothe11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/FaliszewskiHHR11,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {The shield that never was: Societies with single-peaked preferences
are more open to manipulation and control},
journal = {Inf. Comput.},
volume = {209},
number = {2},
pages = {89--107},
year = {2011},
url = {https://doi.org/10.1016/j.ic.2010.09.001},
doi = {10.1016/J.IC.2010.09.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/FaliszewskiHHR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/RoosRS11,
author = {Magnus Roos and
J{\"{o}}rg Rothe and
Bj{\"{o}}rn Scheuermann},
editor = {Wolfram Burgard and
Dan Roth},
title = {How to Calibrate the Scores of Biased Reviewers by Quadratic Programming},
booktitle = {Proceedings of the Twenty-Fifth {AAAI} Conference on Artificial Intelligence,
{AAAI} 2011, San Francisco, California, USA, August 7-11, 2011},
pages = {255--260},
publisher = {{AAAI} Press},
year = {2011},
url = {https://doi.org/10.1609/aaai.v25i1.7847},
doi = {10.1609/AAAI.V25I1.7847},
timestamp = {Mon, 04 Sep 2023 16:05:54 +0200},
biburl = {https://dblp.org/rec/conf/aaai/RoosRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/BaumeisterER11,
author = {Dorothea Baumeister and
G{\'{a}}bor Erd{\'{e}}lyi and
J{\"{o}}rg Rothe},
editor = {Ronen I. Brafman and
Fred S. Roberts and
Alexis Tsouki{\`{a}}s},
title = {How Hard Is it to Bribe the Judges? {A} Study of the Complexity of
Bribery in Judgment Aggregation},
booktitle = {Algorithmic Decision Theory - Second International Conference, {ADT}
2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6992},
pages = {1--15},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-24873-3\_1},
doi = {10.1007/978-3-642-24873-3\_1},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/aldt/BaumeisterER11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/ReyR11,
author = {Anja Rey and
J{\"{o}}rg Rothe},
editor = {Ronen I. Brafman and
Fred S. Roberts and
Alexis Tsouki{\`{a}}s},
title = {Bribery in Path-Disruption Games},
booktitle = {Algorithmic Decision Theory - Second International Conference, {ADT}
2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6992},
pages = {247--261},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-24873-3\_19},
doi = {10.1007/978-3-642-24873-3\_19},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aldt/ReyR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/ErdelyiPR11,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Lena Piras and
J{\"{o}}rg Rothe},
editor = {Liz Sonenberg and
Peter Stone and
Kagan Tumer and
Pinar Yolum},
title = {The complexity of voter partition in Bucklin and fallback voting:
solving three open problems},
booktitle = {10th International Conference on Autonomous Agents and Multiagent
Systems {(AAMAS} 2011), Taipei, Taiwan, May 2-6, 2011, Volume 1-3},
pages = {837--844},
publisher = {{IFAAMAS}},
year = {2011},
url = {http://portal.acm.org/citation.cfm?id=2031737\&\#38;CFID=54178199\&\#38;CFTOKEN=61392764},
timestamp = {Fri, 18 Nov 2011 09:09:28 +0100},
biburl = {https://dblp.org/rec/conf/atal/ErdelyiPR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BaumeisterRR11,
author = {Dorothea Baumeister and
Magnus Roos and
J{\"{o}}rg Rothe},
editor = {Liz Sonenberg and
Peter Stone and
Kagan Tumer and
Pinar Yolum},
title = {Computational complexity of two variants of the possible winner problem},
booktitle = {10th International Conference on Autonomous Agents and Multiagent
Systems {(AAMAS} 2011), Taipei, Taiwan, May 2-6, 2011, Volume 1-3},
pages = {853--860},
publisher = {{IFAAMAS}},
year = {2011},
url = {http://portal.acm.org/citation.cfm?id=2031739\&\#38;CFID=54178199\&\#38;CFTOKEN=61392764},
timestamp = {Fri, 18 Nov 2011 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/atal/BaumeisterRR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-2230,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Michael R. Fellows and
Lena Piras and
J{\"{o}}rg Rothe},
title = {Control Complexity in Bucklin and Fallback Voting},
journal = {CoRR},
volume = {abs/1103.2230},
year = {2011},
url = {http://arxiv.org/abs/1103.2230},
eprinttype = {arXiv},
eprint = {1103.2230},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-2230.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-4436,
author = {Dorothea Baumeister and
J{\"{o}}rg Rothe},
title = {Taking the Final Step to a Full Dichotomy of the Possible Winner Problem
in Pure Scoring Rules},
journal = {CoRR},
volume = {abs/1108.4436},
year = {2011},
url = {http://arxiv.org/abs/1108.4436},
eprinttype = {arXiv},
eprint = {1108.4436},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-4436.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0028174,
author = {Frank Gurski and
Irene Rothe and
J{\"{o}}rg Rothe and
Egon Wanke},
title = {Exakte Algorithmen f{\"{u}}r schwere Graphenprobleme},
series = {eXamen.press},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-04500-4},
doi = {10.1007/978-3-642-04500-4},
isbn = {978-3-642-04499-1},
timestamp = {Tue, 16 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0028174.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/RoosR10,
author = {Magnus Roos and
J{\"{o}}rg Rothe},
editor = {Wiebe van der Hoek and
Gal A. Kaminka and
Yves Lesp{\'{e}}rance and
Michael Luck and
Sandip Sen},
title = {Complexity of social welfare optimization in multiagent resource allocation},
booktitle = {9th International Conference on Autonomous Agents and Multiagent Systems
{(AAMAS} 2010), Toronto, Canada, May 10-14, 2010, Volume 1-3},
pages = {641--648},
publisher = {{IFAAMAS}},
year = {2010},
url = {https://dl.acm.org/citation.cfm?id=1838290},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/atal/RoosR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/ErdelyiR10,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
J{\"{o}}rg Rothe},
editor = {Taso Viglas and
Alex Potanin},
title = {Control Complexity in Fallback Voting},
booktitle = {Theory of Computing 2010, {CATS} 2010, Brisbane, Australia, January
2010},
series = {{CRPIT}},
volume = {109},
pages = {39--48},
publisher = {Australian Computer Society},
year = {2010},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV109Erd\%C3\%A9lyi.html},
timestamp = {Mon, 08 Feb 2021 13:26:48 +0100},
biburl = {https://dblp.org/rec/conf/cats/ErdelyiR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BaumeisterBFHR10,
author = {Dorothea Baumeister and
Felix Brandt and
Felix A. Fischer and
Jan Hoffmann and
J{\"{o}}rg Rothe},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {The Complexity of Computing Minimal Unidirectional Covering Sets},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {299--310},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_27},
doi = {10.1007/978-3-642-13073-1\_27},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BaumeisterBFHR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/BaumeisterR10,
author = {Dorothea Baumeister and
J{\"{o}}rg Rothe},
editor = {Helder Coelho and
Rudi Studer and
Michael J. Wooldridge},
title = {Taking the Final Step to a Full Dichotomy of the Possible Winner Problem
in Pure Scoring Rules},
booktitle = {{ECAI} 2010 - 19th European Conference on Artificial Intelligence,
Lisbon, Portugal, August 16-20, 2010, Proceedings},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {215},
pages = {1019--1020},
publisher = {{IOS} Press},
year = {2010},
url = {https://doi.org/10.3233/978-1-60750-606-5-1019},
doi = {10.3233/978-1-60750-606-5-1019},
timestamp = {Fri, 26 Apr 2019 14:26:43 +0200},
biburl = {https://dblp.org/rec/conf/ecai/BaumeisterR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/ReyR10,
author = {Anja Rey and
J{\"{o}}rg Rothe},
editor = {Helder Coelho and
Rudi Studer and
Michael J. Wooldridge},
title = {Complexity of Merging and Splitting for the Probabilistic Banzhaf
Power Index in Weighted Voting Games},
booktitle = {{ECAI} 2010 - 19th European Conference on Artificial Intelligence,
Lisbon, Portugal, August 16-20, 2010, Proceedings},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {215},
pages = {1021--1022},
publisher = {{IOS} Press},
year = {2010},
url = {https://doi.org/10.3233/978-1-60750-606-5-1021},
doi = {10.3233/978-1-60750-606-5-1021},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ecai/ReyR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stairs/ReyR10,
author = {Anja Rey and
J{\"{o}}rg Rothe},
editor = {Thomas {\AA}gotnes},
title = {Merging and Splitting for Power Indices in Weighted Voting Games and
Network Flow Games on Hypergraphs},
booktitle = {{STAIRS} 2010 - Proceedings of the Fifth Starting {AI} Researchers'
Symposium, Lisbon, Portugal, 16-20 August, 2010},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {222},
pages = {277--289},
publisher = {{IOS} Press},
year = {2010},
url = {https://doi.org/10.3233/978-1-60750-676-8-277},
doi = {10.3233/978-1-60750-676-8-277},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stairs/ReyR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-3398,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Lena Piras and
J{\"{o}}rg Rothe},
title = {Control Complexity in Fallback Voting},
journal = {CoRR},
volume = {abs/1004.3398},
year = {2010},
url = {http://arxiv.org/abs/1004.3398},
eprinttype = {arXiv},
eprint = {1004.3398},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-3398.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1005-4115,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Lena Piras and
J{\"{o}}rg Rothe},
title = {Bucklin Voting is Broadly Resistant to Control},
journal = {CoRR},
volume = {abs/1005.4115},
year = {2010},
url = {http://arxiv.org/abs/1005.4115},
eprinttype = {arXiv},
eprint = {1005.4115},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1005-4115.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/BaumeisterR09,
author = {Dorothea Baumeister and
J{\"{o}}rg Rothe},
title = {Satisfiability Parsimoniously Reduces to the Tantrix\({}^{\mbox{TM}}\)
Rotation Puzzle Problem},
journal = {Fundam. Informaticae},
volume = {91},
number = {1},
pages = {35--51},
year = {2009},
url = {https://doi.org/10.3233/FI-2009-0032},
doi = {10.3233/FI-2009-0032},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/BaumeisterR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BaumeisterR09,
author = {Dorothea Baumeister and
J{\"{o}}rg Rothe},
title = {The three-color and two-color Tantrix\({}^{\mbox{TM}}\) rotation puzzle
problems are NP-complete via parsimonious reductions},
journal = {Inf. Comput.},
volume = {207},
number = {11},
pages = {1119--1139},
year = {2009},
url = {https://doi.org/10.1016/j.ic.2009.03.001},
doi = {10.1016/J.IC.2009.03.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BaumeisterR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ErdelyiHRS09,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe and
Holger Spakowski},
title = {Frequency of correctness versus average polynomial time},
journal = {Inf. Process. Lett.},
volume = {109},
number = {16},
pages = {946--949},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.05.001},
doi = {10.1016/J.IPL.2009.05.001},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ErdelyiHRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/FaliszewskiHHR09,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Llull and Copeland Voting Computationally Resist Bribery and Constructive
Control},
journal = {J. Artif. Intell. Res.},
volume = {35},
pages = {275--341},
year = {2009},
url = {https://doi.org/10.1613/jair.2697},
doi = {10.1613/JAIR.2697},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/FaliszewskiHHR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/GoldbergR09,
author = {Paul W. Goldberg and
J{\"{o}}rg Rothe},
title = {Editorial: Math. Log. Quart. 4/2009},
journal = {Math. Log. Q.},
volume = {55},
number = {4},
pages = {340},
year = {2009},
url = {https://doi.org/10.1002/malq.200990000},
doi = {10.1002/MALQ.200990000},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/GoldbergR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/HemaspaandraHR09,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Hybrid Elections Broaden Complexity-Theoretic Resistance to Control},
journal = {Math. Log. Q.},
volume = {55},
number = {4},
pages = {397--424},
year = {2009},
url = {https://doi.org/10.1002/malq.200810019},
doi = {10.1002/MALQ.200810019},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/HemaspaandraHR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/ErdelyiNR09,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Markus Nowak and
J{\"{o}}rg Rothe},
title = {Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive
Control and Broadly Resists Destructive Control},
journal = {Math. Log. Q.},
volume = {55},
number = {4},
pages = {425--443},
year = {2009},
url = {https://doi.org/10.1002/malq.200810020},
doi = {10.1002/MALQ.200810020},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/ErdelyiNR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ErdelyiHRS09,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe and
Holger Spakowski},
title = {Generalized juntas and NP-hard sets},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3995--4000},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.026},
doi = {10.1016/J.TCS.2009.06.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ErdelyiHRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/ErdelyiFGMRR09,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Henning Fernau and
Judy Goldsmith and
Nicholas Mattei and
Daniel Raible and
J{\"{o}}rg Rothe},
editor = {Francesca Rossi and
Alexis Tsouki{\`{a}}s},
title = {The Complexity of Probabilistic Lobbying},
booktitle = {Algorithmic Decision Theory, First International Conference, {ADT}
2009, Venice, Italy, October 20-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5783},
pages = {86--97},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04428-1\_8},
doi = {10.1007/978-3-642-04428-1\_8},
timestamp = {Tue, 23 Jan 2024 13:25:45 +0100},
biburl = {https://dblp.org/rec/conf/aldt/ErdelyiFGMRR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BachrachMZRR09,
author = {Yoram Bachrach and
Reshef Meir and
Michael Zuckerman and
J{\"{o}}rg Rothe and
Jeffrey S. Rosenschein},
editor = {Carles Sierra and
Cristiano Castelfranchi and
Keith S. Decker and
Jaime Sim{\~{a}}o Sichman},
title = {The cost of stability in weighted voting games},
booktitle = {8th International Joint Conference on Autonomous Agents and Multiagent
Systems {(AAMAS} 2009), Budapest, Hungary, May 10-15, 2009, Volume
2},
pages = {1289--1290},
publisher = {{IFAAMAS}},
year = {2009},
url = {https://dl.acm.org/citation.cfm?id=1558257},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/atal/BachrachMZRR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/BachrachEMPZRR09,
author = {Yoram Bachrach and
Edith Elkind and
Reshef Meir and
Dmitrii V. Pasechnik and
Michael Zuckerman and
J{\"{o}}rg Rothe and
Jeffrey S. Rosenschein},
editor = {Marios Mavronicolas and
Vicky G. Papadopoulou},
title = {The Cost of Stability in Coalitional Games},
booktitle = {Algorithmic Game Theory, Second International Symposium, {SAGT} 2009,
Paphos, Cyprus, October 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5814},
pages = {122--134},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04645-2\_12},
doi = {10.1007/978-3-642-04645-2\_12},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/BachrachEMPZRR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tark/FaliszewskiHHR09,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {Aviad Heifetz},
title = {The shield that never was: societies with single-peaked preferences
are more open to manipulation and control},
booktitle = {Proceedings of the 12th Conference on Theoretical Aspects of Rationality
and Knowledge (TARK-2009), Stanford, CA, USA, July 6-8, 2009},
pages = {118--127},
year = {2009},
url = {https://doi.org/10.1145/1562814.1562832},
doi = {10.1145/1562814.1562832},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tark/FaliszewskiHHR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/LindnerR09,
author = {Claudia Lindner and
J{\"{o}}rg Rothe},
editor = {Stefano Leonardi},
title = {Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting
Protocols},
booktitle = {Internet and Network Economics, 5th International Workshop, {WINE}
2009, Rome, Italy, December 14-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5929},
pages = {149--159},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10841-9\_15},
doi = {10.1007/978-3-642-10841-9\_15},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/wine/LindnerR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0901-3692,
author = {Dorothea Baumeister and
Felix Brandt and
Felix A. Fischer and
J{\"{o}}rg Rothe},
title = {Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel
Access to {NP}},
journal = {CoRR},
volume = {abs/0901.3692},
year = {2009},
url = {http://arxiv.org/abs/0901.3692},
eprinttype = {arXiv},
eprint = {0901.3692},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0901-3692.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-0620,
author = {Claudia Lindner and
J{\"{o}}rg Rothe},
title = {Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting
Protocols},
journal = {CoRR},
volume = {abs/0902.0620},
year = {2009},
url = {http://arxiv.org/abs/0902.0620},
eprinttype = {arXiv},
eprint = {0902.0620},
timestamp = {Wed, 03 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-0620.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0906-4431,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Henning Fernau and
Judy Goldsmith and
Nicholas Mattei and
Daniel Raible and
J{\"{o}}rg Rothe},
title = {The Complexity of Probabilistic Lobbying},
journal = {CoRR},
volume = {abs/0906.4431},
year = {2009},
url = {http://arxiv.org/abs/0906.4431},
eprinttype = {arXiv},
eprint = {0906.4431},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0906-4431.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-4385,
author = {Yoram Bachrach and
Edith Elkind and
Reshef Meir and
Dmitrii V. Pasechnik and
Michael Zuckerman and
J{\"{o}}rg Rothe and
Jeffrey S. Rosenschein},
title = {The Cost of Stability in Coalitional Games},
journal = {CoRR},
volume = {abs/0907.4385},
year = {2009},
url = {http://arxiv.org/abs/0907.4385},
eprinttype = {arXiv},
eprint = {0907.4385},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-4385.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-3257,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {The Shield that Never Was: Societies with Single-Peaked Preferences
are More Open to Manipulation and Control},
journal = {CoRR},
volume = {abs/0909.3257},
year = {2009},
url = {http://arxiv.org/abs/0909.3257},
eprinttype = {arXiv},
eprint = {0909.3257},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-3257.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/sp/Rothe08,
author = {J{\"{o}}rg Rothe},
title = {Komplexit{\"{a}}tstheorie und Kryptologie. Eine Einf{\"{u}}hrung
in Kryptokomplexit{\"{a}}t},
series = {eXamen.press},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79745-6},
doi = {10.1007/978-3-540-79745-6},
isbn = {978-3-540-79744-9},
timestamp = {Tue, 16 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/Rothe08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HemaspaandraRS08,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe and
Amitabh Saxena},
title = {Enforcing and defying associativity, commutativity, totality, and
strong noninvertibility for worst-case one-way functions},
journal = {Theor. Comput. Sci.},
volume = {401},
number = {1-3},
pages = {27--35},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.03.014},
doi = {10.1016/J.TCS.2008.03.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraRS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/FaliszewskiHHR08,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {Rudolf Fleischer and
Jinhui Xu},
title = {Copeland Voting Fully Resists Constructive Control},
booktitle = {Algorithmic Aspects in Information and Management, 4th International
Conference, {AAIM} 2008, Shanghai, China, June 23-25, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5034},
pages = {165--176},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-68880-8\_17},
doi = {10.1007/978-3-540-68880-8\_17},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/FaliszewskiHHR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/BaumeisterR08,
author = {Dorothea Baumeister and
J{\"{o}}rg Rothe},
editor = {Carlos Mart{\'{\i}}n{-}Vide and
Friedrich Otto and
Henning Fernau},
title = {The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are
NP-Complete Via Parsimonious Reductions},
booktitle = {Language and Automata Theory and Applications, Second International
Conference, {LATA} 2008, Tarragona, Spain, March 13-19, 2008. Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {5196},
pages = {76--87},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-88282-4\_9},
doi = {10.1007/978-3-540-88282-4\_9},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/lata/BaumeisterR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ErdelyiNR08,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Markus Nowak and
J{\"{o}}rg Rothe},
editor = {Edward Ochmanski and
Jerzy Tyszkiewicz},
title = {Sincere-Strategy Preference-Based Approval Voting Broadly Resists
Control},
booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International
Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5162},
pages = {311--322},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85238-4\_25},
doi = {10.1007/978-3-540-85238-4\_25},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ErdelyiNR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0806-0535,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Markus Nowak and
J{\"{o}}rg Rothe},
title = {Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive
Control and Broadly Resists Destructive Control},
journal = {CoRR},
volume = {abs/0806.0535},
year = {2008},
url = {http://arxiv.org/abs/0806.0535},
eprinttype = {arXiv},
eprint = {0806.0535},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-0535.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0806-2555,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe and
Holger Spakowski},
title = {Frequency of Correctness versus Average-Case Polynomial Time and Generalized
Juntas},
journal = {CoRR},
volume = {abs/0806.2555},
year = {2008},
url = {http://arxiv.org/abs/0806.2555},
eprinttype = {arXiv},
eprint = {0806.2555},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-2555.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0809-4484,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Llull and Copeland Voting Computationally Resist Bribery and Control},
journal = {CoRR},
volume = {abs/0809.4484},
year = {2008},
url = {http://arxiv.org/abs/0809.4484},
eprinttype = {arXiv},
eprint = {0809.4484},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0809-4484.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/HemaspaandraHR07,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Anyone but him: The complexity of precluding an alternative},
journal = {Artif. Intell.},
volume = {171},
number = {5-6},
pages = {255--285},
year = {2007},
url = {https://doi.org/10.1016/j.artint.2007.01.005},
doi = {10.1016/J.ARTINT.2007.01.005},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/HemaspaandraHR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/BrussEMRR07,
author = {Dagmar Bru{\ss} and
G{\'{a}}bor Erd{\'{e}}lyi and
Tim Meyer and
Tobias Riege and
J{\"{o}}rg Rothe},
title = {Quantum cryptography: {A} survey},
journal = {{ACM} Comput. Surv.},
volume = {39},
number = {2},
pages = {6},
year = {2007},
url = {https://doi.org/10.1145/1242471.1242474},
doi = {10.1145/1242471.1242474},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csur/BrussEMRR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RiegeRSY07,
author = {Tobias Riege and
J{\"{o}}rg Rothe and
Holger Spakowski and
Masaki Yamamoto},
title = {An improved exact algorithm for the domatic number problem},
journal = {Inf. Process. Lett.},
volume = {101},
number = {3},
pages = {101--106},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2006.08.010},
doi = {10.1016/J.IPL.2006.08.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RiegeRSY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Rothe07,
author = {J{\"{o}}rg Rothe},
title = {Review of "Complexity and Cryptography: An Introduction by John
Talbot and Dominic Welsh", Cambridge University Press, 2006,
292 pages},
journal = {{SIGACT} News},
volume = {38},
number = {2},
pages = {16--20},
year = {2007},
url = {https://doi.org/10.1145/1272729.1272735},
doi = {10.1145/1272729.1272735},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Rothe07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/FaliszewskiHHR07,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Llull and Copeland Voting Broadly Resist Bribery and Control},
booktitle = {Proceedings of the Twenty-Second {AAAI} Conference on Artificial Intelligence,
July 22-26, 2007, Vancouver, British Columbia, Canada},
pages = {724--730},
publisher = {{AAAI} Press},
year = {2007},
url = {http://www.aaai.org/Library/AAAI/2007/aaai07-115.php},
timestamp = {Tue, 05 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/FaliszewskiHHR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/ErdelyiHRS07,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe and
Holger Spakowski},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Zolt{\'{a}}n {\'{E}}sik},
title = {On Approximating Optimal Weighted Lobbying, and Frequency of Correctness
Versus Average-Case Polynomial Time},
booktitle = {Fundamentals of Computation Theory, 16th International Symposium,
{FCT} 2007, Budapest, Hungary, August 27-30, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4639},
pages = {300--311},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74240-1\_26},
doi = {10.1007/978-3-540-74240-1\_26},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/ErdelyiHRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/HemaspaandraHR07,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {Manuela M. Veloso},
title = {Hybrid Elections Broaden Complexity-Theoretic Resistance to Control},
booktitle = {{IJCAI} 2007, Proceedings of the 20th International Joint Conference
on Artificial Intelligence, Hyderabad, India, January 6-12, 2007},
pages = {1308--1314},
year = {2007},
url = {http://ijcai.org/Proceedings/07/Papers/211.pdf},
timestamp = {Tue, 20 Aug 2019 16:17:11 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/HemaspaandraHR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mcu/BaumeisterR07,
author = {Dorothea Baumeister and
J{\"{o}}rg Rothe},
editor = {J{\'{e}}r{\^{o}}me Olivier Durand{-}Lose and
Maurice Margenstern},
title = {Satisfiability Parsimoniously Reduces to the Tantrix\({}^{\mbox{TM}}\)
Rotation Puzzle Problem},
booktitle = {Machines, Computations, and Universality, 5th International Conference,
{MCU} 2007, Orl{\'{e}}ans, France, September 10-13, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4664},
pages = {134--145},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74593-8\_12},
doi = {10.1007/978-3-540-74593-8\_12},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/mcu/BaumeisterR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0705-0915,
author = {Dorothea Baumeister and
J{\"{o}}rg Rothe},
title = {Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation
Puzzle Problem},
journal = {CoRR},
volume = {abs/0705.0915},
year = {2007},
url = {http://arxiv.org/abs/0705.0915},
eprinttype = {arXiv},
eprint = {0705.0915},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0705-0915.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0711-1827,
author = {Dorothea Baumeister and
J{\"{o}}rg Rothe},
title = {The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems
are NP-Complete via Parsimonious Reductions},
journal = {CoRR},
volume = {abs/0711.1827},
year = {2007},
url = {http://arxiv.org/abs/0711.1827},
eprinttype = {arXiv},
eprint = {0711.1827},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0711-1827.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0711-4759,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Copeland Voting Fully Resists Constructive Control},
journal = {CoRR},
volume = {abs/0711.4759},
year = {2007},
url = {http://arxiv.org/abs/0711.4759},
eprinttype = {arXiv},
eprint = {0711.4759},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0711-4759.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0703097,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe and
Holger Spakowski},
title = {On Approximating Optimal Weighted Lobbying, and Frequency of Correctness
versus Average-Case Polynomial Time},
journal = {CoRR},
volume = {abs/cs/0703097},
year = {2007},
url = {http://arxiv.org/abs/cs/0703097},
eprinttype = {arXiv},
eprint = {cs/0703097},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0703097.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrosseRW06,
author = {Andr{\'{e}} Gro{\ss}e and
J{\"{o}}rg Rothe and
Gerd Wechsung},
title = {On computing the smallest four-coloring of planar graphs and non-self-reducible
sets in {P}},
journal = {Inf. Process. Lett.},
volume = {99},
number = {6},
pages = {215--221},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.04.007},
doi = {10.1016/J.IPL.2006.04.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrosseRW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/HemaspaandraRS06,
author = {Edith Hemaspaandra and
J{\"{o}}rg Rothe and
Holger Spakowski},
title = {Recognizing when heuristics can approximate minimum vertex covers
is complete for parallel access to {NP}},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {40},
number = {1},
pages = {75--91},
year = {2006},
url = {https://doi.org/10.1051/ita:2005041},
doi = {10.1051/ITA:2005041},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/HemaspaandraRS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jucs/RiegeR06,
author = {Tobias Riege and
J{\"{o}}rg Rothe},
title = {Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal
Graph Uncolorability, and Exact Domatic Number Problems - a Survey},
journal = {J. Univers. Comput. Sci.},
volume = {12},
number = {5},
pages = {551--578},
year = {2006},
url = {http://www.jucs.org/jucs\_12\_5/completenes\_in\_the\_boolean},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jucs/RiegeR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jucs/RotheA06,
author = {J{\"{o}}rg Rothe and
Hiroki Arimura},
title = {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)},
journal = {J. Univers. Comput. Sci.},
volume = {12},
number = {6},
pages = {579--580},
year = {2006},
url = {http://www.jucs.org/jucs\_12\_6/computational\_challenges\_of\_massive\_data},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jucs/RotheA06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jucs/RiegeR06a,
author = {Tobias Riege and
J{\"{o}}rg Rothe},
title = {Improving Deterministic and Randomized Exponential-Time Algorithms
for the Satisfiability, the Colorability, and the Domatic Number Problem},
journal = {J. Univers. Comput. Sci.},
volume = {12},
number = {6},
pages = {725--745},
year = {2006},
url = {https://doi.org/10.3217/jucs-012-06-0725},
doi = {10.3217/JUCS-012-06-0725},
timestamp = {Thu, 07 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jucs/RiegeR06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/RiegeR06,
author = {Tobias Riege and
J{\"{o}}rg Rothe},
title = {Complexity of the Exact Domatic Number Problem and of the Exact Conveyor
Flow Shop Problem},
journal = {Theory Comput. Syst.},
volume = {39},
number = {5},
pages = {635--668},
year = {2006},
url = {https://doi.org/10.1007/s00224-004-1209-8},
doi = {10.1007/S00224-004-1209-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/RiegeR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HemaspaandraPR06,
author = {Lane A. Hemaspaandra and
Kari Pasanen and
J{\"{o}}rg Rothe},
title = {If {P} neq {NP} then some strongly noninvertible functions are invertible},
journal = {Theor. Comput. Sci.},
volume = {362},
number = {1-3},
pages = {54--62},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.05.022},
doi = {10.1016/J.TCS.2006.05.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraPR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0603060,
author = {Tobias Riege and
J{\"{o}}rg Rothe and
Holger Spakowski and
Masaki Yamamoto},
title = {An Improved Exact Algorithm for the Domatic Number Problem},
journal = {CoRR},
volume = {abs/cs/0603060},
year = {2006},
url = {http://arxiv.org/abs/cs/0603060},
eprinttype = {arXiv},
eprint = {cs/0603060},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0603060.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0608057,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Hybrid Elections Broaden Complexity-Theoretic Resistance to Control},
journal = {CoRR},
volume = {abs/cs/0608057},
year = {2006},
url = {http://arxiv.org/abs/cs/0608057},
eprinttype = {arXiv},
eprint = {cs/0608057},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0608057.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0609112,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {A Richer Understanding of the Complexity of Election Systems},
journal = {CoRR},
volume = {abs/cs/0609112},
year = {2006},
url = {http://arxiv.org/abs/cs/0609112},
eprinttype = {arXiv},
eprint = {cs/0609112},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0609112.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RiegeR06,
author = {Tobias Riege and
J{\"{o}}rg Rothe},
title = {Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal
Graph Uncolorability, and Exact Domatic Number Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-036}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-036/index.html},
eprinttype = {ECCC},
eprint = {TR06-036},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RiegeR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RiegeR06a,
author = {Tobias Riege and
J{\"{o}}rg Rothe},
title = {Improving Deterministic and Randomized Exponential-Time Algorithms
for the Satisfiability, the Colorability, and the Domatic Number Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-078}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-078/index.html},
eprinttype = {ECCC},
eprint = {TR06-078},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RiegeR06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/sp/Rothe05,
author = {J{\"{o}}rg Rothe},
title = {Complexity Theory and Cryptology. An Introduction to Cryptocomplexity},
series = {Texts in Theoretical Computer Science. An {EATCS} Series},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/3-540-28520-2},
doi = {10.1007/3-540-28520-2},
isbn = {978-3-540-22147-0},
timestamp = {Tue, 16 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/Rothe05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/HemaspaandraHR05,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {Manuela M. Veloso and
Subbarao Kambhampati},
title = {Anyone but Him: The Complexity of Precluding an Alternative},
booktitle = {Proceedings, The Twentieth National Conference on Artificial Intelligence
and the Seventeenth Innovative Applications of Artificial Intelligence
Conference, July 9-13, 2005, Pittsburgh, Pennsylvania, {USA}},
pages = {95--101},
publisher = {{AAAI} Press / The {MIT} Press},
year = {2005},
url = {http://www.aaai.org/Library/AAAI/2005/aaai05-016.php},
timestamp = {Tue, 05 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/HemaspaandraHR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/HemaspaandraRS05,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe and
Amitabh Saxena},
editor = {Mario Coppo and
Elena Lodi and
G. Michele Pinna},
title = {Enforcing and Defying Associativity, Commutativity, Totality, and
Strong Noninvertibility for One-Way Functions in Complexity Theory},
booktitle = {Theoretical Computer Science, 9th Italian Conference, {ICTCS} 2005,
Siena, Italy, October 12-14, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3701},
pages = {265--279},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11560586\_22},
doi = {10.1007/11560586\_22},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/HemaspaandraRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/RiegeR05,
author = {Tobias Riege and
J{\"{o}}rg Rothe},
editor = {Joanna Jedrzejowicz and
Andrzej Szepietowski},
title = {An Exact 2.9416\({}^{\mbox{n}}\) Algorithm for the Three Domatic Number
Problem},
booktitle = {Mathematical Foundations of Computer Science 2005, 30th International
Symposium, {MFCS} 2005, Gdansk, Poland, August 29 - September 2, 2005,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3618},
pages = {733--744},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11549345\_63},
doi = {10.1007/11549345\_63},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/RiegeR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0503049,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe and
Amitabh Saxena},
title = {Enforcing and Defying Associativity, Commutativity, Totality, and
Strong Noninvertibility for One-Way Functions in Complexity Theory},
journal = {CoRR},
volume = {abs/cs/0503049},
year = {2005},
url = {http://arxiv.org/abs/cs/0503049},
eprinttype = {arXiv},
eprint = {cs/0503049},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0503049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0506090,
author = {Tobias Riege and
J{\"{o}}rg Rothe},
title = {An Exact 2.9416\({}^{\mbox{n}}\) Algorithm for the Three Domatic Number
Problem},
journal = {CoRR},
volume = {abs/cs/0506090},
year = {2005},
url = {http://arxiv.org/abs/cs/0506090},
eprinttype = {arXiv},
eprint = {cs/0506090},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0506090.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0507027,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Anyone but Him: The Complexity of Precluding an Alternative},
journal = {CoRR},
volume = {abs/cs/0507027},
year = {2005},
url = {http://arxiv.org/abs/cs/0507027},
eprinttype = {arXiv},
eprint = {cs/0507027},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0507027.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-146,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Tobias Riege and
J{\"{o}}rg Rothe},
title = {Quantum Cryptography: {A} Survey},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-146}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-146/index.html},
eprinttype = {ECCC},
eprint = {TR05-146},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-146.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Rothe04,
author = {J{\"{o}}rg Rothe},
editor = {Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
title = {Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean
Hierarchy},
booktitle = {Algebraic Methods in Computational Complexity, 10.-15. October 2004},
series = {Dagstuhl Seminar Proceedings},
volume = {04421},
publisher = {IBFI, Schloss Dagstuhl, Germany},
year = {2004},
url = {http://drops.dagstuhl.de/opus/volltexte/2005/105},
timestamp = {Thu, 10 Jun 2021 13:02:11 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Rothe04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rothe03,
author = {J{\"{o}}rg Rothe},
title = {Exact complexity of Exact-Four-Colorability},
journal = {Inf. Process. Lett.},
volume = {87},
number = {1},
pages = {7--12},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(03)00229-1},
doi = {10.1016/S0020-0190(03)00229-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rothe03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/RotheSV03,
author = {J{\"{o}}rg Rothe and
Holger Spakowski and
J{\"{o}}rg Vogel},
title = {Exact Complexity of the Winner Problem for Young Elections},
journal = {Theory Comput. Syst.},
volume = {36},
number = {4},
pages = {375--386},
year = {2003},
url = {https://doi.org/10.1007/s00224-002-1093-z},
doi = {10.1007/S00224-002-1093-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/RotheSV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/Rothe02,
author = {J{\"{o}}rg Rothe},
title = {Some facets of complexity theory and cryptography: {A} five-lecture
tutorial},
journal = {{ACM} Comput. Surv.},
volume = {34},
number = {4},
pages = {504--549},
year = {2002},
url = {https://doi.org/10.1145/592642.592646},
doi = {10.1145/592642.592646},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csur/Rothe02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/insk/Rothe02,
author = {J{\"{o}}rg Rothe},
title = {Kryptographische Protokolle und Null-Information},
journal = {Inform. Spektrum},
volume = {25},
number = {2},
pages = {120--131},
year = {2002},
url = {https://doi.org/10.1007/s002870200215},
doi = {10.1007/S002870200215},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/insk/Rothe02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RotheH02,
author = {J{\"{o}}rg Rothe and
Lane A. Hemaspaandra},
title = {On characterizing the existence of partial one-way permutations},
journal = {Inf. Process. Lett.},
volume = {82},
number = {3},
pages = {165--171},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00269-1},
doi = {10.1016/S0020-0190(01)00269-1},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RotheH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GrosseRW02,
author = {Andr{\'{e}} Gro{\ss}e and
J{\"{o}}rg Rothe and
Gerd Wechsung},
title = {Computing Complete Graph Isomorphisms and Hamiltonian Cycles from
Partial Ones},
journal = {Theory Comput. Syst.},
volume = {35},
number = {1},
pages = {81--93},
year = {2002},
url = {https://doi.org/10.1007/s00224-001-1048-9},
doi = {10.1007/S00224-001-1048-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GrosseRW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/RotheSV02,
author = {J{\"{o}}rg Rothe and
Holger Spakowski and
J{\"{o}}rg Vogel},
editor = {Ricardo A. Baeza{-}Yates and
Ugo Montanari and
Nicola Santoro},
title = {Exact Complexity of Exact-Four-Colorability and of the Winner Problem
for Young Elections},
booktitle = {Foundations of Information Technology in the Era of Networking and
Mobile Computing, {IFIP} 17\({}^{\mbox{th}}\) World Computer Congress
- {TC1} Stream / 2\({}^{\mbox{nd}}\) {IFIP} International Conference
on Theoretical Computer Science {(TCS} 2002), August 25-30, 2002,
Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
series = {{IFIP} Conference Proceedings},
volume = {223},
pages = {310--322},
publisher = {Kluwer},
year = {2002},
url = {https://doi.org/10.1007/978-0-387-35608-2\_26},
doi = {10.1007/978-0-387-35608-2\_26},
timestamp = {Fri, 27 Sep 2019 10:35:17 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/RotheSV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HemaspaandraRS02,
author = {Edith Hemaspaandra and
J{\"{o}}rg Rothe and
Holger Spakowski},
editor = {Ludek Kucera},
title = {Recognizing When Heuristics Can Approximate Minimum Vertex Covers
Is Complete for Parallel Access to {NP}},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {258--269},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_23},
doi = {10.1007/3-540-36379-3\_23},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/HemaspaandraRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0212016,
author = {Tobias Riege and
J{\"{o}}rg Rothe},
title = {Complexity of the Exact Domatic Number Problem and of the Exact Conveyor
Flow Shop Problem},
journal = {CoRR},
volume = {cs.CC/0212016},
year = {2002},
url = {http://arxiv.org/abs/cs/0212016},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0212016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-068,
author = {Tobias Riege and
J{\"{o}}rg Rothe},
title = {Complexity of the Exact Domatic Number Problem and of the Exact Conveyor
Flow Shop Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-068}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-068/index.html},
eprinttype = {ECCC},
eprint = {TR02-068},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-068.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/HemaspaandraPR01,
author = {Lane A. Hemaspaandra and
Kari Pasanen and
J{\"{o}}rg Rothe},
editor = {Rusins Freivalds},
title = {If {P} != {NP} Then Some Strongly Noninvertible Functions Are Invertible},
booktitle = {Fundamentals of Computation Theory, 13th International Symposium,
{FCT} 2001, Riga, Latvia, August 22-24, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2138},
pages = {162--171},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44669-9\_17},
doi = {10.1007/3-540-44669-9\_17},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/HemaspaandraPR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/GrosseRW01,
author = {Andr{\'{e}} Gro{\ss}e and
J{\"{o}}rg Rothe and
Gerd Wechsung},
editor = {Antonio Restivo and
Simona Ronchi Della Rocca and
Luca Roversi},
title = {Relating Partial and Complete Solutions and the Complexity of Computing
Smallest Solutions},
booktitle = {Theoretical Computer Science, 7th Italian Conference, {ICTCS} 2001,
Torino, Italy, October 4-6, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2202},
pages = {339--356},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45446-2\_22},
doi = {10.1007/3-540-45446-2\_22},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/GrosseRW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0106041,
author = {Andr{\'{e}} Gro{\ss}e and
J{\"{o}}rg Rothe and
Gerd Wechsung},
title = {Computing Complete Graph Isomorphisms and Hamiltonian Cycles from
Partial Ones},
journal = {CoRR},
volume = {cs.CC/0106041},
year = {2001},
url = {https://arxiv.org/abs/cs/0106041},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0106041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0106045,
author = {Andr{\'{e}} Gro{\ss}e and
J{\"{o}}rg Rothe and
Gerd Wechsung},
title = {A Note on the Complexity of Computing the Smallest Four-Coloring of
Planar Graphs},
journal = {CoRR},
volume = {cs.CC/0106045},
year = {2001},
url = {https://arxiv.org/abs/cs/0106045},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0106045.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0109018,
author = {J{\"{o}}rg Rothe},
title = {Exact Complexity of Exact-Four-Colorability},
journal = {CoRR},
volume = {cs.CC/0109018},
year = {2001},
url = {https://arxiv.org/abs/cs/0109018},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0109018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0110025,
author = {Edith Hemaspaandra and
J{\"{o}}rg Rothe and
Holger Spakowski},
title = {Recognizing When Heuristics Can Approximate Minimum Vertex Covers
Is Complete for Parallel Access to {NP}},
journal = {CoRR},
volume = {cs.CC/0110025},
year = {2001},
url = {https://arxiv.org/abs/cs/0110025},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0110025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0111056,
author = {J{\"{o}}rg Rothe},
title = {Some Facets of Complexity Theory and Cryptography: {A} Five-Lectures
Tutorial},
journal = {CoRR},
volume = {cs.CC/0111056},
year = {2001},
url = {https://arxiv.org/abs/cs/0111056},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0111056.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0112021,
author = {J{\"{o}}rg Rothe and
Holger Spakowski and
J{\"{o}}rg Vogel},
title = {Exact Complexity of the Winner Problem for Young Elections},
journal = {CoRR},
volume = {cs.CC/0112021},
year = {2001},
url = {https://arxiv.org/abs/cs/0112021},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0112021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-096,
author = {J{\"{o}}rg Rothe},
title = {Some Facets of Complexity Theory and Cryptography: {A} Five-Lectures
Tutorial},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-096}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-096/index.html},
eprinttype = {ECCC},
eprint = {TR01-096},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-096.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/Rothe00,
author = {J{\"{o}}rg Rothe},
title = {Heuristics Versus Completeness for Graph Coloring},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2000},
year = {2000},
url = {http://cjtcs.cs.uchicago.edu/articles/2000/1/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/Rothe00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GoldsmithOR00,
author = {Judy Goldsmith and
Mitsunori Ogihara and
J{\"{o}}rg Rothe},
title = {Tally {NP} Sets and Easy Census Functions},
journal = {Inf. Comput.},
volume = {158},
number = {1},
pages = {29--52},
year = {2000},
url = {https://doi.org/10.1006/inco.1999.2810},
doi = {10.1006/INCO.1999.2810},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GoldsmithOR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RaoRW00,
author = {Rajesh P. N. Rao and
J{\"{o}}rg Rothe and
Osamu Watanabe},
title = {Corrigendum to "Upward separation for FewP and related classes"},
journal = {Inf. Process. Lett.},
volume = {74},
number = {1-2},
pages = {89},
year = {2000},
url = {https://doi.org/10.1016/S0020-0190(00)00035-1},
doi = {10.1016/S0020-0190(00)00035-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RaoRW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmsjcm/BorchertHR00,
author = {Bernd Borchert and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Restrictive Acceptance Suffices for Equivalence Problems},
journal = {{LMS} J. Comput. Math.},
volume = {3},
pages = {86--95},
year = {2000},
url = {https://doi.org/10.1112/s146115700000022x},
doi = {10.1112/S146115700000022X},
timestamp = {Fri, 05 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmsjcm/BorchertHR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HemaspaandraR00,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {A second step towards complexity-theoretic analogs of Rice's Theorem},
journal = {Theor. Comput. Sci.},
volume = {244},
number = {1-2},
pages = {205--217},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00344-2},
doi = {10.1016/S0304-3975(98)00344-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HemaspaandraR00a,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Characterizing the existence of one-way permutations},
journal = {Theor. Comput. Sci.},
volume = {244},
number = {1-2},
pages = {257--261},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00014-1},
doi = {10.1016/S0304-3975(00)00014-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraR00a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0010011,
author = {Lane A. Hemaspaandra and
Kari Pasanen and
J{\"{o}}rg Rothe},
title = {If {P} {\textbackslash}neq {NP} then Some Strongly Noninvertible Functions
are Invertible},
journal = {CoRR},
volume = {cs.CC/0010011},
year = {2000},
url = {https://arxiv.org/abs/cs/0010011},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0010011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Rothe99,
author = {J{\"{o}}rg Rothe},
title = {Immunity and simplicity for exact counting and other counting classes},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {2},
pages = {159--176},
year = {1999},
url = {https://doi.org/10.1051/ita:1999100},
doi = {10.1051/ITA:1999100},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Rothe99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HemaspaandraR99,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Creating Strong, Total, Commutative, Associative One-Way Functions
from Any One-Way Function in Complexity Theory},
journal = {J. Comput. Syst. Sci.},
volume = {58},
number = {3},
pages = {648--659},
year = {1999},
url = {https://doi.org/10.1006/jcss.1998.1613},
doi = {10.1006/JCSS.1998.1613},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HemaspaandraR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/BeygelzimerHHR99,
author = {Alina Beygelzimer and
Lane A. Hemaspaandra and
Christopher M. Homan and
J{\"{o}}rg Rothe},
title = {One-way functions in worst-case cryptography: algebraic and security
properties are on the house},
journal = {{SIGACT} News},
volume = {30},
number = {4},
pages = {25--40},
year = {1999},
url = {https://doi.org/10.1145/337885.337891},
doi = {10.1145/337885.337891},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/BeygelzimerHHR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BorchertHR99,
author = {Bernd Borchert and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {Gabriel Ciobanu and
Gheorghe Paun},
title = {Restrictive Acceptance Suffices for Equivalence Problems},
booktitle = {Fundamentals of Computation Theory, 12th International Symposium,
{FCT} '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1684},
pages = {124--135},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48321-7\_9},
doi = {10.1007/3-540-48321-7\_9},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/BorchertHR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9907033,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete
Sets},
journal = {CoRR},
volume = {cs.CC/9907033},
year = {1999},
url = {https://arxiv.org/abs/cs/9907033},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9907033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9907034,
author = {Lane A. Hemaspaandra and
Zhigen Jiang and
J{\"{o}}rg Rothe and
Osamu Watanabe},
title = {Polynomial-Time Multi-Selectivity},
journal = {CoRR},
volume = {cs.CC/9907034},
year = {1999},
url = {https://arxiv.org/abs/cs/9907034},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9907034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9907035,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe and
Gerd Wechsung},
title = {Easy Sets and Hard Certificate Schemes},
journal = {CoRR},
volume = {cs.CC/9907035},
year = {1999},
url = {https://arxiv.org/abs/cs/9907035},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9907035.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9907036,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System
is Complete for Parallel Access to {NP}},
journal = {CoRR},
volume = {cs.CC/9907036},
year = {1999},
url = {https://arxiv.org/abs/cs/9907036},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9907036.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9907037,
author = {Lane A. Hemaspaandra and
Zhigen Jiang and
J{\"{o}}rg Rothe and
Osamu Watanabe},
title = {Boolean Operations, Joins, and the Extended Low Hierarchy},
journal = {CoRR},
volume = {cs.CC/9907037},
year = {1999},
url = {https://arxiv.org/abs/cs/9907037},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9907037.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9907038,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {A Second Step Towards Complexity-Theoretic Analogs of Rice's Theorem},
journal = {CoRR},
volume = {cs.CC/9907038},
year = {1999},
url = {https://arxiv.org/abs/cs/9907038},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9907038.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9907039,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Raising {NP} Lower Bounds to Parallel {NP} Lower Bounds},
journal = {CoRR},
volume = {cs.CC/9907039},
year = {1999},
url = {https://arxiv.org/abs/cs/9907039},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9907039.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9907040,
author = {J{\"{o}}rg Rothe and
Lane A. Hemaspaandra},
title = {Characterizations of the Existence of Partial and Total One-Way Permutations},
journal = {CoRR},
volume = {cs.CC/9907040},
year = {1999},
url = {https://arxiv.org/abs/cs/9907040},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9907040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9907041,
author = {Bernd Borchert and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Restrictive Acceptance Suffices for Equivalence Problems},
journal = {CoRR},
volume = {cs.CC/9907041},
year = {1999},
url = {https://arxiv.org/abs/cs/9907041},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9907041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9911007,
author = {Alina Beygelzimer and
Lane A. Hemaspaandra and
Christopher M. Homan and
J{\"{o}}rg Rothe},
title = {One-Way Functions in Worst-Case Cryptography: Algebraic and Security
Properties},
journal = {CoRR},
volume = {cs.CC/9911007},
year = {1999},
url = {https://arxiv.org/abs/cs/9911007},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9911007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HemaspaandraR98,
author = {Edith Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Recognizing when Greed can Approximate Maximum Independent Sets is
Complete for Parallel Access to {NP}},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {151--156},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00219-6},
doi = {10.1016/S0020-0190(97)00219-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HemaspaandraR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HemaspaandraJRW98,
author = {Lane A. Hemaspaandra and
Zhigen Jiang and
J{\"{o}}rg Rothe and
Osamu Watanabe},
title = {Boolean Operations, Joins, and the Extended Low Hierarchy},
journal = {Theor. Comput. Sci.},
volume = {205},
number = {1-2},
pages = {317--327},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(98)00006-1},
doi = {10.1016/S0304-3975(98)00006-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraJRW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HemaspaandraR98,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {Lubos Brim and
Jozef Gruska and
Jir{\'{\i}} Zlatuska},
title = {A Second Step Towards Circuit Complexity-Theoretic Analogs of Rice's
Theorem},
booktitle = {Mathematical Foundations of Computer Science 1998, 23rd International
Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1450},
pages = {418--426},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055791},
doi = {10.1007/BFB0055791},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HemaspaandraR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GoldsmithOR98,
author = {Judy Goldsmith and
Mitsunori Ogihara and
J{\"{o}}rg Rothe},
editor = {Lubos Brim and
Jozef Gruska and
Jir{\'{\i}} Zlatuska},
title = {Tally {NP} Sets and Easy Census Functions},
booktitle = {Mathematical Foundations of Computer Science 1998, 23rd International
Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1450},
pages = {483--492},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055798},
doi = {10.1007/BFB0055798},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GoldsmithOR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9808003,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Creating Strong Total Commutative Associative Complexity-Theoretic
One-Way Functions from Any Complexity-Theoretic One-Way Function},
journal = {CoRR},
volume = {cs.CC/9808003},
year = {1998},
url = {https://arxiv.org/abs/cs/9808003},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9808003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9809001,
author = {J{\"{o}}rg Rothe},
title = {Immunity and Simplicity for Exact Counting and Other Counting Classes},
journal = {CoRR},
volume = {cs.CC/9809001},
year = {1998},
url = {https://arxiv.org/abs/cs/9809001},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9809001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9809002,
author = {Judy Goldsmith and
Mitsunori Ogihara and
J{\"{o}}rg Rothe},
title = {Tally {NP} Sets and Easy Census Functions},
journal = {CoRR},
volume = {cs.CC/9809002},
year = {1998},
url = {https://arxiv.org/abs/cs/9809002},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9809002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/HemaspaandraRW97,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe and
Gerd Wechsung},
title = {Easy Sets and Hard Certificate Schemes},
journal = {Acta Informatica},
volume = {34},
number = {11},
pages = {859--879},
year = {1997},
url = {https://doi.org/10.1007/s002360050109},
doi = {10.1007/S002360050109},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/HemaspaandraRW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HemaspaandraHR97,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system
is complete for parallel access to {NP}},
journal = {J. {ACM}},
volume = {44},
number = {6},
pages = {806--825},
year = {1997},
url = {https://doi.org/10.1145/268999.269002},
doi = {10.1145/268999.269002},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/HemaspaandraHR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jucs/HemaspaandraJRW97,
author = {Lane A. Hemaspaandra and
Zhigen Jiang and
J{\"{o}}rg Rothe and
Osamu Watanabe},
title = {Polynomial-Time Multi-Selectivity},
journal = {J. Univers. Comput. Sci.},
volume = {3},
number = {3},
pages = {197--229},
year = {1997},
url = {https://doi.org/10.3217/jucs-003-03-0197},
doi = {10.3217/JUCS-003-03-0197},
timestamp = {Thu, 07 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jucs/HemaspaandraJRW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HemaspaandraR97,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete
Sets},
journal = {{SIAM} J. Comput.},
volume = {26},
number = {3},
pages = {634--653},
year = {1997},
url = {https://doi.org/10.1137/S0097539794261970},
doi = {10.1137/S0097539794261970},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HemaspaandraR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/HemaspaandraHR97,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Raising {NP} lower bounds to parallel {NP} lower bounds},
journal = {{SIGACT} News},
volume = {28},
number = {2},
pages = {2--13},
year = {1997},
url = {https://doi.org/10.1145/261342.261344},
doi = {10.1145/261342.261344},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/HemaspaandraHR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HemaspaandraRW97,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe and
Gerd Wechsung},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {On Sets with Easy Certificates and the Existence of One-Way Permutations},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {264--275},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_78},
doi = {10.1007/3-540-62592-5\_78},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HemaspaandraRW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HemaspaandraHR97,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System
is Complete for Parallel Access to {NP}},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {214--224},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_179},
doi = {10.1007/3-540-63165-8\_179},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HemaspaandraHR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HemaspaandraJRW96,
author = {Lane A. Hemaspaandra and
Zhigen Jiang and
J{\"{o}}rg Rothe and
Osamu Watanabe},
editor = {Jin{-}yi Cai and
C. K. Wong},
title = {The Join Can Lower Complexity},
booktitle = {Computing and Combinatorics, Second Annual International Conference,
{COCOON} '96, Hong Kong, June 17-19, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1090},
pages = {260--267},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61332-3\_159},
doi = {10.1007/3-540-61332-3\_159},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/HemaspaandraJRW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-045,
author = {Bernd Borchert and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity
Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-045}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-045/index.html},
eprinttype = {ECCC},
eprint = {TR96-045},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-045.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/de/Rothe1995,
author = {J{\"{o}}rg Rothe},
title = {On some promise classes in structural complexity theory},
school = {University of Jena, Germany},
year = {1995},
url = {http://www.db-thueringen.de/servlets/DerivateServlet/Derivate-761/rothediss.pdf},
urn = {urn:nbn:de:gbv:27-20060809-113927-1},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/de/Rothe1995.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HemaspaandraR95,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {Ding{-}Zhu Du and
Ming Li},
title = {Intersection Suffices for Boolean Hierarchy Equivalence},
booktitle = {Computing and Combinatorics, First Annual International Conference,
{COCOON} '95, Xi'an, China, August 24-26, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {959},
pages = {430--435},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/BFb0030862},
doi = {10.1007/BFB0030862},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/HemaspaandraR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RaoRW94,
author = {Rajesh P. N. Rao and
J{\"{o}}rg Rothe and
Osamu Watanabe},
title = {Upward Separation for FewP and Related Classes},
journal = {Inf. Process. Lett.},
volume = {52},
number = {4},
pages = {175--180},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90123-6},
doi = {10.1016/0020-0190(94)90123-6},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RaoRW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 17:34 CEST 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:
