J. Bartholdi and J. Orlin, Single transferable vote resists strategic voting, Social Choice and Welfare, vol.8, issue.4, pp.341-354, 1991.

J. Bartholdi, C. Tovey, and M. Trick, The computational difficulty of manipulating an election, Social Choice and Welfare, vol.6, issue.3, pp.227-241, 1989.

S. Brunetti, A. ;. Lungo, and . Del,

P. Gritzmann and S. De-vries, On the reconstruction of binary and permutation matrices under (binary) tomographic constraints, Theor. Comput. Sci, vol.406, issue.1-2, pp.63-71, 2008.

V. Conitzer, T. Sandholm, and J. Lang, When are elections with few candidates hard to manipulate, JACM, vol.54, 2007.

J. Davies, G. Katsirelos, N. Narodytska, and T. Walsh, An empirical study of Borda manipulation, 2010.

P. Hall, On representatives of subsets, Journal of the London Mathematical Society, 1935.

K. L. Krause, V. Y. Shen, and H. D. Schwetman, Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems, JACM, vol.22, issue.4, pp.522-550, 1975.

G. Nordh, A note on the hardness of Skolem-type sequences, Discrete Appl. Math, vol.158, issue.8, pp.63-71, 2010.

T. Walsh, An empirical study of the manipulability of single transferable voting, Proc. of the 19th European Conf. on Artificial Intelligence (ECAI-2010), 2010.

L. Xia, M. Zuckerman, A. Procaccia, V. Conitzer, and J. Rosenschein, Complexity of unweighted coalitional manipulation under some common voting rules, Proc. of 21st IJCAI, pp.348-353, 2009.

L. Xia, V. Conitzer, and A. Procaccia, A scheduling approach to coalitional manipulation, Proc. 11th ACM Conference on Electronic Commerce (EC-2010), pp.275-284, 2010.

W. Yu, H. Hoogeveen, and J. K. Lenstra, 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.

M. Zuckerman, A. Procaccia, and J. Rosenschein, Algorithms for the coalitional manipulation problem. Artificial Intelligence, vol.173, pp.392-412, 2009.