{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T23:06:54Z","timestamp":1771456014430,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540688655","type":"print"},{"value":"9783540688808","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_8","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:37:59Z","timestamp":1217486279000},"page":"60-71","source":"Crossref","is-referenced-by-count":11,"title":["Fixed-Parameter Algorithms for Kemeny Scores"],"prefix":"10.1007","author":[{"given":"Nadja","family":"Betzler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frances A.","family":"Rosamond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","first-page":"684","volume-title":"Proc. 37th STOC","author":"N. Ailon","year":"2005","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. In: Proc. 37th STOC, pp. 684\u2013693. ACM, New York (2005)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J. Bartholdi III","year":"1989","unstructured":"Bartholdi III, J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare\u00a06, 157\u2013165 (1989)","journal-title":"Social Choice and Welfare"},{"key":"8_CR3","unstructured":"Chen, J.: Personal communication (December 2007)"},{"key":"8_CR4","volume-title":"Proc. 40th STOC","author":"J. Chen","year":"2008","unstructured":"Chen, J., Liu, Y., Lu, S., O\u2019Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. In: Proc. 40th STOC, ACM, New York (2008)"},{"key":"8_CR5","unstructured":"Conitzer, V., Davenport, A., Kalagnanam, J.: Improved bounds for computing Kemeny rankings. In: Proc. 21st AAAI, pp. 620\u2013626 (2006)"},{"key":"8_CR6","unstructured":"Davenport, A., Kalagnanam, J.: A computational study of the Kemeny rule for preference aggregation. In: Proc. 19th AAAI, pp. 697\u2013702 (2004)"},{"key":"8_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the Web. In: Proc. WWW, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"8_CR9","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation revisited (manuscript, 2001)"},{"key":"8_CR10","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/j.tcs.2005.08.031","volume":"349","author":"E. Hemaspaandra","year":"2005","unstructured":"Hemaspaandra, E., Spakowski, H., Vogel, J.: The complexity of Kemeny elections. Theoretical Computer Science\u00a0349, 382\u2013391 (2005)","journal-title":"Theoretical Computer Science"},{"key":"8_CR12","first-page":"95","volume-title":"Proc. 39th STOC","author":"C. Kenyon-Mathieu","year":"2007","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: Proc. 39th STOC, pp. 95\u2013103. ACM, New York (2007)"},{"key":"8_CR13","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ipl.2007.05.014","volume":"104","author":"V. Raman","year":"2007","unstructured":"Raman, V., Saurabh, S.: Improved fixed parameter tractable algorithms for two \u201cedge\u201d problems: MAXCUT and MAXDAG. Information Processing Letters\u00a0104(2), 65\u201372 (2007)","journal-title":"Information Processing Letters"},{"key":"8_CR15","unstructured":"Truchon, M.: An extension of the Condorcet criterion and Kemeny orders. Technical report, cahier 98-15 du Centre de Recherche en \u00c9conomie et Finance Appliqu\u00e9es (1998)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","first-page":"260","volume-title":"Proc. 5th WAOA","author":"A. Zuylen van","year":"2007","unstructured":"van Zuylen, A., Williamson, D.P.: Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Proc. 5th WAOA. LNCS, vol.\u00a04927, pp. 260\u2013273. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:17:11Z","timestamp":1620015431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}