{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T06:18:36Z","timestamp":1772000316309,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,10,4]],"date-time":"2013-10-04T00:00:00Z","timestamp":1380844800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s10458-013-9236-y","type":"journal-article","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T11:16:36Z","timestamp":1380798996000},"page":"721-748","source":"Crossref","is-referenced-by-count":32,"title":["Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation"],"prefix":"10.1007","volume":"28","author":[{"given":"Nadja","family":"Betzler","sequence":"first","affiliation":[]},{"given":"Robert","family":"Bredereck","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,4]]},"reference":[{"issue":"5","key":"9236_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., & Newman, A. (2008). Aggregating inconsistent information: ranking and clustering. Journal of the ACM, 55(5), 1\u201327.","journal-title":"Journal of the ACM"},{"issue":"1","key":"9236_CR2","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.mathsocsci.2011.08.008","volume":"64","author":"A Ali","year":"2012","unstructured":"Ali, A., & Meil\u0103, M. (2012). Experiments with Kemeny ranking: What works when? Mathematical Social Sciences, 64(1), 28\u201340.","journal-title":"Mathematical Social Sciences"},{"key":"9236_CR3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J Bartholdi III","year":"1989","unstructured":"Bartholdi, J, I. I. I., Tovey, C. A., & Trick, M. A. (1989). Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare, 6, 157\u2013165.","journal-title":"Social Choice and Welfare"},{"key":"9236_CR4","unstructured":"Betzler, N. (2010). A multivariate complexity analysis of voting problems. PhD thesis, Friedrich-Schiller-Universit\u00e4t Jena."},{"key":"9236_CR5","unstructured":"Betzler, N., Bredereck, R., Chen, J., & Niedermeier, R. (2012). Studies in computational aspects of voting\u2014a parameterized complexity perspective. In The multivariate algorithmic revolution and beyond. LNCS (Vol. 7370, pp. 318\u2013363). New York: Springer."},{"issue":"45","key":"9236_CR6","doi-asserted-by":"crossref","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. (2009). Fixed-parameter algorithms for Kemeny rankings. Theoretical Computer Science, 410(45), 4554\u20134570.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"9236_CR7","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.jcss.2010.07.005","volume":"77","author":"N Betzler","year":"2011","unstructured":"Betzler, N., Guo, J., Komusiewicz, C., & Niedermeier, R. (2011). Average parameterization and partial kernelization for computing medians. Journal of Computer and System Sciences, 77(4), 774\u2013789.","journal-title":"Journal of Computer and System Sciences"},{"issue":"7","key":"9236_CR8","doi-asserted-by":"crossref","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. (2009). On the complexity of crossings in permutations. Discrete Mathematics, 309(7), 1813\u20131823.","journal-title":"Discrete Mathematics"},{"key":"9236_CR9","unstructured":"Brandenburg, F., Glei\u00dfner, A., & Hofmeier, A. (2012). Comparing and aggregating partial orders with Kendall tau distances. In Proceedings of the 6th international workshop on algorithms and computation (WALCOM \u201912). LNCS (Vol. 7157, pp. 88\u201399). New York: Springer."},{"key":"9236_CR10","unstructured":"Brandt, F., Brill, M., & Seedig, H. G. (2011). On the fixed-parameter tractability of composition-consistent tournament solutions. In Proceedings of the 22nd international joint conference on artificial intelligence (IJCAI \u201911) (pp. 85\u201390). Menlo Park, CA: AAAI Press."},{"key":"9236_CR11","unstructured":"Bredereck, R., (2010). Fixed-parameter algorithms for computing Kemeny scores\u2014Theory and practice. Studienarbeit, Universit\u00e4t Jena, CoRR abs\/1001.4003."},{"issue":"1","key":"9236_CR12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1613\/jair.587","volume":"10","author":"WW Cohen","year":"1999","unstructured":"Cohen, W. W., Schapire, R. E., & Singer, Y. (1999). Learning to order things. Journal of Artificial Intelligence Research, 10(1), 243\u2013270.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9236_CR13","unstructured":"Conitzer, V., Davenport, A., & Kalagnanam, J. (2006). Improved bounds for computing Kemeny rankings. In Proceedings of the 21st national conference on artificial intelligence (AAAI\u201906) (pp. 620\u2013626). Menlo Park, CA: AAAI Press."},{"key":"9236_CR14","unstructured":"Davenport, A., & Kalagnanam, J. (2004). A computational study of the Kemeny rule for preference aggregation. In Proceedings of the 19th national conference on artificial intelligence (AAAI\u201904) (pp. 697\u2013702). Menlo Park, CA: AAAI Press."},{"key":"9236_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R. G., & Fellows, M. R. (1999). Parameterized complexity. New York: Springer."},{"key":"9236_CR16","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001). Rank aggregation methods for the Web. In Proceedings of the 10th international World Wide Web conference (WWW\u201901) (pp. 613\u2013622).","DOI":"10.1145\/371920.372165"},{"key":"9236_CR17","unstructured":"Fagin, R., Kumar, R., & Sivakumar, D. (2003). Efficient similarity search and classification via rank aggregation. In Proceedings of the 22nd ACM SIGMOD international conference on management of data (SIGMOD\u201903) (pp. 301\u2013312). New York: ACM."},{"key":"9236_CR18","unstructured":"Fernau, H., Fomin, F. V., Lokshtanov, D., Mnich, M., Philip, G., & Saurabh, S. (2011). Ranking and drawing in subexponential time. In Proceedings of the 21st international conference on combinatorial algorithms. LNCS (Vol. 6460, pp. 337\u2013348). New York: Springer."},{"issue":"3","key":"9236_CR19","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1111\/j.2517-6161.1986.tb01420.x","volume":"48","author":"MA Fligner","year":"1986","unstructured":"Fligner, M. A., & Verducci, J. S. (1986). Distance based ranking models. Journal of the Royal Statistical Society, 48(3), 359\u2013369.","journal-title":"Journal of the Royal Statistical Society"},{"key":"9236_CR20","volume-title":"Parameterized complexity theory","author":"J Flum","year":"2006","unstructured":"Flum, J., & Grohe, M. (2006). Parameterized complexity theory. Berlin: Springer."},{"issue":"3","key":"9236_CR21","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. (2005). The complexity of Kemeny elections. Theoretical Computer Science, 349(3), 382\u2013391.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"9236_CR22","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1109\/TCBB.2007.70221","volume":"5","author":"BN Jackson","year":"2008","unstructured":"Jackson, B. N., Schnable, P. S., & Aluru, S. (2008). Consensus genetic maps as median orders from inconsistent sources. IEEE\/ACM Transactions on Computational Biology and Bioinformatics, 5(2), 161\u2013171.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"9236_CR23","unstructured":"Karpinski, M., & Schudy, W. (2010). Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament. In Proceedings of the 21st international symposium on algorithms and computation (ISAAC\u201910). LNCS (Vol. 6506, pp. 3\u201314). Berlin: Springer."},{"key":"9236_CR24","unstructured":"Kenyon-Mathieu, C., & Schudy, W. (2007). How to rank with few errors. In Proceedings of the 39th annual ACM symposium on theory of computing (STOC\u201907) (pp. 95\u2013103). New York: ACM."},{"key":"9236_CR25","doi-asserted-by":"crossref","DOI":"10.1037\/14396-000","volume-title":"Individual choice behavior: A theoretical analysis","author":"RD Luce","year":"2005","unstructured":"Luce, R. D. (2005). Individual choice behavior: A theoretical analysis. New York: Dover Publications."},{"key":"9236_CR26","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.jcss.2008.08.004","volume":"75","author":"M Mahajan","year":"2009","unstructured":"Mahajan, M., Raman, V., & Sikdar, S. (2009). Parameterizing above or below guaranteed values. Journal of Computer and System Sciences, 75, 137\u2013153.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1\/2","key":"9236_CR27","doi-asserted-by":"crossref","first-page":"114","DOI":"10.2307\/2333244","volume":"44","author":"C Mallows","year":"1957","unstructured":"Mallows, C. (1957). Non-null ranking models. I. Biometrika, 44(1\/2), 114\u2013130.","journal-title":"Biometrika"},{"key":"9236_CR28","first-page":"392","volume":"5","author":"B Mandhani","year":"2009","unstructured":"Mandhani, B., & Meil\u01ce, M. (2009). Tractable search for learning exponential models of rankings. Journal of Machine Learning Research\u2014Proceedings Track, 5, 392\u2013399.","journal-title":"Journal of Machine Learning Research\u2014Proceedings Track"},{"key":"9236_CR29","first-page":"3481","volume":"11","author":"M Meil\u01ce","year":"2010","unstructured":"Meil\u01ce, M., & Bao, L. (2010). An exponential model for infinite rankings. Journal of Machine Learning Research, 11, 3481\u20133518.","journal-title":"Journal of Machine Learning Research"},{"key":"9236_CR30","unstructured":"Meil\u01ce, M., Phadnis, K., Patterson, A., & Bilmes, J. (2007). Consensus ranking under the exponential model. In Proceedings of the 23rd Conference on Uncertainty in artificial intelligence (UAI\u201907) (pp. 285\u2013294)."},{"key":"9236_CR31","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. (2006). Invitation to fixed-parameter algorithms. Oxford: Oxford University Press."},{"key":"9236_CR32","unstructured":"Nishimura, N., & Simjour, N. (2013). Parameterized enumeration of (locally-) optimal aggregations. In 13th International symposium on algorithms and data structures (WADS\u201913). LNCS (Vol. 8037, pp. 512\u2013523). New York: Springer."},{"key":"9236_CR33","doi-asserted-by":"crossref","first-page":"193","DOI":"10.2307\/2346567","volume":"24","author":"RL Placket","year":"1975","unstructured":"Placket, R. L. (1975). The analysis of permutations. Applied Statistics, 24, 193\u2013202.","journal-title":"Applied Statistics"},{"issue":"2","key":"9236_CR34","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.ipl.2007.05.014","volume":"104","author":"V Raman","year":"2007","unstructured":"Raman, V., & Saurabh, S. (2007). Improved fixed parameter tractable algorithms for two \u201cedge\u201d problems: MAXCUT and MAXDAG. Information Processing Letters, 104(2), 65\u201372.","journal-title":"Information Processing Letters"},{"key":"9236_CR35","unstructured":"Schalekamp, F., & van Zuylen, A. (2009). Rank aggregation: Together we\u2019re strong. In Proceedings of the 11th workshop on algorithm engineering and experiments (ALENEX\u201909) (pp. 38\u201351). Philadelphia: SIAM."},{"key":"9236_CR36","unstructured":"Simjour, N. (2009). Improved parameterized algorithms for the Kemeny aggregation problem. Proceedings of the 4th international workshop on parameterized and exact computation (IWPEC\u201909). LNCS (Vol. 5917, pp. 312\u2013323). New York: Springer."},{"key":"9236_CR37","unstructured":"Simjour, N. (2013). Parameterized enumeration of neighbour strings and Kemeny aggregations. PhD thesis, University of Waterloo."},{"key":"9236_CR38","unstructured":"Truchon, M. (1998). An extension of the Condorcet criterion and Kemeny orders. Technical report, cahier 98\u201315 du Centre de Recherche en \u00c9conomie et Finance Appliqu\u00e9es, Universit\u00e9 Laval, Qu\u00e9bec, Candada."},{"issue":"1","key":"9236_CR39","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1257\/jep.9.1.51","volume":"9","author":"HP Young","year":"1995","unstructured":"Young, H. P. (1995). Optimal voting rules. Journal of Economic Perspectives, 9(1), 51\u201364.","journal-title":"Journal of Economic Perspectives"},{"issue":"2","key":"9236_CR40","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1137\/0135023","volume":"35","author":"HP Young","year":"1978","unstructured":"Young, H. P., & Levenglick, A. (1978). A consistent extension of Condorcet\u2019s election principle. SIAM Journal on Applied Mathematics, 35(2), 285\u2013300.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"3","key":"9236_CR41","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1287\/moor.1090.0385","volume":"34","author":"A Zuylen van","year":"2009","unstructured":"van Zuylen, A., & Williamson, D. P. (2009). Deterministic pivoting algorithms for constrained ranking and clustering problems. Mathematics of Operations Research, 34(3), 594\u2013620.","journal-title":"Mathematics of Operations Research"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-013-9236-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-013-9236-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-013-9236-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T11:31:02Z","timestamp":1716031862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-013-9236-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,4]]},"references-count":41,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["9236"],"URL":"https:\/\/doi.org\/10.1007\/s10458-013-9236-y","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,4]]}}}