Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Edith Hemaspaandra
@inproceedings{DBLP:conf/ecai/FitzsimmonsH23,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
editor = {Kobi Gal and
Ann Now{\'{e}} and
Grzegorz J. Nalepa and
Roy Fairstein and
Roxana Radulescu},
title = {Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery},
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 = {732--739},
publisher = {{IOS} Press},
year = {2023},
url = {https://doi.org/10.3233/FAIA230338},
doi = {10.3233/FAIA230338},
timestamp = {Wed, 18 Oct 2023 09:31:16 +0200},
biburl = {https://dblp.org/rec/conf/ecai/FitzsimmonsH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/FitzsimmonsH23,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
editor = {Henning Fernau and
Klaus Jansen},
title = {Complexity of Conformant Election Manipulation},
booktitle = {Fundamentals of Computation Theory - 24th International Symposium,
{FCT} 2023, Trier, Germany, September 18-21, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14292},
pages = {176--189},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43587-4\_13},
doi = {10.1007/978-3-031-43587-4\_13},
timestamp = {Mon, 25 Sep 2023 17:13:03 +0200},
biburl = {https://dblp.org/rec/conf/fct/FitzsimmonsH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/HassanHR23,
author = {Zohair Raza Hassan and
Edith Hemaspaandra and
Stanislaw P. Radziszowski},
editor = {Henning Fernau and
Klaus Jansen},
title = {The Complexity of (P\({}_{\mbox{k,}}\) P\({}_{\mbox{{\(\mathscr{l}\)}}}\)
)-Arrowing},
booktitle = {Fundamentals of Computation Theory - 24th International Symposium,
{FCT} 2023, Trier, Germany, September 18-21, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14292},
pages = {248--261},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43587-4\_18},
doi = {10.1007/978-3-031-43587-4\_18},
timestamp = {Mon, 25 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/HassanHR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcse/BezakovaFHMN23,
author = {Ivona Bez{\'{a}}kov{\'{a}} and
Kimberly Fluet and
Edith Hemaspaandra and
Hannah Miller and
David E. Narv{\'{a}}ez},
editor = {Maureen Doyle and
Ben Stephenson and
Brian Dorn and
Leen{-}Kiat Soh and
Lina Battestilli},
title = {Feedback Tools and Motivation to Persist in Intro {CS} Theory},
booktitle = {Proceedings of the 54th {ACM} Technical Symposium on Computer Science
Education, Volume 2, {SIGCSE} 2023, Toronto, ON, Canada, March 15-18,
2023},
pages = {1341},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3545947.3576287},
doi = {10.1145/3545947.3576287},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sigcse/BezakovaFHMN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-16889,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
title = {Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery},
journal = {CoRR},
volume = {abs/2305.16889},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.16889},
doi = {10.48550/ARXIV.2305.16889},
eprinttype = {arXiv},
eprint = {2305.16889},
timestamp = {Wed, 07 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-16889.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-10510,
author = {Zohair Raza Hassan and
Edith Hemaspaandra and
Stanislaw P. Radziszowski},
title = {The Complexity of (P\({}_{\mbox{k}}\), P\({}_{\mbox{{\unicode{120001}}}}\))-Arrowing},
journal = {CoRR},
volume = {abs/2307.10510},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.10510},
doi = {10.48550/ARXIV.2307.10510},
eprinttype = {arXiv},
eprint = {2307.10510},
timestamp = {Wed, 26 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-10510.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-11689,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
title = {Complexity of Conformant Election Manipulation},
journal = {CoRR},
volume = {abs/2307.11689},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.11689},
doi = {10.48550/ARXIV.2307.11689},
eprinttype = {arXiv},
eprint = {2307.11689},
timestamp = {Wed, 26 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-11689.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/ijcai/FitzsimmonsH22,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
editor = {Luc De Raedt},
title = {Insight into Voting Problem Complexity Using Randomized Classes},
booktitle = {Proceedings of the Thirty-First International Joint Conference on
Artificial Intelligence, {IJCAI} 2022, Vienna, Austria, 23-29 July
2022},
pages = {293--299},
publisher = {ijcai.org},
year = {2022},
url = {https://doi.org/10.24963/ijcai.2022/42},
doi = {10.24963/IJCAI.2022/42},
timestamp = {Wed, 27 Jul 2022 16:43:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/FitzsimmonsH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mkm/HemaspaandraN22,
author = {Edith Hemaspaandra and
David E. Narv{\'{a}}ez},
editor = {Kevin Buzzard and
Temur Kutsia},
title = {Formal Methods for {NFA} Equivalence: QBFs, Witness Extraction, and
Encoding Verification},
booktitle = {Intelligent Computer Mathematics - 15th International Conference,
{CICM} 2022, Tbilisi, Georgia, September 19-23, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13467},
pages = {241--255},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-16681-5\_17},
doi = {10.1007/978-3-031-16681-5\_17},
timestamp = {Thu, 22 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mkm/HemaspaandraN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcse/BezakovaFHMN21a,
author = {Ivona Bez{\'{a}}kov{\'{a}} and
Kimberly Fluet and
Edith Hemaspaandra and
Hannah Miller and
David E. Narv{\'{a}}ez},
editor = {Larry Merkle and
Maureen Doyle and
Judithe Sheard and
Leen{-}Kiat Soh and
Brian Dorn},
title = {Effective Succinct Feedback for Intro {CS} Theory: {A} {JFLAP} Extension},
booktitle = {{SIGCSE} 2022: The 53rd {ACM} Technical Symposium on Computer Science
Education, Providence, RI, USA, March 3-5, 2022, Volume 1},
pages = {976--982},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3478431.3499416},
doi = {10.1145/3478431.3499416},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigcse/BezakovaFHMN21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-12856,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
title = {Insight into Voting Problem Complexity Using Randomized Classes},
journal = {CoRR},
volume = {abs/2204.12856},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.12856},
doi = {10.48550/ARXIV.2204.12856},
eprinttype = {arXiv},
eprint = {2204.12856},
timestamp = {Fri, 29 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-12856.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/FitzsimmonsH21,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
editor = {Zhi{-}Hua Zhou},
title = {Kemeny Consensus Complexity},
booktitle = {Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence, {IJCAI} 2021, Virtual Event / Montreal, Canada, 19-27
August 2021},
pages = {196--202},
publisher = {ijcai.org},
year = {2021},
url = {https://doi.org/10.24963/ijcai.2021/28},
doi = {10.24963/IJCAI.2021/28},
timestamp = {Wed, 25 Aug 2021 17:11:16 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/FitzsimmonsH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcse/BezakovaFHMN21,
author = {Ivona Bez{\'{a}}kov{\'{a}} and
Kimberly Fluet and
Edith Hemaspaandra and
Hannah Miller and
David E. Narv{\'{a}}ez},
editor = {Mark Sherriff and
Laurence D. Merkle and
Pamela A. Cutter and
Alvaro E. Monge and
Judithe Sheard},
title = {Witness Feedback for Introductory {CS} Theory Assignments},
booktitle = {{SIGCSE} '21: The 52nd {ACM} Technical Symposium on Computer Science
Education, Virtual Event, USA, March 13-20, 2021},
pages = {1300},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3408877.3439585},
doi = {10.1145/3408877.3439585},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigcse/BezakovaFHMN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-08540,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
title = {Kemeny Consensus Complexity},
journal = {CoRR},
volume = {abs/2105.08540},
year = {2021},
url = {https://arxiv.org/abs/2105.08540},
eprinttype = {arXiv},
eprint = {2105.08540},
timestamp = {Mon, 31 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-08540.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/FitzsimmonsHH20,
author = {Zack Fitzsimmons and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {Control in the presence of manipulators: cooperative and competitive
cases},
journal = {Auton. Agents Multi Agent Syst.},
volume = {34},
number = {2},
pages = {52},
year = {2020},
url = {https://doi.org/10.1007/s10458-020-09475-6},
doi = {10.1007/S10458-020-09475-6},
timestamp = {Sat, 19 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aamas/FitzsimmonsHH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/FitzsimmonsHH20a,
author = {Zack Fitzsimmons and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {Correction to: Control in the presence of manipulators: cooperative
and competitive cases},
journal = {Auton. Agents Multi Agent Syst.},
volume = {34},
number = {2},
pages = {56},
year = {2020},
url = {https://doi.org/10.1007/s10458-020-09482-7},
doi = {10.1007/S10458-020-09482-7},
timestamp = {Sat, 14 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aamas/FitzsimmonsHH20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HemaspaandraHSW20,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Holger Spakowski and
Osamu Watanabe},
title = {The Robustness of {LWPP} and WPP, with an Application to Graph Reconstruction},
journal = {Comput. Complex.},
volume = {29},
number = {2},
pages = {7},
year = {2020},
url = {https://doi.org/10.1007/s00037-020-00197-5},
doi = {10.1007/S00037-020-00197-5},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HemaspaandraHSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/HemaspaandraHM20,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Curtis Menton},
title = {Search versus Decision for Election Manipulation Problems},
journal = {{ACM} Trans. Comput. Theory},
volume = {12},
number = {1},
pages = {3:1--3:42},
year = {2020},
url = {https://doi.org/10.1145/3369937},
doi = {10.1145/3369937},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toct/HemaspaandraHM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/FitzsimmonsH20,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
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 = {Election Score Can Be Harder than Winner},
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 = {83--90},
publisher = {{IOS} Press},
year = {2020},
url = {https://doi.org/10.3233/FAIA200079},
doi = {10.3233/FAIA200079},
timestamp = {Fri, 09 Apr 2021 18:50:05 +0200},
biburl = {https://dblp.org/rec/conf/ecai/FitzsimmonsH20.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/sigcse/BezakovaHLMN20,
author = {Ivona Bez{\'{a}}kov{\'{a}} and
Edith Hemaspaandra and
Aryeh Lieberman and
Hannah Miller and
David E. Narv{\'{a}}ez},
editor = {Jian Zhang and
Mark Sherriff and
Sarah Heckman and
Pamela A. Cutter and
Alvaro E. Monge},
title = {Prototype of an Automated Feedback Tool for Intro {CS} Theory},
booktitle = {Proceedings of the 51st {ACM} Technical Symposium on Computer Science
Education, {SIGCSE} 2020, Portland, OR, USA, March 11-14, 2020},
pages = {1311},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3328778.3372598},
doi = {10.1145/3328778.3372598},
timestamp = {Tue, 23 Mar 2021 10:54:19 +0100},
biburl = {https://dblp.org/rec/conf/sigcse/BezakovaHLMN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-01546,
author = {Ivona Bez{\'{a}}kov{\'{a}} and
Kimberly Fluet and
Edith Hemaspaandra and
Hannah Miller and
David E. Narv{\'{a}}ez},
title = {Effective Feedback for Introductory {CS} Theory: {A} {JFLAP} Extension
and Student Persistence},
journal = {CoRR},
volume = {abs/2012.01546},
year = {2020},
url = {https://arxiv.org/abs/2012.01546},
eprinttype = {arXiv},
eprint = {2012.01546},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-01546.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/FitzsimmonsH19,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
title = {High-multiplicity election problems},
journal = {Auton. Agents Multi Agent Syst.},
volume = {33},
number = {4},
pages = {383--402},
year = {2019},
url = {https://doi.org/10.1007/s10458-019-09410-4},
doi = {10.1007/S10458-019-09410-4},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aamas/FitzsimmonsH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/FitzsimmonsHHN19,
author = {Zack Fitzsimmons and
Edith Hemaspaandra and
Alexander Hoover and
David E. Narv{\'{a}}ez},
title = {Very Hard Electoral Control Problems},
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 = {1933--1940},
publisher = {{AAAI} Press},
year = {2019},
url = {https://doi.org/10.1609/aaai.v33i01.33011933},
doi = {10.1609/AAAI.V33I01.33011933},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/FitzsimmonsHHN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BurjonsFHKW19,
author = {Elisabet Burjons and
Fabian Frei and
Edith Hemaspaandra and
Dennis Komm and
David Wehner},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {Finding Optimal Solutions With Neighborly Help},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {78:1--78:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.78},
doi = {10.4230/LIPICS.MFCS.2019.78},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BurjonsFHKW19.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-1906-10078,
author = {Elisabet Burjons and
Fabian Frei and
Edith Hemaspaandra and
Dennis Komm and
David Wehner},
title = {Finding Optimal Solutions With Neighborly Help},
journal = {CoRR},
volume = {abs/1906.10078},
year = {2019},
url = {http://arxiv.org/abs/1906.10078},
eprinttype = {arXiv},
eprint = {1906.10078},
timestamp = {Thu, 27 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-10078.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}
}
@inproceedings{DBLP:conf/atal/FitzsimmonsH18,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
editor = {Elisabeth Andr{\'{e}} and
Sven Koenig and
Mehdi Dastani and
Gita Sukthankar},
title = {High-Multiplicity Election Problems},
booktitle = {Proceedings of the 17th International Conference on Autonomous Agents
and MultiAgent Systems, {AAMAS} 2018, Stockholm, Sweden, July 10-15,
2018},
pages = {1558--1566},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC, {USA} / {ACM}},
year = {2018},
url = {http://dl.acm.org/citation.cfm?id=3237932},
timestamp = {Sat, 30 Sep 2023 09:34:53 +0200},
biburl = {https://dblp.org/rec/conf/atal/FitzsimmonsH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HemaspaandraHS018,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Holger Spakowski and
Osamu Watanabe},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
title = {The Robustness of {LWPP} and WPP, with an Application to Graph Reconstruction},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
series = {LIPIcs},
volume = {117},
pages = {51:1--51:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.51},
doi = {10.4230/LIPICS.MFCS.2018.51},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/HemaspaandraHS018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-08763,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
title = {Election Score Can Be Harder Than Winner},
journal = {CoRR},
volume = {abs/1806.08763},
year = {2018},
url = {http://arxiv.org/abs/1806.08763},
eprinttype = {arXiv},
eprint = {1806.08763},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-08763.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-05438,
author = {Zack Fitzsimmons and
Edith Hemaspaandra and
Alexander Hoover and
David E. Narv{\'{a}}ez},
title = {Very Hard Electoral Control Problems},
journal = {CoRR},
volume = {abs/1811.05438},
year = {2018},
url = {http://arxiv.org/abs/1811.05438},
eprinttype = {arXiv},
eprint = {1811.05438},
timestamp = {Sat, 24 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-05438.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/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/FitzsimmonsH17,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
editor = {Satinder Singh and
Shaul Markovitch},
title = {The Complexity of Succinct Elections},
booktitle = {Proceedings of the Thirty-First {AAAI} Conference on Artificial Intelligence,
February 4-9, 2017, San Francisco, California, {USA}},
pages = {4921--4922},
publisher = {{AAAI} Press},
year = {2017},
url = {https://doi.org/10.1609/aaai.v31i1.11122},
doi = {10.1609/AAAI.V31I1.11122},
timestamp = {Mon, 04 Sep 2023 14:40:32 +0200},
biburl = {https://dblp.org/rec/conf/aaai/FitzsimmonsH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-00201,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {Credimus},
journal = {CoRR},
volume = {abs/1711.00201},
year = {2017},
url = {http://arxiv.org/abs/1711.00201},
eprinttype = {arXiv},
eprint = {1711.00201},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-00201.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-01250,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Holger Spakowski and
Osamu Watanabe},
title = {The Robustness of {LWPP} and WPP, with an Application to Graph Reconstruction},
journal = {CoRR},
volume = {abs/1711.01250},
year = {2017},
url = {http://arxiv.org/abs/1711.01250},
eprinttype = {arXiv},
eprint = {1711.01250},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-01250.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/FitzsimmonsHH16,
author = {Zack Fitzsimmons and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {Manipulation Complexity of Same-System Runoff Elections},
journal = {Ann. Math. Artif. Intell.},
volume = {77},
number = {3-4},
pages = {159--189},
year = {2016},
url = {https://doi.org/10.1007/s10472-015-9490-6},
doi = {10.1007/S10472-015-9490-6},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/FitzsimmonsHH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/HemaspaandraS16,
author = {Edith Hemaspaandra and
Henning Schnoor},
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 = {Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions},
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 = {1071--1079},
publisher = {{IOS} Press},
year = {2016},
url = {https://doi.org/10.3233/978-1-61499-672-9-1071},
doi = {10.3233/978-1-61499-672-9-1071},
timestamp = {Tue, 02 Nov 2021 15:59:05 +0100},
biburl = {https://dblp.org/rec/conf/ecai/HemaspaandraS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stairs/FitzsimmonsH16,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
editor = {David Pearce and
Helena Sofia Pinto},
title = {Modeling Single-Peakedness for Votes with Ties},
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 = {63--74},
publisher = {{IOS} Press},
year = {2016},
url = {https://doi.org/10.3233/978-1-61499-682-8-63},
doi = {10.3233/978-1-61499-682-8-63},
timestamp = {Mon, 01 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stairs/FitzsimmonsH16.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:reference/choice/CaragiannisHH16,
author = {Ioannis Caragiannis and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
editor = {Felix Brandt and
Vincent Conitzer and
Ulle Endriss and
J{\'{e}}r{\^{o}}me Lang and
Ariel D. Procaccia},
title = {Dodgson's Rule and Young's Rule},
booktitle = {Handbook of Computational Social Choice},
pages = {103--126},
publisher = {Cambridge University Press},
year = {2016},
url = {https://doi.org/10.1017/CBO9781107446984.006},
doi = {10.1017/CBO9781107446984.006},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/choice/CaragiannisHH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HemaspaandraS16,
author = {Edith Hemaspaandra and
Henning Schnoor},
title = {Complexity Dichotomies for Unweighted Scoring Rules},
journal = {CoRR},
volume = {abs/1604.05264},
year = {2016},
url = {http://arxiv.org/abs/1604.05264},
eprinttype = {arXiv},
eprint = {1604.05264},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HemaspaandraS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FitzsimmonsH16,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
title = {Modeling Single-Peakedness for Votes with Ties},
journal = {CoRR},
volume = {abs/1604.08191},
year = {2016},
url = {http://arxiv.org/abs/1604.08191},
eprinttype = {arXiv},
eprint = {1604.08191},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FitzsimmonsH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FitzsimmonsH16a,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
title = {The Complexity of Succinct Elections},
journal = {CoRR},
volume = {abs/1611.08927},
year = {2016},
url = {http://arxiv.org/abs/1611.08927},
eprinttype = {arXiv},
eprint = {1611.08927},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FitzsimmonsH16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/FaliszewskiHH15,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {Weighted Electoral Control},
journal = {J. Artif. Intell. Res.},
volume = {52},
pages = {507--542},
year = {2015},
url = {https://doi.org/10.1613/jair.4621},
doi = {10.1613/JAIR.4621},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/FaliszewskiHH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/BrandtBHH15,
author = {Felix Brandt and
Markus Brill and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {Bypassing Combinatorial Protections: Polynomial-Time Algorithms for
Single-Peaked Electorates},
journal = {J. Artif. Intell. Res.},
volume = {53},
pages = {439--496},
year = {2015},
url = {https://doi.org/10.1613/jair.4647},
doi = {10.1613/JAIR.4647},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/BrandtBHH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/FitzsimmonsH15,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
editor = {Toby Walsh},
title = {Complexity of Manipulative Actions When Voting with Ties},
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 = {103--119},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-23114-3\_7},
doi = {10.1007/978-3-319-23114-3\_7},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/aldt/FitzsimmonsH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/ErdelyiHH15,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
editor = {Toby Walsh},
title = {More Natural Models of Electoral Control by Partition},
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 = {396--413},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-23114-3\_24},
doi = {10.1007/978-3-319-23114-3\_24},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aldt/ErdelyiHH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/FaliszewskiHH15,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
editor = {Qiang Yang and
Michael J. Wooldridge},
title = {The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates
(Extended Abstract)},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July
25-31, 2015},
pages = {4178--4182},
publisher = {{AAAI} Press},
year = {2015},
url = {http://ijcai.org/Abstract/15/591},
timestamp = {Tue, 20 Aug 2019 16:16:43 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/FaliszewskiHH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FitzsimmonsH15,
author = {Zack Fitzsimmons and
Edith Hemaspaandra},
title = {Complexity of Manipulative Actions When Voting with Ties},
journal = {CoRR},
volume = {abs/1506.04722},
year = {2015},
url = {http://arxiv.org/abs/1506.04722},
eprinttype = {arXiv},
eprint = {1506.04722},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FitzsimmonsH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/FaliszewskiHH14,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {The complexity of manipulative attacks in nearly single-peaked electorates},
journal = {Artif. Intell.},
volume = {207},
pages = {69--99},
year = {2014},
url = {https://doi.org/10.1016/j.artint.2013.11.004},
doi = {10.1016/J.ARTINT.2013.11.004},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/FaliszewskiHH14.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/aaai/HemaspaandraHS14,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Henning Schnoor},
editor = {Carla E. Brodley and
Peter Stone},
title = {A Control Dichotomy for Pure Scoring Rules},
booktitle = {Proceedings of the Twenty-Eighth {AAAI} Conference on Artificial Intelligence,
July 27 -31, 2014, Qu{\'{e}}bec City, Qu{\'{e}}bec, Canada},
pages = {712--720},
publisher = {{AAAI} Press},
year = {2014},
url = {https://doi.org/10.1609/aaai.v28i1.8800},
doi = {10.1609/AAAI.V28I1.8800},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aaai/HemaspaandraHS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/ErdelyiHH14,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
editor = {Ana L. C. Bazzan and
Michael N. Huhns and
Alessio Lomuscio and
Paul Scerri},
title = {Bribery and voter control under voting-rule uncertainty},
booktitle = {International conference on Autonomous Agents and Multi-Agent Systems,
{AAMAS} '14, Paris, France, May 5-9, 2014},
pages = {61--68},
publisher = {{IFAAMAS/ACM}},
year = {2014},
url = {http://dl.acm.org/citation.cfm?id=2615744},
timestamp = {Thu, 25 Sep 2014 07:46:15 +0200},
biburl = {https://dblp.org/rec/conf/atal/ErdelyiHH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HemaspaandraHS14,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Henning Schnoor},
title = {A Control Dichotomy for Pure Scoring Rules},
journal = {CoRR},
volume = {abs/1404.4560},
year = {2014},
url = {http://arxiv.org/abs/1404.4560},
eprinttype = {arXiv},
eprint = {1404.4560},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HemaspaandraHS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ErdelyiHH14,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {More Natural Models of Electoral Control by Partition},
journal = {CoRR},
volume = {abs/1410.2652},
year = {2014},
url = {http://arxiv.org/abs/1410.2652},
eprinttype = {arXiv},
eprint = {1410.2652},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ErdelyiHH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/FaliszewskiHH13,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
editor = {Maria L. Gini and
Onn Shehory and
Takayuki Ito and
Catholijn M. Jonker},
title = {Weighted electoral control},
booktitle = {International conference on Autonomous Agents and Multi-Agent Systems,
{AAMAS} '13, Saint Paul, MN, USA, May 6-10, 2013},
pages = {367--374},
publisher = {{IFAAMAS}},
year = {2013},
url = {http://dl.acm.org/citation.cfm?id=2484980},
timestamp = {Thu, 09 Sep 2021 16:09:54 +0200},
biburl = {https://dblp.org/rec/conf/atal/FaliszewskiHH13.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/ijcai/FitzsimmonsHH13,
author = {Zack Fitzsimmons and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
editor = {Francesca Rossi},
title = {Control in the Presence of Manipulators: Cooperative and Competitive
Cases},
booktitle = {{IJCAI} 2013, Proceedings of the 23rd International Joint Conference
on Artificial Intelligence, Beijing, China, August 3-9, 2013},
pages = {113--119},
publisher = {{IJCAI/AAAI}},
year = {2013},
url = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6663},
timestamp = {Tue, 23 Jan 2024 13:25:46 +0100},
biburl = {https://dblp.org/rec/conf/ijcai/FitzsimmonsHH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HemaspaandraHM13,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Curtis Menton},
editor = {Natacha Portier and
Thomas Wilke},
title = {Search versus Decision for Election Manipulation Problems},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {377--388},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.377},
doi = {10.4230/LIPICS.STACS.2013.377},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/HemaspaandraHM13.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-1301-6118,
author = {Zack Fitzsimmons and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {X {THEN} {X:} Manipulation of Same-System Runoff Elections},
journal = {CoRR},
volume = {abs/1301.6118},
year = {2013},
url = {http://arxiv.org/abs/1301.6118},
eprinttype = {arXiv},
eprint = {1301.6118},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-6118.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-0943,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {Weighted Electoral Control},
journal = {CoRR},
volume = {abs/1305.0943},
year = {2013},
url = {http://arxiv.org/abs/1305.0943},
eprinttype = {arXiv},
eprint = {1305.0943},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-0943.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FitzsimmonsHH13,
author = {Zack Fitzsimmons and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {Control in the Presence of Manipulators: Cooperative and Competitive
Cases},
journal = {CoRR},
volume = {abs/1308.0544},
year = {2013},
url = {http://arxiv.org/abs/1308.0544},
eprinttype = {arXiv},
eprint = {1308.0544},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FitzsimmonsHH13.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}
}
@inproceedings{DBLP:conf/ecai/FaliszewskiHS12,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Henning Schnoor},
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 = {Weighted Manipulation for Four-Candidate Llull Is Easy},
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 = {318--323},
publisher = {{IOS} Press},
year = {2012},
url = {https://doi.org/10.3233/978-1-61499-098-7-318},
doi = {10.3233/978-1-61499-098-7-318},
timestamp = {Mon, 19 Jun 2023 16:36:09 +0200},
biburl = {https://dblp.org/rec/conf/ecai/FaliszewskiHS12.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}
}
@article{DBLP:journals/corr/abs-1202-6641,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Curtis Menton},
title = {Search versus Decision for Election Manipulation Problems},
journal = {CoRR},
volume = {abs/1202.6641},
year = {2012},
url = {http://arxiv.org/abs/1202.6641},
eprinttype = {arXiv},
eprint = {1202.6641},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-6641.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/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}
}
@article{DBLP:journals/jair/FaliszewskiHH11,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {Multimode Control Attacks on Elections},
journal = {J. Artif. Intell. Res.},
volume = {40},
pages = {305--351},
year = {2011},
url = {https://doi.org/10.1613/jair.3136},
doi = {10.1613/JAIR.3136},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/FaliszewskiHH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/HemaspaandraS11,
author = {Edith Hemaspaandra and
Henning Schnoor},
editor = {Toby Walsh},
title = {Minimization for Generalized Boolean Formulas},
booktitle = {{IJCAI} 2011, Proceedings of the 22nd International Joint Conference
on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22,
2011},
pages = {566--571},
publisher = {{IJCAI/AAAI}},
year = {2011},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-102},
doi = {10.5591/978-1-57735-516-8/IJCAI11-102},
timestamp = {Tue, 20 Aug 2019 16:16:04 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/HemaspaandraS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HemaspaandraS11,
author = {Edith Hemaspaandra and
Henning Schnoor},
editor = {Filip Murlak and
Piotr Sankowski},
title = {A Universally Defined Undecidable Unimodal Logic},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {364--375},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_34},
doi = {10.1007/978-3-642-22993-0\_34},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HemaspaandraS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tark/FaliszewskiHH11,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
editor = {Krzysztof R. Apt},
title = {The complexity of manipulative attacks in nearly single-peaked electorates},
booktitle = {Proceedings of the 13th Conference on Theoretical Aspects of Rationality
and Knowledge (TARK-2011), Groningen, The Netherlands, July 12-14,
2011},
pages = {228--237},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/2000378.2000406},
doi = {10.1145/2000378.2000406},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tark/FaliszewskiHH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-2312,
author = {Edith Hemaspaandra and
Henning Schnoor},
title = {Minimization for Generalized Boolean Formulas},
journal = {CoRR},
volume = {abs/1104.2312},
year = {2011},
url = {http://arxiv.org/abs/1104.2312},
eprinttype = {arXiv},
eprint = {1104.2312},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-2312.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-0845,
author = {Edith Hemaspaandra and
Henning Schnoor},
title = {A Simplest Undecidable Modal Logic},
journal = {CoRR},
volume = {abs/1105.0845},
year = {2011},
url = {http://arxiv.org/abs/1105.0845},
eprinttype = {arXiv},
eprint = {1105.0845},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-0845.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-5032,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates},
journal = {CoRR},
volume = {abs/1105.5032},
year = {2011},
url = {http://arxiv.org/abs/1105.5032},
eprinttype = {arXiv},
eprint = {1105.5032},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-5032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/FaliszewskiHH10,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {Using complexity to protect elections},
journal = {Commun. {ACM}},
volume = {53},
number = {11},
pages = {74--82},
year = {2010},
url = {https://doi.org/10.1145/1839676.1839696},
doi = {10.1145/1839676.1839696},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cacm/FaliszewskiHH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HemaspaandraSS10,
author = {Edith Hemaspaandra and
Henning Schnoor and
Ilka Schnoor},
title = {Generalized modal satisfiability},
journal = {J. Comput. Syst. Sci.},
volume = {76},
number = {7},
pages = {561--578},
year = {2010},
url = {https://doi.org/10.1016/j.jcss.2009.10.011},
doi = {10.1016/J.JCSS.2009.10.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HemaspaandraSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HemaspaandraHTW10,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Till Tantau and
Osamu Watanabe},
title = {On the complexity of kings},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {4-5},
pages = {783--798},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2009.10.015},
doi = {10.1016/J.TCS.2009.10.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraHTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/BrandtBHH10,
author = {Felix Brandt and
Markus Brill and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
editor = {Maria Fox and
David Poole},
title = {Bypassing Combinatorial Protections: Polynomial-Time Algorithms for
Single-Peaked Electorates},
booktitle = {Proceedings of the Twenty-Fourth {AAAI} Conference on Artificial Intelligence,
{AAAI} 2010, Atlanta, Georgia, USA, July 11-15, 2010},
pages = {715--722},
publisher = {{AAAI} Press},
year = {2010},
url = {https://doi.org/10.1609/aaai.v24i1.7637},
doi = {10.1609/AAAI.V24I1.7637},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aaai/BrandtBHH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/FaliszewskiHS10,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Henning Schnoor},
editor = {Wiebe van der Hoek and
Gal A. Kaminka and
Yves Lesp{\'{e}}rance and
Michael Luck and
Sandip Sen},
title = {Manipulation of copeland elections},
booktitle = {9th International Conference on Autonomous Agents and Multiagent Systems
{(AAMAS} 2010), Toronto, Canada, May 10-14, 2010, Volume 1-3},
pages = {367--374},
publisher = {{IFAAMAS}},
year = {2010},
url = {https://dl.acm.org/citation.cfm?id=1838258},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/atal/FaliszewskiHS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-1800,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {Multimode Control Attacks on Elections},
journal = {CoRR},
volume = {abs/1007.1800},
year = {2010},
url = {http://arxiv.org/abs/1007.1800},
eprinttype = {arXiv},
eprint = {1007.1800},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-1800.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/jair/FaliszewskiHH09,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {How Hard Is Bribery in Elections?},
journal = {J. Artif. Intell. Res.},
volume = {35},
pages = {485--532},
year = {2009},
url = {https://doi.org/10.1613/jair.2676},
doi = {10.1613/JAIR.2676},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/FaliszewskiHH09.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/mst/BaulandH09,
author = {Michael Bauland and
Edith Hemaspaandra},
title = {Isomorphic Implication},
journal = {Theory Comput. Syst.},
volume = {44},
number = {1},
pages = {117--139},
year = {2009},
url = {https://doi.org/10.1007/s00224-007-9038-1},
doi = {10.1007/S00224-007-9038-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BaulandH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/FaliszewskiHH09,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
editor = {Craig Boutilier},
title = {Multimode Control Attacks on Elections},
booktitle = {{IJCAI} 2009, Proceedings of the 21st International Joint Conference
on Artificial Intelligence, Pasadena, California, USA, July 11-17,
2009},
pages = {128--133},
year = {2009},
url = {http://ijcai.org/Proceedings/09/Papers/032.pdf},
timestamp = {Tue, 20 Aug 2019 16:16:40 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/FaliszewskiHH09.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}
}
@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}
}
@inproceedings{DBLP:conf/aaai/BrelsfordFHSS08,
author = {Eric Brelsford and
Piotr Faliszewski and
Edith Hemaspaandra and
Henning Schnoor and
Ilka Schnoor},
editor = {Dieter Fox and
Carla P. Gomes},
title = {Approximability of Manipulating Elections},
booktitle = {Proceedings of the Twenty-Third {AAAI} Conference on Artificial Intelligence,
{AAAI} 2008, Chicago, Illinois, USA, July 13-17, 2008},
pages = {44--49},
publisher = {{AAAI} Press},
year = {2008},
url = {http://www.aaai.org/Library/AAAI/2008/aaai08-007.php},
timestamp = {Tue, 05 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/BrelsfordFHSS08.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/atal/FaliszewskiHS08,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Henning Schnoor},
editor = {Lin Padgham and
David C. Parkes and
J{\"{o}}rg P. M{\"{u}}ller and
Simon Parsons},
title = {Copeland voting: ties matter},
booktitle = {7th International Joint Conference on Autonomous Agents and Multiagent
Systems {(AAMAS} 2008), Estoril, Portugal, May 12-16, 2008, Volume
2},
pages = {983--990},
publisher = {{IFAAMAS}},
year = {2008},
url = {https://dl.acm.org/citation.cfm?id=1402359},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/atal/FaliszewskiHS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HemaspaandraS08,
author = {Edith Hemaspaandra and
Henning Schnoor},
editor = {Susanne Albers and
Pascal Weil},
title = {On the Complexity of Elementary Modal Logics},
booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer
Science, Bordeaux, France, February 21-23, 2008, Proceedings},
series = {LIPIcs},
volume = {1},
pages = {349--360},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1356},
doi = {10.4230/LIPICS.STACS.2008.1356},
timestamp = {Tue, 22 Jun 2021 15:44:08 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HemaspaandraS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-1884,
author = {Edith Hemaspaandra and
Henning Schnoor},
title = {On the Complexity of Elementary Modal Logics},
journal = {CoRR},
volume = {abs/0802.1884},
year = {2008},
url = {http://arxiv.org/abs/0802.1884},
eprinttype = {arXiv},
eprint = {0802.1884},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-1884.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0804-2729,
author = {Edith Hemaspaandra and
Henning Schnoor and
Ilka Schnoor},
title = {Generalized Modal Satisfiability},
journal = {CoRR},
volume = {abs/0804.2729},
year = {2008},
url = {http://arxiv.org/abs/0804.2729},
eprinttype = {arXiv},
eprint = {0804.2729},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0804-2729.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/dam/HemaspaandraHRT07,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Stanislaw P. Radziszowski and
Rahul Tripathi},
title = {Complexity results in graph reconstruction},
journal = {Discret. Appl. Math.},
volume = {155},
number = {2},
pages = {103--118},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2006.04.038},
doi = {10.1016/J.DAM.2006.04.038},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HemaspaandraHRT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HemaspaandraH07,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {Dichotomy for voting systems},
journal = {J. Comput. Syst. Sci.},
volume = {73},
number = {1},
pages = {73--83},
year = {2007},
url = {https://doi.org/10.1016/j.jcss.2006.09.002},
doi = {10.1016/J.JCSS.2006.09.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HemaspaandraH07.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/HemaspaandraHTW07,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Till Tantau and
Osamu Watanabe},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Zolt{\'{a}}n {\'{E}}sik},
title = {On the Complexity of Kings},
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 = {328--340},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74240-1\_29},
doi = {10.1007/978-3-540-74240-1\_29},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/HemaspaandraHTW07.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}
}
@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/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}
}
@inproceedings{DBLP:conf/aaai/FaliszewskiHH06,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {The Complexity of Bribery in Elections},
booktitle = {Proceedings, The Twenty-First National Conference on Artificial Intelligence
and the Eighteenth Innovative Applications of Artificial Intelligence
Conference, July 16-20, 2006, Boston, Massachusetts, {USA}},
pages = {641--646},
publisher = {{AAAI} Press},
year = {2006},
url = {http://www.aaai.org/Library/AAAI/2006/aaai06-102.php},
timestamp = {Tue, 05 Sep 2023 09:10:47 +0200},
biburl = {https://dblp.org/rec/conf/aaai/FaliszewskiHH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BaulandHSS06,
author = {Michael Bauland and
Edith Hemaspaandra and
Henning Schnoor and
Ilka Schnoor},
editor = {Bruno Durand and
Wolfgang Thomas},
title = {Generalized Modal Satisfiability},
booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
Science, Marseille, France, February 23-25, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3884},
pages = {500--511},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11672142\_41},
doi = {10.1007/11672142\_41},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BaulandHSS06.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-0608081,
author = {Piotr Faliszewski and
Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {How Hard Is Bribery in Elections?},
journal = {CoRR},
volume = {abs/cs/0608081},
year = {2006},
url = {http://arxiv.org/abs/cs/0608081},
eprinttype = {arXiv},
eprint = {cs/0608081},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0608081.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/siamcomp/HemaspaandraHH05,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {Extending Downward Collapse from 1-versus-2 Queries to m-versus-m
+ 1 Queries},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1352--1369},
year = {2005},
url = {https://doi.org/10.1137/S0097539701391002},
doi = {10.1137/S0097539701391002},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HemaspaandraHH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HemaspaandraHH05,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {All superlinear inverse schemes are coNP-hard},
journal = {Theor. Comput. Sci.},
volume = {345},
number = {2-3},
pages = {345--358},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.07.015},
doi = {10.1016/J.TCS.2005.07.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraHH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HemaspaandraSV05,
author = {Edith Hemaspaandra and
Holger Spakowski and
J{\"{o}}rg Vogel},
title = {The complexity of Kemeny elections},
journal = {Theor. Comput. Sci.},
volume = {349},
number = {3},
pages = {382--391},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.08.031},
doi = {10.1016/J.TCS.2005.08.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraSV05.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/mfcs/BaulandH05,
author = {Michael Bauland and
Edith Hemaspaandra},
editor = {Joanna Jedrzejowicz and
Andrzej Szepietowski},
title = {Isomorphic Implication},
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 = {119--130},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11549345\_12},
doi = {10.1007/11549345\_12},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BaulandH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0504075,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {Dichotomy for Voting Systems},
journal = {CoRR},
volume = {abs/cs/0504075},
year = {2005},
url = {http://arxiv.org/abs/cs/0504075},
eprinttype = {arXiv},
eprint = {cs/0504075},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0504075.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0506055,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Osamu Watanabe},
title = {The Complexity of Kings},
journal = {CoRR},
volume = {abs/cs/0506055},
year = {2005},
url = {http://arxiv.org/abs/cs/0506055},
eprinttype = {arXiv},
eprint = {cs/0506055},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0506055.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}
}
@inproceedings{DBLP:conf/latin/HemaspaandraST04,
author = {Edith Hemaspaandra and
Holger Spakowski and
Mayur Thakur},
editor = {Martin Farach{-}Colton},
title = {Complexity of Cycle Length Modularity Problems in Graphs},
booktitle = {{LATIN} 2004: Theoretical Informatics, 6th Latin American Symposium,
Buenos Aires, Argentina, April 5-8, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2976},
pages = {509--518},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24698-5\_54},
doi = {10.1007/978-3-540-24698-5\_54},
timestamp = {Fri, 09 Apr 2021 18:42:35 +0200},
biburl = {https://dblp.org/rec/conf/latin/HemaspaandraST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HemaspaandraHRT04,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Stanislaw P. Radziszowski and
Rahul Tripathi},
editor = {Jir{\'{\i}} Fiala and
V{\'{a}}clav Koubek and
Jan Kratochv{\'{\i}}l},
title = {Complexity Results in Graph Reconstruction},
booktitle = {Mathematical Foundations of Computer Science 2004, 29th International
Symposium, {MFCS} 2004, Prague, Czech Republic, August 22-27, 2004,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3153},
pages = {287--297},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28629-5\_20},
doi = {10.1007/978-3-540-28629-5\_20},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HemaspaandraHRT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HemaspaandraHH04,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
editor = {Jir{\'{\i}} Fiala and
V{\'{a}}clav Koubek and
Jan Kratochv{\'{\i}}l},
title = {All Superlinear Inverse Schemes Are coNP-Hard},
booktitle = {Mathematical Foundations of Computer Science 2004, 29th International
Symposium, {MFCS} 2004, Prague, Czech Republic, August 22-27, 2004,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3153},
pages = {368--379},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28629-5\_27},
doi = {10.1007/978-3-540-28629-5\_27},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HemaspaandraHH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BohlerHRV04,
author = {Elmar B{\"{o}}hler and
Edith Hemaspaandra and
Steffen Reith and
Heribert Vollmer},
editor = {Volker Diekert and
Michel Habib},
title = {The Complexity of Boolean Constraint Isomorphism},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {164--175},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_15},
doi = {10.1007/978-3-540-24749-4\_15},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BohlerHRV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0412062,
author = {Michael Bauland and
Edith Hemaspaandra},
title = {Isomorphic Implication},
journal = {CoRR},
volume = {abs/cs/0412062},
year = {2004},
url = {http://arxiv.org/abs/cs/0412062},
eprinttype = {arXiv},
eprint = {cs/0412062},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0412062.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0406006,
author = {Edith Hemaspaandra},
title = {Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas},
journal = {CoRR},
volume = {cs.CC/0406006},
year = {2004},
url = {http://arxiv.org/abs/cs/0406006},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0406006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0410021,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Stanislaw P. Radziszowski and
Rahul Tripathi},
title = {Complexity Results in Graph Reconstruction},
journal = {CoRR},
volume = {cs.CC/0410021},
year = {2004},
url = {http://arxiv.org/abs/cs.CC/0410021},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0410021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0410023,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {All Superlinear Inverse Schemes are coNP-Hard},
journal = {CoRR},
volume = {cs.CC/0410023},
year = {2004},
url = {http://arxiv.org/abs/cs.CC/0410023},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0410023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0306131,
author = {Edith Hemaspaandra and
Holger Spakowski and
Mayur Thakur},
title = {Complexity of Cycle Length Modularity Problems in Graphs},
journal = {CoRR},
volume = {cs.CC/0306131},
year = {2003},
url = {http://arxiv.org/abs/cs/0306131},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0306131.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0306134,
author = {Elmar B{\"{o}}hler and
Edith Hemaspaandra and
Steffen Reith and
Heribert Vollmer},
title = {The Complexity of Boolean Constraint Isomorphism},
journal = {CoRR},
volume = {cs.CC/0306134},
year = {2003},
url = {http://arxiv.org/abs/cs/0306134},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0306134.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HemaspaandraHZ02,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Marius Zimand},
title = {Almost-Everywhere Superiority for Quantum Polynomial Time},
journal = {Inf. Comput.},
volume = {175},
number = {2},
pages = {171--181},
year = {2002},
url = {https://doi.org/10.1006/inco.2001.3110},
doi = {10.1006/INCO.2001.3110},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/HemaspaandraHZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HemaspaandraW02,
author = {Edith Hemaspaandra and
Gerd Wechsung},
title = {The Minimization Problem for Boolean Formulas},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {6},
pages = {1948--1958},
year = {2002},
url = {https://doi.org/10.1137/S0097539799362639},
doi = {10.1137/S0097539799362639},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HemaspaandraW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/BohlerHRV02,
author = {Elmar B{\"{o}}hler and
Edith Hemaspaandra and
Steffen Reith and
Heribert Vollmer},
editor = {Julian C. Bradfield},
title = {Equivalence and Isomorphism for Boolean Constraint Satisfaction},
booktitle = {Computer Science Logic, 16th International Workshop, {CSL} 2002, 11th
Annual Conference of the EACSL, Edinburgh, Scotland, UK, September
22-25, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2471},
pages = {412--426},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45793-3\_28},
doi = {10.1007/3-540-45793-3\_28},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/BohlerHRV02.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-0202036,
author = {Elmar B{\"{o}}hler and
Edith Hemaspaandra and
Steffen Reith and
Heribert Vollmer},
title = {Equivalence and Isomorphism for Boolean Constraint Satisfaction},
journal = {CoRR},
volume = {cs.CC/0202036},
year = {2002},
url = {https://arxiv.org/abs/cs/0202036},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0202036.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/Hemaspaandra01,
author = {Edith Hemaspaandra},
title = {The Complexity of Poor Man's Logic},
journal = {J. Log. Comput.},
volume = {11},
number = {4},
pages = {609--622},
year = {2001},
url = {https://doi.org/10.1093/logcom/11.4.609},
doi = {10.1093/LOGCOM/11.4.609},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/Hemaspaandra01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0106037,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {Using the No-Search Easy-Hard Technique for Downward Collapse},
journal = {CoRR},
volume = {cs.CC/0106037},
year = {2001},
url = {https://arxiv.org/abs/cs/0106037},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0106037.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}
}
@inproceedings{DBLP:conf/csl/Hemaspaandra00,
author = {Edith Hemaspaandra},
editor = {Peter Clote and
Helmut Schwichtenberg},
title = {Modal Satisfiability Is in Deterministic Linear Space},
booktitle = {Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau,
Germany, August 21-26, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1862},
pages = {332--342},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44622-2\_22},
doi = {10.1007/3-540-44622-2\_22},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/Hemaspaandra00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HemaspaandraH00,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra},
editor = {Mogens Nielsen and
Branislav Rovan},
title = {Computational Politics: Electoral Systems},
booktitle = {Mathematical Foundations of Computer Science 2000, 25th International
Symposium, {MFCS} 2000, Bratislava, Slovakia, August 28 - September
1, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1893},
pages = {64--83},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44612-5\_5},
doi = {10.1007/3-540-44612-5\_5},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HemaspaandraH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Hemaspaandra00,
author = {Edith Hemaspaandra},
editor = {Horst Reichel and
Sophie Tison},
title = {The Complexity of Poor Man's Logic},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {230--242},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_19},
doi = {10.1007/3-540-46541-3\_19},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Hemaspaandra00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jucs/Hemaspaandra99,
author = {Edith Hemaspaandra},
title = {On the Power of Positive Turing Reductions},
journal = {J. Univers. Comput. Sci.},
volume = {5},
number = {12},
pages = {828--832},
year = {1999},
url = {https://doi.org/10.3217/jucs-005-12-0828},
doi = {10.3217/JUCS-005-12-0828},
timestamp = {Thu, 07 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jucs/Hemaspaandra99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HemaspaandraHH99,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
editor = {Christoph Meinel and
Sophie Tison},
title = {Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1
Queries},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {269--280},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_25},
doi = {10.1007/3-540-49116-3\_25},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HemaspaandraHH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9906028,
author = {Edith Hemaspaandra},
title = {On the Power of Positive Turing Reductions},
journal = {CoRR},
volume = {cs.CC/9906028},
year = {1999},
url = {https://arxiv.org/abs/cs/9906028},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9906028.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-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-9910002,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {What's Up with Downward Collapse: Using the Easy-Hard Technique to
Link Boolean and Polynomial Hierarchy Collapses},
journal = {CoRR},
volume = {cs.CC/9910002},
year = {1999},
url = {https://arxiv.org/abs/cs/9910002},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9910003,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {R\({}_{\mbox{1-tt}}\)\({}^{\mbox{SN}}\)(NP) Distinguishes Robust Many-One
and Turing Completeness},
journal = {CoRR},
volume = {cs.CC/9910003},
year = {1999},
url = {https://arxiv.org/abs/cs/9910003},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9910004,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {An Introduction to Query Order},
journal = {CoRR},
volume = {cs.CC/9910004},
year = {1999},
url = {https://arxiv.org/abs/cs/9910004},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9910005,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {Query Order and the Polynomial Hierarchy},
journal = {CoRR},
volume = {cs.CC/9910005},
year = {1999},
url = {https://arxiv.org/abs/cs/9910005},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9910007,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {A Downward Collapse within the Polynomial Hierarchy},
journal = {CoRR},
volume = {cs.CC/9910007},
year = {1999},
url = {https://arxiv.org/abs/cs/9910007},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9910008,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {Translating Equality Downwards},
journal = {CoRR},
volume = {cs.CC/9910008},
year = {1999},
url = {https://arxiv.org/abs/cs/9910008},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9910008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-LO-9911014,
author = {Edith Hemaspaandra},
title = {The Complexity of Poor Man's Logic},
journal = {CoRR},
volume = {cs.LO/9911014},
year = {1999},
url = {https://arxiv.org/abs/cs/9911014},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-LO-9911014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/quant-ph-9910033,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Marius Zimand},
title = {Almost-Everywhere Superiority for Quantum Computing},
journal = {CoRR},
volume = {quant-ph/9910033},
year = {1999},
url = {http://arxiv.org/abs/quant-ph/9910033},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/quant-ph-9910033.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/jucs/HemaspaandraHH98,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {Query Order and the Polynomial Hierarchy},
journal = {J. Univers. Comput. Sci.},
volume = {4},
number = {6},
pages = {574--588},
year = {1998},
url = {https://doi.org/10.3217/jucs-004-06-0574},
doi = {10.3217/JUCS-004-06-0574},
timestamp = {Thu, 07 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jucs/HemaspaandraHH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HemaspaandraHH98,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {R\({}^{\mbox{\emph{S N}}}\)\({}_{\mbox{1-tt}}\) {(NP)} Distinguishes
Robust Many-One and Turing Completeness},
journal = {Theory Comput. Syst.},
volume = {31},
number = {3},
pages = {307--325},
year = {1998},
url = {https://doi.org/10.1007/s002240000090},
doi = {10.1007/S002240000090},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HemaspaandraHH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HemaspaandraHH98,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {A Downward Collapse within the Polynomial Hierarchy},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {2},
pages = {383--393},
year = {1998},
url = {https://doi.org/10.1137/S0097539796306474},
doi = {10.1137/S0097539796306474},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HemaspaandraHH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/HemaspaandraHH98,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {What's up with downward collapse: using the easy-hard technique to
link Boolean and polynomial hierarchy collapses},
journal = {{SIGACT} News},
volume = {29},
number = {3},
pages = {10--22},
year = {1998},
url = {https://doi.org/10.1145/300307.300308},
doi = {10.1145/300307.300308},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/HemaspaandraHH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-9808002,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {Downward Collapse from a Weaker Hypothesis},
journal = {CoRR},
volume = {cs.CC/9808002},
year = {1998},
url = {https://arxiv.org/abs/cs/9808002},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-9808002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/HemaspaandraHH97,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {An Introduction to Query Order},
journal = {Bull. {EATCS}},
volume = {63},
year = {1997},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/HemaspaandraHH97.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/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/HemaspaandraHH97,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {R\({}^{\mbox{SN}}\)\({}_{\mbox{1-tt}}\)(NP) Distinguishes Robust Many-One
and Turing Completeness},
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 = {49--60},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_60},
doi = {10.1007/3-540-62592-5\_60},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HemaspaandraHH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/HemaspaandraHH97,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
editor = {Bogdan S. Chlebus and
Ludwik Czaja},
title = {Query Order in the Polynomial Hierarchy},
booktitle = {Fundamentals of Computation Theory, 11th International Symposium,
{FCT} '97, Krak{\'{o}}w, Poland, September 1-3, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1279},
pages = {222--232},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0036186},
doi = {10.1007/BFB0036186},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/HemaspaandraHH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HemaspaandraW97,
author = {Edith Hemaspaandra and
Gerd Wechsung},
title = {The Minimization Problem for Boolean Formulas},
booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
Miami Beach, Florida, USA, October 19-22, 1997},
pages = {575--584},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/SFCS.1997.646147},
doi = {10.1109/SFCS.1997.646147},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HemaspaandraW97.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/stacs/HemaspaandraHH97,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {A Downward Translation in the Polynomial Hierarchy},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {319--328},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023469},
doi = {10.1007/BFB0023469},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HemaspaandraHH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HemaspaandraNOS96,
author = {Edith Hemaspaandra and
Ashish V. Naik and
Mitsunori Ogihara and
Alan L. Selman},
title = {P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {194--209},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0061},
doi = {10.1006/JCSS.1996.0061},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HemaspaandraNOS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ndjfl/Hemaspaandra96,
author = {Edith Hemaspaandra},
title = {The Price of Universality},
journal = {Notre Dame J. Formal Log.},
volume = {37},
number = {2},
pages = {174--203},
year = {1996},
url = {https://doi.org/10.1305/ndjfl/1040046086},
doi = {10.1305/NDJFL/1040046086},
timestamp = {Thu, 21 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ndjfl/Hemaspaandra96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanHL95,
author = {Harry Buhrman and
Edith Hemaspaandra and
Luc Longpr{\'{e}}},
title = {{SPARSE} Reduces Conjunctively to {TALLY}},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {673--681},
year = {1995},
url = {https://doi.org/10.1137/0224044},
doi = {10.1137/0224044},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanHL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hemaspaandra94,
author = {Edith Hemaspaandra},
title = {Census Techniques Collapse Space Classes},
journal = {Inf. Process. Lett.},
volume = {51},
number = {2},
pages = {79--84},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00059-X},
doi = {10.1016/0020-0190(94)00059-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hemaspaandra94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HemaspaandraH94,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra},
title = {Quasi-injective Reductions},
journal = {Theor. Comput. Sci.},
volume = {123},
number = {2},
pages = {407--413},
year = {1994},
url = {https://doi.org/10.1016/0304-3975(94)90137-6},
doi = {10.1016/0304-3975(94)90137-6},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Hemaspaandra94,
author = {Edith Hemaspaandra},
title = {Complexity Transfer for Modal Logic (Extended Abstract)},
booktitle = {Proceedings of the Ninth Annual Symposium on Logic in Computer Science
{(LICS} '94), Paris, France, July 4-7, 1994},
pages = {164--173},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/LICS.1994.316074},
doi = {10.1109/LICS.1994.316074},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Hemaspaandra94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BuhrmanST93,
author = {Harry Buhrman and
Edith Spaan and
Leen Torenvliet},
title = {The Relative Power of Logspace and Polynomial Time Reductions},
journal = {Comput. Complex.},
volume = {3},
pages = {231--244},
year = {1993},
url = {https://doi.org/10.1007/BF01271369},
doi = {10.1007/BF01271369},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BuhrmanST93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jolli/BlackburnS93,
author = {Patrick Blackburn and
Edith Spaan},
title = {A modal perspective on the computational complexity of attribute value
grammar},
journal = {J. Log. Lang. Inf.},
volume = {2},
number = {2},
pages = {129--169},
year = {1993},
url = {https://doi.org/10.1007/BF01050635},
doi = {10.1007/BF01050635},
timestamp = {Thu, 17 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jolli/BlackburnS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanLS93,
author = {Harry Buhrman and
Luc Longpr{\'{e}} and
Edith Spaan},
title = {{SPARSE} reduces conjunctively to {TALLY}},
booktitle = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference,
San Diego, CA, USA, May 18-21, 1993},
pages = {208--214},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SCT.1993.336525},
doi = {10.1109/SCT.1993.336525},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanLS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BuhrmanST92,
author = {Harry Buhrman and
Edith Spaan and
Leen Torenvliet},
editor = {Klaus Ambos{-}Spies and
Steven Homer and
Uwe Sch{\"{o}}ning},
title = {Bounded Reductions},
booktitle = {Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8,
1992},
pages = {83--99},
publisher = {Cambridge University Press},
year = {1992},
timestamp = {Mon, 15 Jul 2002 11:29:49 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BuhrmanST92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rta/DenneheuvelKLS91,
author = {Sieger van Denneheuvel and
Karen L. Kwast and
Gerard R. Renardel de Lavalette and
Edith Spaan},
editor = {Ronald V. Book},
title = {Query Optimization Using Rewrite Rules},
booktitle = {Rewriting Techniques and Applications, 4th International Conference,
RTA-91, Como, Italy, April 10-12, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {488},
pages = {252--263},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-53904-2\_101},
doi = {10.1007/3-540-53904-2\_101},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/rta/DenneheuvelKLS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanST91,
author = {Harry Buhrman and
Edith Spaan and
Leen Torenvliet},
editor = {Christian Choffrut and
Matthias Jantzen},
title = {Bounded Reductions},
booktitle = {{STACS} 91, 8th Annual Symposium on Theoretical Aspects of Computer
Science, Hamburg, Germany, February 14-16, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {480},
pages = {410--421},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/BFb0020816},
doi = {10.1007/BFB0020816},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanST91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tark/Spaan90,
author = {Edith Spaan},
editor = {Rohit Parikh},
title = {Nexttime is not Necessary},
booktitle = {Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning
about Knowledge, Pacific Grove, CA, USA, March 1990},
pages = {241--256},
publisher = {Morgan Kaufmann},
year = {1990},
timestamp = {Thu, 21 Jun 2018 07:50:57 +0200},
biburl = {https://dblp.org/rec/conf/tark/Spaan90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/SpaanTB89,
author = {Edith Spaan and
Leen Torenvliet and
Peter van Emde Boas},
title = {Nondeterminism fairness and a fundamental analogy},
journal = {Bull. {EATCS}},
volume = {37},
pages = {186--193},
year = {1989},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/SpaanTB89.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-02-06 23:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
