Aggregating inconsistent information: ranking and clustering, ACM Symposium on Theory of Computing (STOC), pp.684-693, 2005. ,
DOI : 10.1145/1060590.1060692
Ranking Tournaments, SIAM Journal on Discrete Mathematics, vol.20, issue.1, pp.137-142, 2006. ,
DOI : 10.1137/050623905
Fast FAST, International Colloquium on Automata, Languages and Programming (ICALP), 2009. ,
DOI : 10.1007/978-3-642-02927-1_6
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
On Problems without Polynomial Kernels (Extended Abstract), International Colloquium on Automata, Languages and Programming (ICALP), pp.563-574, 2008. ,
DOI : 10.1007/978-3-540-70575-8_46
Mémoire sur lesélectionslesélections au scrutin, Histoire de l'Académie Royale des Sciences, p.1781 ,
A polynomial kernel for multicut in trees, Symposium on Theoretical Aspects of Computer Science (STACS), pp.183-194, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00359171
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments, Combinatorics, Probability and Computing, vol.16, issue.01, pp.1-4, 2007. ,
DOI : 10.1017/S0963548306007887
URL : https://hal.archives-ouvertes.fr/lirmm-00140321
Learning to order things, Advances in neural information processing systems (NIPS), pp.451-457, 1997. ,
Essai sur l'application de l'analysè a la probabilité des décisions renduesàrenduesà la pluralité des voix, p.1785 ,
Ordering by weighted number of wins gives a good ranking for weighted tournaments, ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.776-782, 2006. ,
DOI : 10.1145/1798596.1798608
Fixed-parameter tractability results for feedback set problems in tournaments, Conference on Algorithms and Complexity (CIAC), pp.320-331, 2006. ,
Incompressibility through Colors and IDs, International Colloquium on Automata, Languages and Programming (ICALP), 2009. ,
DOI : 10.1007/978-3-642-02927-1_32
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.1154
Rank aggregation revisited ,
Rank aggregation methods for the Web, Proceedings of the tenth international conference on World Wide Web , WWW '01, 2001. ,
DOI : 10.1145/371920.372165
On sets of consistent arcs in a tournament, Bulletin canadien de math??matiques, vol.8, issue.0, pp.269-271, 1965. ,
DOI : 10.4153/CMB-1965-017-1
On subgraphs without cycles in tournaments. Combinatorial Theory and its Applications II, pp.675-677, 1970. ,
Mathematical models in the social sciences, Blaisdell, 1962. ,
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
Linear-time modular decomposition of directed graphs, Discrete Applied Mathematics, vol.145, issue.2, pp.198-209, 2005. ,
DOI : 10.1016/j.dam.2004.02.017
URL : https://hal.archives-ouvertes.fr/hal-00159571
Parameterized algorithms for feedback set problems and their duals in tournaments, Theoretical Computer Science, vol.351, issue.3, pp.446-458, 2006. ,
DOI : 10.1016/j.tcs.2005.10.010
Disproof of a conjecture of Erd??s and moser on tournaments, Journal of Combinatorial Theory, vol.9, issue.3, pp.225-238, 1970. ,
DOI : 10.1016/S0021-9800(70)80061-8
Linear Graphs and Electrical Networks, 1961. ,
Inconsistencies in a schedule of paired comparisons, Biometrika, vol.48, issue.3-4, pp.303-312, 1961. ,
DOI : 10.1093/biomet/48.3-4.303
On feedback problems in digraphs, Workshop on Graph- Theoretic Concepts in Computer Science (WG), pp.218-231, 1989. ,
DOI : 10.1007/3-540-52292-1_16
Optimal ranking of tournaments. Networks, pp.135-138, 1971. ,
A quadratic kernel for feedback vertex set, ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.115-119, 2009. ,
DOI : 10.1137/1.9781611973068.13
Deterministic approximation algorithms for ranking and clusterings, 2005. ,
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems, ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.405-414, 2007. ,
DOI : 10.1287/moor.1090.0385
Minimum Feedback Arc Sets for a Directed Graph, IEEE Transactions on Circuit Theory, vol.10, issue.2, pp.238-245, 1963. ,
DOI : 10.1109/TCT.1963.1082116