Aggregating inconsistent information: ranking and clustering
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Ordering by weighted number of wins gives a good ranking for weighted tournaments
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
Combinatorics, Probability and Computing
Feedback arc set in bipartite tournaments is NP-complete
Information Processing Letters
Hardness of fully dense problems
Information and Computation
Aggregating inconsistent information: Ranking and clustering
Journal of the ACM (JACM)
Computing slater rankings using similarities among candidates
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Ordering by weighted number of wins gives a good ranking for weighted tournaments
ACM Transactions on Algorithms (TALG)
A polynomial kernel for feedback arc set on bipartite tournaments
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Quasi-hamiltonian paths in semicomplete multipartite digraphs
Discrete Applied Mathematics
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
Theory of Computing Systems
| Hi-index | 0.00 |