N. Ailon, M. Charikar, and N. Newman, Aggregating inconsistent information: Ranking and clustering, Proceedings of the 37th STOC, pp.684-693, 2005.
DOI : 10.1145/1060590.1060692

N. Betzler, M. R. Fellows, J. Guo, R. Niedermeier, and F. A. , Fixed-Parameter Algorithms for Kemeny Scores, LNCS, vol.5034, pp.60-71, 2008.
DOI : 10.1007/978-3-540-68880-8_8

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

V. Conitzer, A. Davenport, and J. Kalagnanam, Improved Bounds for Computing Kemeny Rankings, Proceedings of the 21st National Conference on Artificial Intelligence (AAAI), pp.620-627, 2006.

C. Dwork, R. Kumar, M. Naor, and D. Sivakumar, Rank aggregation methods for the Web, Proceedings of the tenth international conference on World Wide Web , WWW '01, pp.613-622, 2001.
DOI : 10.1145/371920.372165

S. Effler and F. Ruskey, A CAT algorithm for generating permutations with a fixed number of inversions, Information Processing Letters, vol.86, issue.2, pp.107-112, 2003.
DOI : 10.1016/S0020-0190(02)00481-7

J. E. Humphreys, Reflection Groups and Coxeter Groups, 1990.
DOI : 10.1017/CBO9780511623646

C. Kenyon-mathieu and W. Schudy, How to rank with few errors, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.95-103, 2007.
DOI : 10.1145/1250790.1250806

M. Truchon, An Extension of the Condorcet Criterion and Kemeny Orders, cahier 98-15 du Centre de Recherche enÉconomieen´enÉconomie et Finance Appliquées, 1998.

A. Vanzuylen and D. P. Williamson, Deterministic algorithms for rank aggregation and other ranking and clustering problems, Proceedings of the 5th WAOA, pp.260-273, 2007.