F. N. Afrati, S. Dolev, E. Korach, S. Sharma, and J. D. Ullman, Assignment Problems of Different-Sized Inputs in MapReduce, Proceedings of the EDBT/ICDT Conference, pp.28-37, 2015.
DOI : 10.1145/2987376

F. N. Afrati, S. Dolev, E. Korach, S. Sharma, and J. D. Ullman, Assignment Problems of Different-Sized Inputs in MapReduce, ACM Transactions on Knowledge Discovery from Data, vol.11, issue.2, 1507.
DOI : 10.1145/2987376

N. Alon and J. H. Spencer, The probabilistic method, 2016.

A. Bhaskara, M. Charikar, E. Chlamtac, U. Feige, and A. Vijayaraghavan, Detecting high log-densities, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.201-210, 2010.
DOI : 10.1145/1806689.1806719

E. G. Coffman-jr, J. Csirik, G. Galambos, S. Martello, and D. Vigo, Bin packing approximation algorithms: survey and classification. Handbook of Combinatorial Optimization, pp.455-531, 2013.

O. Goldschmidt, D. S. Hochbaum, C. A. Hurkens, and G. Yu, -Clique Covering Problem, SIAM Journal on Discrete Mathematics, vol.9, issue.3, pp.492-509, 1996.
DOI : 10.1137/S089548019325232X
URL : https://hal.archives-ouvertes.fr/hal-01058862

S. L. Hakimi, On the degrees of the vertices of a directed graph, Journal of the Franklin Institute, vol.279, issue.4, pp.290-308, 1965.
DOI : 10.1016/0016-0032(65)90340-6

W. Mills and R. Mullin, Coverings and packings Contemporary design theory: A collection of surveys, pp.371-399, 1992.

D. R. Stinson, The CRC Handbook of Combinatorial Designs, volume 42 of Discrete Mathematics and Its Applications, chapter, pp.260-265, 2006.

R. M. Wilson, Decomposition of complete graphs into subgraphs isomorphic to a given graph, Congressus numerantium, vol.15, pp.647-659, 1976.