Aggregating inconsistent information: Ranking and clustering, J. ACM, issue.5, p.55, 2008. ,
Experiments with Kemeny ranking: What works when?, Mathematical Social Sciences, vol.64, issue.1, pp.28-40, 2012. ,
DOI : 10.1016/j.mathsocsci.2011.08.008
A characterization of the single-peaked domain, Social Choice and Welfare, vol.17, issue.3, pp.305-322, 2011. ,
DOI : 10.1007/s00355-010-0476-3
Voting schemes for which it can be difficult to tell who won the election, Social Choice and Welfare, vol.35, issue.2, pp.157-165, 1989. ,
DOI : 10.1007/BF00303169
Stable matching with preferences derived from a psychological model, Operations Research Letters, vol.5, issue.4, pp.165-169, 1986. ,
DOI : 10.1016/0167-6377(86)90072-6
Fixed-parameter algorithms for Kemeny rankings, Theoretical Computer Science, vol.410, issue.45, pp.4104554-4570, 2009. ,
DOI : 10.1016/j.tcs.2009.08.033
Partial Kernelization for Rank Aggregation: Theory and Experiments, IPEC, pp.26-37, 2010. ,
DOI : 10.1137/0135023
The multivariate algorithmic revolution and beyond. chapter Studies in computational aspects of voting: open problems of Downey and Fellows, pp.318-363, 2012. ,
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Journal of Computer and System Sciences, vol.13, issue.3, pp.335-379, 1976. ,
DOI : 10.1016/S0022-0000(76)80045-1
On the fixed-parameter tractability of composition-consistent tournament solutions, IJCAI, pp.85-90, 2011. ,
A characterization of the single-crossing domain, 4th International Workshop on Computational Social Choice, 2012. ,
DOI : 10.1007/s00355-012-0717-8
Improved bounds for computing Kemeny rankings, AAAI, pp.620-626, 2006. ,
Computing Slater rankings using similarities among candidates, AAAI, pp.613-619, 2006. ,
Eliciting single-peaked preferences using comparison queries, Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems , AAMAS '07, pp.161-191, 2009. ,
DOI : 10.1145/1329125.1329204
Bounded single-peaked width and proportional representation, ECAI, pp.270-275, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-01497136
A computational study of the Kemeny rule for preference aggregation, AAAI, pp.697-702, 2004. ,
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
Clone structures in voters' preferences The complexity of nearly single-peaked consistency, ACM Conference on Electronic Commerce 4th International Workshop on Computational Social Choice (COMSOC- 2012), 2012. [Escoffier et al, pp.496-513, 2008. ,
The complexity of manipulative attacks in nearly single-peaked electorates, Proceedings of hte 13th Conference on Theoretical Aspects of Rationality and Knowledge, TARK XIII, pp.366-370, 2004. ,
DOI : 10.1145/2000378.2000406
Mathematics without numbers How to rank with few errors Composition-consistent tournament solutions and social choice functions. Social Choice and Welfare Social choice theory and recommender systems: Analysis of the axiomatic foundations of collaborative filtering] N. Simjour. Parameterized and exact computation. chapter Improved Parameterized Algorithms for the Kemeny Aggregation Problem Independence of clones as a criterion for voting rules Deterministic algorithms for rank aggregation and other ranking and clustering problems, STOC AAAI/IAAI Trick. Recognizing single-peaked preferences on a tree WAOA, pp.3-14571591, 1959. ,