{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T01:46:21Z","timestamp":1774057581877,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T00:00:00Z","timestamp":1723680000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T00:00:00Z","timestamp":1723680000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001843","name":"SCIENCE & ENGINEERING RESEARCH BOARD","doi-asserted-by":"crossref","award":["CRG\/2022\/003294"],"award-info":[{"award-number":["CRG\/2022\/003294"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00236-024-00463-x","type":"journal-article","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T17:02:05Z","timestamp":1723741325000},"page":"401-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized aspects of distinct Kemeny rank aggregation"],"prefix":"10.1007","volume":"61","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4434-0627","authenticated-orcid":false,"given":"Koustav","family":"De","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harshil","family":"Mittal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0071-9464","authenticated-orcid":false,"given":"Palash","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1727-5388","authenticated-orcid":false,"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,15]]},"reference":[{"key":"463_CR1","doi-asserted-by":"publisher","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Shen, V.Y., Saito, N., Lyu, M.R., Zurko, M.E. (eds.) Proceedings of the Tenth International World Wide Web Conference, WWW 10, Hong Kong, China, May 1\u20135, 2001, pp. 613\u2013622. ACM, New York, NY, United States (2001). https:\/\/doi.org\/10.1145\/371920.372165","DOI":"10.1145\/371920.372165"},{"key":"463_CR2","unstructured":"Pennock, D.M., Horvitz, E., Giles, C.L.: Social choice theory and recommender systems: Analysis of the axiomatic foundations of collaborative filtering. In: Kautz, H.A., Porter, B.W. (eds.) Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30\u2013August 3, 2000, Austin, Texas, USA, pp. 729\u2013734. AAAI Press \/ The MIT Press, Austin, Texas, USA (2000). http:\/\/www.aaai.org\/Library\/AAAI\/2000\/aaai00-112.php"},{"issue":"4","key":"463_CR3","first-page":"577","volume":"88","author":"JG Kemeny","year":"1959","unstructured":"Kemeny, J.G.: Mathematics without numbers. Daedalus 88(4), 577\u2013591 (1959)","journal-title":"Daedalus"},{"key":"463_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham, Switzerland (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"45","key":"463_CR5","doi-asserted-by":"publisher","first-page":"4554","DOI":"10.1016\/j.tcs.2009.08.033","volume":"410","author":"N Betzler","year":"2009","unstructured":"Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: Fixed-parameter algorithms for kemeny rankings. Theor. Comput. Sci. 410(45), 4554\u20134570 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.08.033","journal-title":"Theor. Comput. Sci."},{"key":"463_CR6","doi-asserted-by":"publisher","unstructured":"Arrighi, E., Fernau, H., Lokshtanov, D., Oliveira\u00a0Oliveira, M., Wolf, P.: Diversity in kemeny rank aggregation: A parameterized approach. In: Zhou, Z. (ed.) Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event \/ Montreal, Canada, 19\u201327 August 2021, pp. 10\u201316. ijcai.org, Montreal, Canada (2021). https:\/\/doi.org\/10.24963\/ijcai.2021\/2 . Main Track","DOI":"10.24963\/ijcai.2021\/2"},{"key":"463_CR7","doi-asserted-by":"publisher","unstructured":"Arrighi, E., Fernau, H., Oliveira\u00a0Oliveira, M., Wolf, P.: Width Notions for Ordering-Related Problems. In: Saxena, N., Simon, S. (eds.) 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 182, pp. 9\u20131918. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2020.9","DOI":"10.4230\/LIPIcs.FSTTCS.2020.9"},{"key":"463_CR8","unstructured":"Slivkins, A., Radlinski, F., Gollapudi, S.: Learning optimally diverse rankings over large document collections. In: Proceedings of the 27th International Conference on International Conference on Machine Learning. ICML\u201910, pp. 983\u2013990. Omnipress, Madison, WI, USA (2010)"},{"issue":"6","key":"463_CR9","doi-asserted-by":"publisher","first-page":"1926","DOI":"10.1137\/S0363012992237273","volume":"33","author":"R Agrawal","year":"1995","unstructured":"Agrawal, R.: The continuum-armed bandit problem. SIAM J. Control Optim. 33(6), 1926\u20131951 (1995). https:\/\/doi.org\/10.1137\/S0363012992237273","journal-title":"SIAM J. Control Optim."},{"key":"463_CR10","unstructured":"Cornaz, D., Galand, L., Spanjaard, O.: Kemeny elections with bounded single-peaked or single-crossing width. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. IJCAI \u201913, pp. 76\u201382. AAAI Press, Beijing, China (2013)"},{"issue":"2","key":"463_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J Bartholdi","year":"1989","unstructured":"Bartholdi, J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Soc. Choice Welf. 6(2), 157\u2013165 (1989)","journal-title":"Soc. Choice Welf."},{"issue":"7","key":"463_CR12","doi-asserted-by":"publisher","first-page":"1813","DOI":"10.1016\/j.disc.2007.12.088","volume":"309","author":"T Biedl","year":"2009","unstructured":"Biedl, T., Brandenburg, F.J., Deng, X.: On the complexity of crossings in permutations. Discrete Math. 309(7), 1813\u20131823 (2009)","journal-title":"Discrete Math."},{"issue":"3","key":"463_CR13","doi-asserted-by":"publisher","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. Theor. Comput. Sci. 349(3), 382\u2013391 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"463_CR14","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1287\/moor.1090.0385","volume":"34","author":"A Van Zuylen","year":"2009","unstructured":"Van Zuylen, A., Williamson, D.P.: Deterministic pivoting algorithms for constrained ranking and clustering problems. Math. Op. Res. 34(3), 594\u2013620 (2009)","journal-title":"Math. Op. Res."},{"issue":"5","key":"463_CR15","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. J. ACM (JACM) 55(5), 1\u201327 (2008)","journal-title":"J. ACM (JACM)"},{"key":"463_CR16","doi-asserted-by":"crossref","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: Proceedings of the Thirty-ninth Annual ACM Symposium on Theory of Computing, pp. 95\u2013103 (2007)","DOI":"10.1145\/1250790.1250806"},{"key":"463_CR17","doi-asserted-by":"crossref","unstructured":"Schalekamp, F., Zuylen, A.v.: Rank aggregation: Together we\u2019re strong. In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 38\u201351 (2009). SIAM","DOI":"10.1137\/1.9781611972894.4"},{"key":"463_CR18","first-page":"697","volume":"4","author":"A Davenport","year":"2004","unstructured":"Davenport, A., Kalagnanam, J.: A computational study of the Kemeny rule for preference aggregation. AAAI 4, 697\u2013702 (2004)","journal-title":"AAAI"},{"key":"463_CR19","first-page":"620","volume":"6","author":"V Conitzer","year":"2006","unstructured":"Conitzer, V., Davenport, A., Kalagnanam, J.: Improved bounds for computing Kemeny rankings. AAAI 6, 620\u2013626 (2006)","journal-title":"AAAI"},{"key":"463_CR20","doi-asserted-by":"publisher","unstructured":"Zuylen, A., Williamson, D.P.: Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Kaklamanis, C., Skutella, M. (eds.) Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11\u201312, 2007. Revised Papers. Lecture Notes in Computer Science,4927, pp. 260\u2013273. Springer, Berlin, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77918-6_21","DOI":"10.1007\/978-3-540-77918-6_21"},{"key":"463_CR21","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-28639-4_15","volume-title":"Parameterized and Exact Computation","author":"J Guo","year":"2004","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: Distance from triviality. In: Downey, R., Fellows, M., Dehne, F. (eds.) Parameterized and Exact Computation, pp. 162\u2013173. Springer, Berlin, Heidelberg (2004)"},{"issue":"1","key":"463_CR22","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00355-003-0238-6","volume":"23","author":"C Klamler","year":"2004","unstructured":"Klamler, C.: The Dodgson ranking and its relation to Kemeny\u2019s method and Slater\u2019s rule. Soc. Choice Welf. 23(1), 91\u2013102 (2004)","journal-title":"Soc. Choice Welf."},{"key":"463_CR23","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1613\/jair.5657","volume":"61","author":"WS Zwicker","year":"2018","unstructured":"Zwicker, W.S.: Cycles and intractability in a large class of aggregation rules. J. Artif. Intell. Res. 61, 407\u2013431 (2018)","journal-title":"J. Artif. Intell. Res."},{"key":"463_CR24","first-page":"372","volume":"5","author":"E Hebrard","year":"2005","unstructured":"Hebrard, E., Hnich, B., O\u2019Sullivan, B., Walsh, T.: Finding diverse and similar solutions in constraint programming. AAAI 5, 372\u2013377 (2005)","journal-title":"AAAI"},{"key":"463_CR25","first-page":"106","volume":"2007","author":"E Hebrard","year":"2007","unstructured":"Hebrard, E., O\u2019Sullivan, B., Walsh, T.: Distance constraints in constraint satisfaction. IJCAI 2007, 106\u2013111 (2007)","journal-title":"IJCAI"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00463-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-024-00463-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00463-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T11:02:59Z","timestamp":1730718179000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-024-00463-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,15]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["463"],"URL":"https:\/\/doi.org\/10.1007\/s00236-024-00463-x","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,15]]},"assertion":[{"value":"8 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}