R. Aharoni and P. Haxell, Hall's theorem for hypergraphs, Journal of Graph Theory, vol.35, issue.2, pp.83-88, 2000.

M. Anastos and A. Frieze, Finding perfect matchings in random cubic graphs in linear time, 2018.

P. Berman and M. Karpinski, Improved approximation lower bounds on small occurence optimization, 2003.

G. Birkhoff, Tres observaciones sobre el algebra lineal, Univ. Nac. Tucuman, Ser. A, vol.5, pp.147-154, 1946.

A. Carlson, J. Betteridge, B. Kisiel, B. Settles, E. R. Hruschka et al., Toward an architecture for never-ending language learning, AAAI, vol.5, p.3, 2010.

Ü. V. Çatalyürek and C. Aykanat, PaToH: A Multilevel Hypergraph Partitioning Tool, 1999.

E. Cohen, Structure prediction and computation of sparse matrix products, Journal of Combinatorial Optimization, vol.2, issue.4, pp.307-332, 1998.

L. Cui, W. Li, and M. K. Ng, Birkhoff-von Neumann Theorem for multistochastic tensors, SIAM Journal on Matrix Analysis and Applications, vol.35, issue.3, pp.956-973, 2014.

M. Cygan, Improved approximation for 3-dimensional matching via bounded pathwidth local search, Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on, pp.509-518, 2013.

M. Cygan, F. Grandoni, and M. Mastrolilli, How to sell hyperedges: The hypermatching assignment problem, Proc. of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pp.342-351, 2013.

P. Devlin and J. Kahn, Perfect fractional matchings in k-out hypergraphs, 2017.

F. Dufossé, K. Kaya, and B. Uçar, Two approximation algorithms for bipartite matching on multicore architectures, J. Parallel Distr. Com, vol.85, pp.62-78, 2015.

F. Dufossé, K. Kaya, I. Panagiotas, and B. Uçar, Approximation algorithms for maximum matchings in undirected graphs, Proc. Seventh SIAM Workshop on Combinatorial Scientific Computing, pp.56-65

F. Dufossé, K. Kaya, I. Panagiotas, and B. Uçar, Scaling matrices and counting perfect matchings in graphs, 2018.

M. Dyer and A. Frieze, Randomized greedy matching, Random Structures & Algorithms, vol.2, pp.29-45, 1991.

J. Franklin and J. Lorenz, On the scaling of multidimensional matrices, Linear Algebra and its applications, vol.114, pp.717-735, 1989.

A. M. Frieze, Maximum matchings in a class of random graphs, J. Comb. Theory B, vol.40, issue.2, pp.95-8956, 1986.

A. Froger, O. Guyon, and E. Pinson, A set packing approach for scheduling passenger train drivers: the French experience, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01138067

A. Globerson, G. Chechik, F. Pereira, and N. Tishby, Euclidean Embedding of Co-occurrence Data, The Journal of Machine Learning Research, vol.8, pp.2265-2295, 2007.

G. Gottlob and G. Greco, Decomposing combinatorial auctions and set packing problems, J. ACM, vol.60, issue.4, pp.4-5411, 2013.

M. M. Halldórsson, Approximating discrete collections via local improvements, SODA, vol.95, pp.160-169, 1995.

E. Hazan, S. Safra, and O. Schwartz, On the complexity of approximating k-dimensional matching, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp.83-97, 2003.

E. Hazan, S. Safra, and O. Schwartz, On the complexity of approximating k-set packing, Computational Complexity, vol.15, issue.1, pp.20-39, 2006.

C. A. Hurkens and A. Schrijver, On the size of systems of sets every t of which have an sdr, with an application to the worst-case ratio of heuristics for packing problems, SIAM Journal on Discrete Mathematics, vol.2, issue.1, pp.68-72, 1989.

M. Karo?ski and B. Pittel, Existence of a perfect matching in a random (1+e ?1 )-out bipartite graph, J. Comb. Theory B, vol.88, issue.1, pp.95-8956, 2003.

R. M. Karp, Reducibility among combinatorial problems, In Complexity of computer computations, pp.85-103, 1972.

R. M. Karp and M. Sipser, Maximum matching in sparse random graphs, FOCS'81, pp.364-375, 1981.

O. Kaya and B. Uçar, Scalable sparse tensor decompositions in distributed memory systems, Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC '15, vol.77, pp.1-77, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01148202

S. Lamm, P. Sanders, C. Schulz, D. Strash, and R. F. Werneck, Finding Near-Optimal Independent Sets at Scale, Proceedings of the 16th Meeting on Algorithm Engineering and Exerpimentation (ALENEX'16), 2016.

A. Pothen and C. Fan, Computing the block triangular form of a sparse matrix, ACM T. Math. Software, vol.16, pp.303-324, 1990.

J. Shetty and J. Adibi, The enron email dataset database schema and brief statistical report. Information sciences institute technical report, vol.4, 2004.

R. Sinkhorn and P. Knopp, Concerning nonnegative matrices and doubly stochastic matrices, Pacific J. Math, vol.21, pp.343-348, 1967.

S. Smith, J. W. Choi, J. Li, R. Vuduc, J. Park et al., FROSTT: The formidable repository of open sparse tensors and tools, 2017.

D. W. Walkup, Matchings in random regular bipartite digraphs, Discrete Math, vol.31, issue.1, pp.59-64, 1980.