Fitzsimmons, Zack; Hemaspaandra, Edith; Hemaspaandra, Lane A. Manipulation complexity of same-system runoff elections. (English) Zbl 1346.91071 Ann. Math. Artif. Intell. 77, No. 3-4, 159-189 (2016). MSC: 91B12 91B14 91B10 68Q17 PDFBibTeX XMLCite \textit{Z. Fitzsimmons} et al., Ann. Math. Artif. Intell. 77, No. 3--4, 159--189 (2016; Zbl 1346.91071) Full Text: DOI arXiv
Erdélyi, Gábor; Hemaspaandra, Edith; Hemaspaandra, Lane A. More natural models of electoral control by partition. (English) Zbl 1405.91151 Walsh, Toby (ed.), Algorithmic decision theory. 4th international conference, ADT 2015, Lexington, KY, USA, September 27–30, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-23113-6/pbk; 978-3-319-23114-3/ebook). Lecture Notes in Computer Science 9346. Lecture Notes in Artificial Intelligence, 396-413 (2015). MSC: 91B12 68Q17 PDFBibTeX XMLCite \textit{G. Erdélyi} et al., Lect. Notes Comput. Sci. 9346, 396--413 (2015; Zbl 1405.91151) Full Text: DOI arXiv
Fitzsimmons, Zack; Hemaspaandra, Edith Complexity of manipulative actions when voting with ties. (English) Zbl 1405.91153 Walsh, Toby (ed.), Algorithmic decision theory. 4th international conference, ADT 2015, Lexington, KY, USA, September 27–30, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-23113-6/pbk; 978-3-319-23114-3/ebook). Lecture Notes in Computer Science 9346. Lecture Notes in Artificial Intelligence, 103-119 (2015). MSC: 91B12 68Q17 PDFBibTeX XMLCite \textit{Z. Fitzsimmons} and \textit{E. Hemaspaandra}, Lect. Notes Comput. Sci. 9346, 103--119 (2015; Zbl 1405.91153) Full Text: DOI arXiv
Faliszewski, Piotr; Hemaspaandra, Edith; Hemaspaandra, Lane A. Weighted electoral control. (English) Zbl 1328.91068 J. Artif. Intell. Res. (JAIR) 52, 507-542 (2015). MSC: 91B12 68Q17 68Q25 68W25 91F10 PDFBibTeX XMLCite \textit{P. Faliszewski} et al., J. Artif. Intell. Res. (JAIR) 52, 507--542 (2015; Zbl 1328.91068) Full Text: DOI arXiv
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Rothe, Jörg The complexity of online manipulation of sequential elections. (English) Zbl 1285.68223 J. Comput. Syst. Sci. 80, No. 4, 697-710 (2014). MSC: 68W27 91B14 68Q17 91B12 PDFBibTeX XMLCite \textit{E. Hemaspaandra} et al., J. Comput. Syst. Sci. 80, No. 4, 697--710 (2014; Zbl 1285.68223) Full Text: DOI arXiv
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Rothe, Jörg Online voter control in sequential elections. (English) Zbl 1327.68119 De Raedt, Luc (ed.) et al., ECAI 2012. 20th European conference on artificial intelligence, Montpellier, France, August 27–31, 2012. Proceedings. Including proceedings of the 7th conference on prestigious applications of artificial intelligence (PAIS-2012) and the system demonstrations track. Amsterdam: IOS Press (ISBN 978-1-61499-097-0/pbk; 978-1-61499-098-7/ebook). Frontiers in Artificial Intelligence and Applications 242, 396-401 (2012). MSC: 68Q17 91B14 PDFBibTeX XMLCite \textit{E. Hemaspaandra} et al., Front. Artif. Intell. Appl. 242, 396--401 (2012; Zbl 1327.68119) Full Text: arXiv Link
Faliszewski, Piotr; Hemaspaandra, Edith; Schnoor, Henning Weighted manipulation for four-candidate Llull is easy. (English) Zbl 1327.91033 De Raedt, Luc (ed.) et al., ECAI 2012. 20th European conference on artificial intelligence, Montpellier, France, August 27–31, 2012. Proceedings. Including proceedings of the 7th conference on prestigious applications of artificial intelligence (PAIS-2012) and the system demonstrations track. Amsterdam: IOS Press (ISBN 978-1-61499-097-0/pbk; 978-1-61499-098-7/ebook). Frontiers in Artificial Intelligence and Applications 242, 318-323 (2012). MSC: 91B14 68W05 68Q17 PDFBibTeX XMLCite \textit{P. Faliszewski} et al., Front. Artif. Intell. Appl. 242, 318--323 (2012; Zbl 1327.91033) Full Text: Link
Baumeister, Dorothea; Erdélyi, Gábor; Hemaspaandra, Edith; Hemaspaandra, Lane A.; Rothe, Jörg Computational aspects of approval voting. (English) Zbl 1348.91101 Laslier, Jean-François (ed.) et al., Handbook on approval voting. Berlin: Springer (ISBN 978-3-642-02838-0/hbk; 978-3-642-26413-9/pbk; 978-3-642-02839-7/ebook). Studies in Choice and Welfare, 199-251 (2010). MSC: 91B14 91B12 68Q17 91-08 PDFBibTeX XMLCite \textit{D. Baumeister} et al., in: Handbook on approval voting. Berlin: Springer. 199--251 (2010; Zbl 1348.91101) Full Text: DOI Link
Hemaspaandra, Edith; Schnoor, Henning; Schnoor, Ilka Generalized modal satisfiability. (English) Zbl 1197.68048 J. Comput. Syst. Sci. 76, No. 7, 561-578 (2010). MSC: 68Q25 03B45 68Q17 PDFBibTeX XMLCite \textit{E. Hemaspaandra} et al., J. Comput. Syst. Sci. 76, No. 7, 561--578 (2010; Zbl 1197.68048) Full Text: DOI
Faliszewski, P.; Hemaspaandra, E.; Hemaspaandra, L. A. How hard is bribery in elections? (English) Zbl 1180.91090 J. Artif. Intell. Res. (JAIR) 35, 485-532 (2009). Reviewer: Simona Settepanella (Pisa) MSC: 91B12 68Q17 PDFBibTeX XMLCite \textit{P. Faliszewski} et al., J. Artif. Intell. Res. (JAIR) 35, 485--532 (2009; Zbl 1180.91090) Full Text: DOI
Faliszewski, P.; Hemaspaandra, E.; Hemaspaandra, L. A.; Rothe, J. Llull and Copeland voting computationally resist bribery and constructive control. (English) Zbl 1180.91091 J. Artif. Intell. Res. (JAIR) 35, 275-341 (2009). Reviewer: Simona Settepanella (Pisa) MSC: 91B12 68Q17 PDFBibTeX XMLCite \textit{P. Faliszewski} et al., J. Artif. Intell. Res. (JAIR) 35, 275--341 (2009; Zbl 1180.91091) Full Text: DOI
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Rothe, Jörg Hybrid elections broaden complexity-theoretic resistance to control. (English) Zbl 1177.91066 Math. Log. Q. 55, No. 4, 397-424 (2009). Reviewer: Giacomo Bonanno (Davis) MSC: 91B12 91B14 91B08 68Q17 PDFBibTeX XMLCite \textit{E. Hemaspaandra} et al., Math. Log. Q. 55, No. 4, 397--424 (2009; Zbl 1177.91066) Full Text: DOI arXiv
Bauland, Michael; Hemaspaandra, Edith Isomorphic implication. (English) Zbl 1173.68024 Theory Comput. Syst. 44, No. 1, 117-139 (2009). MSC: 68Q25 03B05 68Q17 PDFBibTeX XMLCite \textit{M. Bauland} and \textit{E. Hemaspaandra}, Theory Comput. Syst. 44, No. 1, 117--139 (2009; Zbl 1173.68024) Full Text: DOI arXiv
Faliszewski, Piotr; Hemaspaandra, Edith; Hemaspaandra, Lane A.; Rothe, Jörg Copeland voting fully resists constructive control. (English) Zbl 1143.91320 Fleischer, Rudolf (ed.) et al., Algorithmic aspects in information and management. 4th international conference, AAIM 2008, Shanghai, China, June 23–25, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68865-5/pbk). Lecture Notes in Computer Science 5034, 165-176 (2008). MSC: 91B12 91B14 91-08 68Q17 PDFBibTeX XMLCite \textit{P. Faliszewski} et al., Lect. Notes Comput. Sci. 5034, 165--176 (2008; Zbl 1143.91320) Full Text: DOI Link
Hemaspaandra, Edith; Rothe, Jörg; Spakowski, Holger Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. (English) Zbl 1085.68056 Theor. Inform. Appl. 40, No. 1, 75-91 (2006). MSC: 68Q15 68Q17 68T20 PDFBibTeX XMLCite \textit{E. Hemaspaandra} et al., Theor. Inform. Appl. 40, No. 1, 75--91 (2006; Zbl 1085.68056) Full Text: DOI arXiv Numdam EuDML
Bauland, Michael; Hemaspaandra, Edith Isomorphic implication. (English) Zbl 1156.68397 Jędrzejowicz, Joanna (ed.) et al., Mathematical foundations of computer science 2005. 30th international symposium, MFCS 2005, Gdansk, Poland, August 29–September 2, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28702-7/pbk). Lecture Notes in Computer Science 3618, 119-130 (2005). MSC: 68Q25 68Q15 68Q17 PDFBibTeX XMLCite \textit{M. Bauland} and \textit{E. Hemaspaandra}, Lect. Notes Comput. Sci. 3618, 119--130 (2005; Zbl 1156.68397) Full Text: DOI
Hemaspaandra, Edith; Spakowski, Holger; Vogel, Jörg The complexity of Kemeny elections. (English) Zbl 1086.68046 Theor. Comput. Sci. 349, No. 3, 382-391 (2005). MSC: 68Q17 91B12 PDFBibTeX XMLCite \textit{E. Hemaspaandra} et al., Theor. Comput. Sci. 349, No. 3, 382--391 (2005; Zbl 1086.68046) Full Text: DOI
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald All superlinear inverse schemes are coNP-hard. (English) Zbl 1079.68041 Theor. Comput. Sci. 345, No. 2-3, 345-358 (2005). MSC: 68Q17 PDFBibTeX XMLCite \textit{E. Hemaspaandra} et al., Theor. Comput. Sci. 345, No. 2--3, 345--358 (2005; Zbl 1079.68041) Full Text: DOI arXiv
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald All superlinear inverse schemes are coNP-hard. (English) Zbl 1096.68064 Fiala, Jiří(ed.) et al., Mathematical foundations of computer Science 2004. 29th international symposium, MFCS 2004, Prague, Czech Republic, August 22–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22823-3/pbk). Lecture Notes in Computer Science 3153, 368-379 (2004). MSC: 68Q17 68Q15 PDFBibTeX XMLCite \textit{E. Hemaspaandra} et al., Lect. Notes Comput. Sci. 3153, 368--379 (2004; Zbl 1096.68064) Full Text: DOI
Hemaspaandra, Edith; Rothe, Jörg; Spakowski, Holger Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. (English) Zbl 1022.68099 Kučera, Luděk (ed.), Graph-theoretic concepts in computer science. 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2573, 258-269 (2002). MSC: 68R10 68Q17 90C59 05C70 PDFBibTeX XMLCite \textit{E. Hemaspaandra} et al., Lect. Notes Comput. Sci. 2573, 258--269 (2002; Zbl 1022.68099) Full Text: Link
Böhler, Elmar; Hemaspaandra, Edith; Reith, Steffen; Vollmer, Heribert Equivalence and isomorphism for Boolean constraint satisfaction. (English) Zbl 1020.68039 Bradfield, Julian (ed.), Computer science logic. 16th international workshop, CSL 2002, 11th annual conference of the EACSL, Edinburgh, Scotland, GB, September 22-25, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2471, 412-426 (2002). MSC: 68Q17 68Q25 90C27 PDFBibTeX XMLCite \textit{E. Böhler} et al., Lect. Notes Comput. Sci. 2471, 412--426 (2002; Zbl 1020.68039) Full Text: Link
Hemaspaandra, Edith; Wechsung, Gerd The minimization problem for Boolean formulas. (English) Zbl 1008.68054 SIAM J. Comput. 31, No. 6, 1948-1958 (2002). MSC: 68Q17 03D15 PDFBibTeX XMLCite \textit{E. Hemaspaandra} and \textit{G. Wechsung}, SIAM J. Comput. 31, No. 6, 1948--1958 (2002; Zbl 1008.68054) Full Text: DOI
Hemaspaandra, Edith The complexity of poor man’s logic. (English) Zbl 1006.03017 J. Log. Comput. 11, No. 4, 609-622 (2001). MSC: 03B45 68Q17 PDFBibTeX XMLCite \textit{E. Hemaspaandra}, J. Log. Comput. 11, No. 4, 609--622 (2001; Zbl 1006.03017) Full Text: DOI arXiv
Hemaspaandra, Edith; Hemaspaandra, Lane A. Computational politics: Electoral systems. (English) Zbl 0996.68065 Nielsen, Mogens (ed.) et al., Mathematical foundations of computer science 2000. 25th international symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1893, 64-83 (2000). MSC: 68Q17 91B12 PDFBibTeX XMLCite \textit{E. Hemaspaandra} and \textit{L. A. Hemaspaandra}, Lect. Notes Comput. Sci. 1893, 64--83 (2000; Zbl 0996.68065)
Hemaspaandra, Edith Modal satisfiability is in deterministic linear space. (English) Zbl 0973.03056 Clote, Peter G. (ed.) et al., Computer science logic. 14th international workshop, CSL 2000. Annual conference of the EACSL, Fischbachau, Germany, August 21-26, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1862, 332-342 (2000). MSC: 03D15 03B45 68Q17 PDFBibTeX XMLCite \textit{E. Hemaspaandra}, Lect. Notes Comput. Sci. 1862, 332--342 (2000; Zbl 0973.03056)
Hemaspaandra, Edith The complexity of poor man’s logic. (English) Zbl 0953.03052 Reichel, Horst (ed.) et al., STACS 2000. 17th annual symposium on Theoretical aspects of computer science. Lille, France, February 17-19, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1770, 230-241 (2000). MSC: 03D15 03B45 68Q17 PDFBibTeX XMLCite \textit{E. Hemaspaandra}, Lect. Notes Comput. Sci. 1770, 230--241 (2000; Zbl 0953.03052)
Hemaspaandra, Edith; Rothe, Jörg Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP. (English) Zbl 1338.68087 Inf. Process. Lett. 65, No. 3, 151-156 (1998). MSC: 68Q17 05C69 PDFBibTeX XMLCite \textit{E. Hemaspaandra} and \textit{J. Rothe}, Inf. Process. Lett. 65, No. 3, 151--156 (1998; Zbl 1338.68087) Full Text: DOI Link
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Rothe, Jörg Exact analysis of Dodgson elections: Lewis Carroll’s 1876 voting system is complete for parallel access to NP. (English) Zbl 1401.68097 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 214-224 (1997). MSC: 68Q17 91B12 PDFBibTeX XMLCite \textit{E. Hemaspaandra} et al., Lect. Notes Comput. Sci. 1256, 214--224 (1997; Zbl 1401.68097) Full Text: DOI