Single transferable vote resists strategic voting, Social Choice and Welfare, vol.8, issue.4, pp.341-354, 1991. ,
The computational difficulty of manipulating an election, Social Choice and Welfare, vol.6, issue.3, pp.227-241, 1989. ,
,
On the reconstruction of binary and permutation matrices under (binary) tomographic constraints, Theor. Comput. Sci, vol.406, issue.1-2, pp.63-71, 2008. ,
When are elections with few candidates hard to manipulate, JACM, vol.54, 2007. ,
An empirical study of Borda manipulation, 2010. ,
On representatives of subsets, Journal of the London Mathematical Society, 1935. ,
Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems, JACM, vol.22, issue.4, pp.522-550, 1975. ,
A note on the hardness of Skolem-type sequences, Discrete Appl. Math, vol.158, issue.8, pp.63-71, 2010. ,
An empirical study of the manipulability of single transferable voting, Proc. of the 19th European Conf. on Artificial Intelligence (ECAI-2010), 2010. ,
Complexity of unweighted coalitional manipulation under some common voting rules, Proc. of 21st IJCAI, pp.348-353, 2009. ,
A scheduling approach to coalitional manipulation, Proc. 11th ACM Conference on Electronic Commerce (EC-2010), pp.275-284, 2010. ,
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard, J. Scheduling, vol.7, issue.5, pp.333-348, 2004. ,
Algorithms for the coalitional manipulation problem. Artificial Intelligence, vol.173, pp.392-412, 2009. ,