Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. Brandt, F., Brill, M., Hemaspaandra, E., & Hemaspaandra, L. A. J. Artif. Intell. Res., 53:439-496, 2015.
Link
Paper bibtex @article{journals/jair/BrandtBHH15,
added-at = {2017-06-21T00:00:00.000+0200},
author = {Brandt, Felix and Brill, Markus and Hemaspaandra, Edith and Hemaspaandra, Lane A.},
biburl = {https://www.bibsonomy.org/bibtex/2a0562a798dfd6fc2a5631c3bdde88055/dblp},
ee = {https://doi.org/10.1613/jair.4647},
interhash = {1591788f96c2dc87821026db6dcd74fe},
intrahash = {a0562a798dfd6fc2a5631c3bdde88055},
journal = {J. Artif. Intell. Res.},
keywords = {dblp},
pages = {439-496},
timestamp = {2017-06-22T11:39:13.000+0200},
title = {Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.},
url = {http://dblp.uni-trier.de/db/journals/jair/jair53.html#BrandtBHH15},
volume = 53,
year = 2015
}
Downloads: 0
{"_id":"gD7J7jb47mNqFxP4y","bibbaseid":"brandt-brill-hemaspaandra-hemaspaandra-bypassingcombinatorialprotectionspolynomialtimealgorithmsforsinglepeakedelectorates-2015","authorIDs":["5d601abf56c83dda01000034"],"author_short":["Brandt, F.","Brill, M.","Hemaspaandra, E.","Hemaspaandra, L. A."],"bibdata":{"bibtype":"article","type":"article","added-at":"2017-06-21T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Brandt"],"firstnames":["Felix"],"suffixes":[]},{"propositions":[],"lastnames":["Brill"],"firstnames":["Markus"],"suffixes":[]},{"propositions":[],"lastnames":["Hemaspaandra"],"firstnames":["Edith"],"suffixes":[]},{"propositions":[],"lastnames":["Hemaspaandra"],"firstnames":["Lane","A."],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2a0562a798dfd6fc2a5631c3bdde88055/dblp","ee":"https://doi.org/10.1613/jair.4647","interhash":"1591788f96c2dc87821026db6dcd74fe","intrahash":"a0562a798dfd6fc2a5631c3bdde88055","journal":"J. Artif. Intell. Res.","keywords":"dblp","pages":"439-496","timestamp":"2017-06-22T11:39:13.000+0200","title":"Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.","url":"http://dblp.uni-trier.de/db/journals/jair/jair53.html#BrandtBHH15","volume":"53","year":"2015","bibtex":"@article{journals/jair/BrandtBHH15,\n added-at = {2017-06-21T00:00:00.000+0200},\n author = {Brandt, Felix and Brill, Markus and Hemaspaandra, Edith and Hemaspaandra, Lane A.},\n biburl = {https://www.bibsonomy.org/bibtex/2a0562a798dfd6fc2a5631c3bdde88055/dblp},\n ee = {https://doi.org/10.1613/jair.4647},\n interhash = {1591788f96c2dc87821026db6dcd74fe},\n intrahash = {a0562a798dfd6fc2a5631c3bdde88055},\n journal = {J. Artif. Intell. Res.},\n keywords = {dblp},\n pages = {439-496},\n timestamp = {2017-06-22T11:39:13.000+0200},\n title = {Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.},\n url = {http://dblp.uni-trier.de/db/journals/jair/jair53.html#BrandtBHH15},\n volume = 53,\n year = 2015\n}\n\n","author_short":["Brandt, F.","Brill, M.","Hemaspaandra, E.","Hemaspaandra, L. A."],"key":"journals/jair/BrandtBHH15","id":"journals/jair/BrandtBHH15","bibbaseid":"brandt-brill-hemaspaandra-hemaspaandra-bypassingcombinatorialprotectionspolynomialtimealgorithmsforsinglepeakedelectorates-2015","role":"author","urls":{"Link":"https://doi.org/10.1613/jair.4647","Paper":"http://dblp.uni-trier.de/db/journals/jair/jair53.html#BrandtBHH15"},"keyword":["dblp"],"downloads":0,"html":""},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Markus Brill?items=1000","creationDate":"2019-08-23T16:56:31.349Z","downloads":0,"keywords":["dblp"],"search_terms":["bypassing","combinatorial","protections","polynomial","time","algorithms","single","peaked","electorates","brandt","brill","hemaspaandra","hemaspaandra"],"title":"Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.","year":2015,"dataSources":["c74pEXworg4vtub5X"]}