Hall's theorem for hypergraphs, Journal of Graph Theory, vol.35, issue.2, pp.83-88, 2000. ,
Finding perfect matchings in random cubic graphs in linear time, 2018. ,
Improved approximation lower bounds on small occurence optimization, ECCC Report, 2003. ,
Tres observaciones sobre el algebra lineal, Univ. Nac. Tucuman, Ser. A, vol.5, pp.147-154, 1946. ,
Toward an architecture for never-ending language learning, In: AAAI, vol.5, p.3, 2010. ,
PaToH: A Multilevel Hypergraph Partitioning Tool, 1999. ,
Structure prediction and computation of sparse matrix products, Journal of Combinatorial Optimization, vol.2, issue.4, pp.307-332, 1998. ,
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. ,
How to sell hyperedges: The hypermatching assignment problem, Proc. of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pp.342-351, 2013. ,
, Perfect fractional matchings in k-out hypergraphs, 2017.
Scaling matrices and counting perfect matchings in graphs, 2018. ,
Two approximation algorithms for bipartite matching on multicore architectures, J. Parallel Distr. Com, vol.85, pp.62-78, 2015. ,
Approximation algorithms for maximum matchings in undirected graphs, Proc. Seventh SIAM Workshop on Combinatorial Scientific Computing, pp.56-65, 2018. ,
Effective heuristics for matchings in hypergraphs, 2018. ,
Randomized greedy matching, Random Structures & Algorithms, vol.2, issue.1, pp.29-45, 1991. ,
On the scaling of multidimensional matrices. Linear Algebra and its applications 114, pp.717-735, 1989. ,
Maximum matchings in a class of random graphs, J. Comb. Theory B, vol.40, issue.2, pp.196-212, 1986. ,
A set packing approach for scheduling passenger train drivers: the French experience, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01138067
Euclidean Embedding of Cooccurrence Data, The Journal of Machine Learning Research, vol.8, pp.2265-2295, 2007. ,
Decomposing combinatorial auctions and set packing problems, J. ACM, vol.60, issue.4, p.39, 2013. ,
Approximating discrete collections via local improvements, In: SODA, vol.95, pp.160-169, 1995. ,
On the complexity of approximating kdimensional matching, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp.83-97, 2003. ,
On the complexity of approximating k-set packing, Computational Complexity, vol.15, issue.1, pp.20-39, 2006. ,
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. ,
Existence of a perfect matching in a random (1+e ?1 )-out bipartite graph, J. Comb. Theory B, vol.88, issue.1, pp.1-16, 2003. ,
Maximum matching in sparse random graphs, FOCS'81, pp.364-375, 1981. ,
Reducibility among combinatorial problems, Complexity of computer computations, pp.85-103, 1972. ,
Scalable sparse tensor decompositions in distributed memory systems, Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01148202
Finding Near-Optimal Independent Sets at Scale, Proceedings of the 16th Meeting on Algorithm Engineering and Exerpimentation (ALENEX'16, 2016. ,
Computing the block triangular form of a sparse matrix, ACM T. Math. Software, vol.16, pp.303-324, 1990. ,
The enron email dataset database schema and brief statistical report. Information sciences institute technical report, vol.4, 2004. ,
Concerning nonnegative matrices and doubly stochastic matrices, Pacific J. Math, vol.21, pp.343-348, 1967. ,
, FROSTT: The formidable repository of open sparse tensors and tools, 2017.
Matchings in random regular bipartite digraphs, Discrete Math, vol.31, issue.1, pp.59-64, 1980. ,