{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:55:09Z","timestamp":1725555309500},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130724"},{"type":"electronic","value":"9783642130731"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13073-1_27","type":"book-chapter","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T04:09:58Z","timestamp":1273464598000},"page":"299-310","source":"Crossref","is-referenced-by-count":3,"title":["The Complexity of Computing Minimal Unidirectional Covering Sets"],"prefix":"10.1007","author":[{"given":"Dorothea","family":"Baumeister","sequence":"first","affiliation":[]},{"given":"Felix","family":"Brandt","sequence":"additional","affiliation":[]},{"given":"Felix","family":"Fischer","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Hoffmann","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"27_CR1","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.mathsocsci.2008.04.001","volume":"56","author":"F. Brandt","year":"2008","unstructured":"Brandt, F., Fischer, F.: Computing the minimal covering set. Mathematical Social Sciences\u00a056(2), 254\u2013268 (2008)","journal-title":"Mathematical Social Sciences"},{"key":"27_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60805-6","volume-title":"Tournament Solutions and Majority Voting","author":"J. Laslier","year":"1997","unstructured":"Laslier, J.: Tournament Solutions and Majority Voting. Springer, Heidelberg (1997)"},{"issue":"4","key":"27_CR3","doi-asserted-by":"publisher","first-page":"608","DOI":"10.2307\/1907926","volume":"21","author":"D. McGarvey","year":"1953","unstructured":"McGarvey, D.: A theorem on the construction of voting paradoxes. Econometrica\u00a021(4), 608\u2013610 (1953)","journal-title":"Econometrica"},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1137\/0133030","volume":"33","author":"P. Fishburn","year":"1977","unstructured":"Fishburn, P.: Condorcet social choice functions. SIAM Journal on Applied Mathematics\u00a033(3), 469\u2013489 (1977)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"68","DOI":"10.2307\/2110925","volume":"24","author":"N. Miller","year":"1980","unstructured":"Miller, N.: A new solution set for tournaments and majority voting: Further graph-theoretical approaches to the theory of voting. American Journal of Political Science\u00a024(1), 68\u201396 (1980)","journal-title":"American Journal of Political Science"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(88)90096-8","volume":"44","author":"B. Dutta","year":"1988","unstructured":"Dutta, B.: Covering sets and a new Condorcet choice correspondence. Journal of Economic Theory\u00a044, 63\u201380 (1988)","journal-title":"Journal of Economic Theory"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-69507-3_4","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"Y. Chevaleyre","year":"2007","unstructured":"Chevaleyre, Y., Endriss, U., Lang, J., Maudet, N.: A short introduction to computational social choice. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol.\u00a04362, pp. 51\u201369. Springer, Heidelberg (2007)"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s003550200197","volume":"20","author":"G. Woeginger","year":"2003","unstructured":"Woeginger, G.: Banks winners in tournaments are difficult to recognize. Social Choice and Welfare\u00a020, 523\u2013528 (2003)","journal-title":"Social Choice and Welfare"},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N. Alon","year":"2006","unstructured":"Alon, N.: Ranking tournaments. SIAM Journal on Discrete Mathematics\u00a020(1), 137\u2013142 (2006)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"27_CR10","first-page":"613","volume-title":"Proceedings of the 21st National Conference on Artificial Intelligence","author":"V. Conitzer","year":"2006","unstructured":"Conitzer, V.: Computing Slater rankings using similarities among candidates. In: Proceedings of the 21st National Conference on Artificial Intelligence, pp. 613\u2013619. AAAI Press, Menlo Park (2006)"},{"issue":"4","key":"27_CR11","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1002\/malq.200810027","volume":"55","author":"F. Brandt","year":"2009","unstructured":"Brandt, F., Fischer, F., Harrenstein, P.: The computational complexity of choice sets. Mathematical Logic Quarterly\u00a055(4), 444\u2013459 (2009)","journal-title":"Mathematical Logic Quarterly"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Brandt, F., Fischer, F., Harrenstein, P., Mair, M.: A computational analysis of the tournament equilibrium set. Social Choice and Welfare (Forthcoming)","DOI":"10.1007\/s00355-009-0419-z"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(87)90049-1","volume":"51","author":"K. Wagner","year":"1987","unstructured":"Wagner, K.: More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science\u00a051, 53\u201380 (1987)","journal-title":"Theoretical Computer Science"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/0022-0531(83)90024-8","volume":"31","author":"G. Bordes","year":"1983","unstructured":"Bordes, G.: On the possibility of reasonable consistent majoritarian choice: Some positive results. Journal of Economic Theory\u00a031, 122\u2013132 (1983)","journal-title":"Journal of Economic Theory"},{"key":"27_CR15","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"27_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BFb0009651","volume-title":"Theoretical Computer Science","author":"C. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C., Zachos, S.: Two remarks on the power of counting. In: Cremers, A.B., Kriegel, H.-P. (eds.) GI-TCS 1983. LNCS, vol.\u00a0145, pp. 269\u2013276. Springer, Heidelberg (1982)"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-1-4020-9688-4_14","volume-title":"Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz","author":"P. Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: A richer understanding of the complexity of election systems. In: Ravi, S., Shukla, S. (eds.) Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz, pp. 375\u2013406. Springer, Heidelberg (2009)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Brandt, F., Fischer, F., Hoffmann, J., Rothe, J.: The complexity of computing minimal unidirectional covering sets. Technical Report arXiv:0901.3692v3\u00a0[cs.CC], ACM Computing Research Repository, CoRR (2009)","DOI":"10.1007\/978-3-642-13073-1_27"},{"issue":"2","key":"27_CR20","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/261342.261344","volume":"28","author":"E. Hemaspaandra","year":"1997","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Raising NP lower bounds to parallel NP lower bounds. SIGACT News\u00a028(2), 2\u201313 (1997)","journal-title":"SIGACT News"},{"issue":"6","key":"27_CR21","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1145\/268999.269002","volume":"44","author":"E. Hemaspaandra","year":"1997","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Exact analysis of Dodgson elections: Lewis Carroll\u2019s 1876 voting system is complete for parallel access to NP. Journal of the ACM\u00a044(6), 806\u2013825 (1997)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13073-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T09:19:29Z","timestamp":1635326369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13073-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130724","9783642130731"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13073-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}