{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T23:06:23Z","timestamp":1771455983619,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642112683","type":"print"},{"value":"9783642112690","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11269-0_26","type":"book-chapter","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T08:36:15Z","timestamp":1259656575000},"page":"312-323","source":"Crossref","is-referenced-by-count":5,"title":["Improved Parameterized Algorithms for the Kemeny Aggregation Problem"],"prefix":"10.1007","author":[{"given":"Narges","family":"Simjour","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"26_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N. Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. Journal of the ACM\u00a055(5), 1\u201327 (2008)","journal-title":"Journal of the ACM"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J.J. Bartholdi","year":"1989","unstructured":"Bartholdi, J.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(2), 157\u2013165 (1989)","journal-title":"Social Choice and Welfare"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-68880-8_8","volume-title":"Algorithmic Aspects in Information and Management","author":"N. Betzler","year":"2008","unstructured":"Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: Fixed-parameter algorithms for Kemeny scores. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol.\u00a05034, pp. 60\u201371. Springer, Heidelberg (2008)"},{"key":"26_CR4","unstructured":"Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: How similarity helps to efficiently compute Kemeny rankings. In: AAMAS 2009: Proc. of the 8th Int. Conf. on Autonomous Agents and Multiagent Systems, pp. 657\u2013664 (2009)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11618058_1","volume-title":"Graph Drawing","author":"T. Biedl","year":"2006","unstructured":"Biedl, T., Brandenburg, F.J., Deng, X.: Crossings and permutations. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 1\u201312. Springer, Heidelberg (2006)"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10288-007-0036-6","volume":"5","author":"I. Charon","year":"2007","unstructured":"Charon, I., Hudry, O.: A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR\u00a05(1), 5\u201360 (2007)","journal-title":"4OR"},{"key":"26_CR7","unstructured":"Davenport, A., Kalagnanam, J.: A computational study of the Kemeny rule for preference aggregation. In: AAAI 2004: Proc. of the 19th National Conf. on Artificial Intelligence, pp. 697\u2013702 (2004)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: WWW 2001: Proc. of the 10th Int. Conf. on World Wide Web, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"26_CR9","first-page":"575","volume":"88","author":"J.G. Kemeny","year":"1959","unstructured":"Kemeny, J.G.: Mathematics without numbers. Daedalus\u00a088, 575\u2013591 (1959)","journal-title":"Daedalus"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: STOC 2007: Proc. of the 39th Annual ACM Symp. on Theory of Computing, pp. 95\u2013103 (2007)","DOI":"10.1145\/1250790.1250806"},{"key":"26_CR11","unstructured":"Monjardet, B.: Tournois et ordres m$\\acute{e}$dians pour une opinion. Math$\\acute{e}$matiques et Sciences humaines, 55\u201373 (1973)"},{"issue":"3","key":"26_CR12","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.tcs.2005.10.010","volume":"351","author":"V. Raman","year":"2006","unstructured":"Raman, V., Saurabh, S.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theoretical Computer Science\u00a0351(3), 446\u2013458 (2006)","journal-title":"Theoretical Computer Science"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","first-page":"260","volume-title":"Approximation and Online Algorithms","author":"D.P. Williamson","year":"2008","unstructured":"Williamson, D.P., van Zuylen, A.: Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol.\u00a04927, pp. 260\u2013273. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11269-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T21:33:40Z","timestamp":1675719220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11269-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642112683","9783642112690"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11269-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}