Author:
Dey Palash,Misra Neeldhara
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science,General Computer Science
Reference26 articles.
1. Computational complexity of two variants of the possible winner problem;Baumeister,2011
2. Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules;Baumeister;Inf. Process. Lett.,2012
3. Approximation hardness and satisfiability of bounded occurrence instances of SAT;Berman;Electron. Colloq. on Comput. Complex. (ECCC),2003
4. Partial kernelization for rank aggregation: theory and experiments;Betzler,2010
5. Theoretical and empirical evaluation of data reduction for exact Kemeny rank aggregation;Betzler;Auton. Agents Multi-Agent Syst.,2014