{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T12:05:53Z","timestamp":1768305953825,"version":"3.49.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031522123","type":"print"},{"value":"9783031522130","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-52213-0_2","type":"book-chapter","created":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:02:29Z","timestamp":1705140149000},"page":"14-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Aspects of\u00a0Distinct Kemeny Rank Aggregation"],"prefix":"10.1007","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,1,14]]},"reference":[{"issue":"6","key":"2_CR1","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."},{"issue":"5","key":"2_CR2","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":"2_CR3","doi-asserted-by":"publisher","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5), 23:1\u201323:27 (2008). https:\/\/doi.org\/10.1145\/1411509.1411513","DOI":"10.1145\/1411509.1411513"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Arrighi, E., Fernau, H., Lokshtanov, D., de Oliveira Oliveira, 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 (2021). https:\/\/doi.org\/10.24963\/ijcai.2021\/2","DOI":"10.24963\/ijcai.2021\/2"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Arrighi, E., Fernau, H., de Oliveira Oliveira, 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:1\u20139:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2020). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2020.9, https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.FSTTCS.2020.9","DOI":"10.4230\/LIPIcs.FSTTCS.2020.9"},{"issue":"2","key":"2_CR6","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 Welfare 6(2), 157\u2013165 (1989)","journal-title":"Soc. Choice Welfare"},{"issue":"45","key":"2_CR7","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."},{"issue":"7","key":"2_CR8","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. Discret. Math. 309(7), 1813\u20131823 (2009)","journal-title":"Discret. Math."},{"key":"2_CR9","unstructured":"Conitzer, V., Davenport, A., Kalagnanam, J.: Improved bounds for computing Kemeny rankings. In: AAAI, vol. 6, pp. 620\u2013626 (2006)"},{"key":"2_CR10","unstructured":"Cornaz, D., Galand, L., Spanjaard, O.: Kemeny elections with bounded single-peaked or single-crossing width. In: Rossi, F. (ed.) IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, 3\u20139 August 2013, pp. 76\u201382. IJCAI\/AAAI (2013). http:\/\/www.aaai.org\/ocs\/index.php\/IJCAI\/IJCAI13\/paper\/view\/6944"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"2_CR12","unstructured":"Davenport, A., Kalagnanam, J.: A computational study of the Kemeny rule for preference aggregation. In: AAAI, vol. 4, pp. 697\u2013702 (2004)"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"De, K., Mittal, H., Dey, P., Misra, N.: Parameterized aspects of distinct Kemeny rank aggregation (2023). https:\/\/doi.org\/10.48550\/ARXIV.2309.03517","DOI":"10.48550\/ARXIV.2309.03517"},{"key":"2_CR14","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, 1\u20135 May 2001, pp. 613\u2013622. ACM (2001). https:\/\/doi.org\/10.1145\/371920.372165","DOI":"10.1145\/371920.372165"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the 10th International Conference on World Wide Web, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","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.) IWPEC 2004. LNCS, vol. 3162, pp. 162\u2013173. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28639-4_15"},{"key":"2_CR17","unstructured":"Hebrard, E., Hnich, B., O\u2019Sullivan, B., Walsh, T.: Finding diverse and similar solutions in constraint programming. In: AAAI, vol. 5, pp. 372\u2013377 (2005)"},{"key":"2_CR18","unstructured":"Hebrard, E., O\u2019Sullivan, B., Walsh, T.: Distance constraints in constraint satisfaction. In: IJCAI, vol. 2007, pp. 106\u2013111 (2007)"},{"issue":"3","key":"2_CR19","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. Theoret. Comput. Sci. 349(3), 382\u2013391 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR20","unstructured":"Kemeny, J.G.: Mathematics without numbers. Daedalus 88(4), 577\u2013591 (1959). http:\/\/www.jstor.org\/stable\/20026529"},{"key":"2_CR21","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"},{"issue":"1","key":"2_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 Welfare 23(1), 91\u2013102 (2004)","journal-title":"Soc. Choice Welfare"},{"key":"2_CR23","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, 30 July\u20133 August 2000, Austin, Texas, USA, pp. 729\u2013734. AAAI Press\/The MIT Press (2000). http:\/\/www.aaai.org\/Library\/AAAI\/2000\/aaai00-112.php"},{"key":"2_CR24","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. SIAM (2009)","DOI":"10.1137\/1.9781611972894.4"},{"key":"2_CR25","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 2010, pp. 983\u2013990. Omnipress, Madison (2010)"},{"issue":"3","key":"2_CR26","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. Oper. Res. 34(3), 594\u2013620 (2009)","journal-title":"Math. Oper. Res."},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-77918-6_21","volume-title":"Approximation and Online Algorithms","author":"A van Zuylen","year":"2008","unstructured":"van Zuylen, A., Williamson, D.P.: Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 260\u2013273. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77918-6_21"},{"key":"2_CR28","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."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52213-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:22:29Z","timestamp":1768281749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52213-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031522123","9783031522130"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52213-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"14 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhilai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.iitbhilai.ac.in\/caldam2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}