J. L. Arocha, I. Bárány, J. Bracho, R. Fabila, and L. Montejano, Very Colorful Theorems, Discrete & Computational Geometry, vol.59, issue.3, pp.142-154, 2009.
DOI : 10.1007/s00454-009-9180-4

I. Bárány, A generalization of carath??odory's theorem, Discrete Mathematics, vol.40, issue.2-3, pp.141-152, 1982.
DOI : 10.1016/0012-365X(82)90115-7

I. Bárány and D. G. Larman, A colored version of Tverberg's theorem, Journal of the London Mathematical Society, Second Series, vol.45, issue.2, pp.314-320, 1992.

I. Bárány and J. Matou?ek, Quadratically Many Colorful Simplices, SIAM Journal on Discrete Mathematics, vol.21, issue.1, pp.191-198, 2007.
DOI : 10.1137/050643039

I. Bárány and S. Onn, Colourful Linear Programming and its Relatives, Mathematics of Operations Research, vol.22, issue.3, pp.550-567, 1997.
DOI : 10.1287/moor.22.3.550

I. Bárány, Z. Füredi, and L. Lovász, On the number of halving planes, Combinatorica, vol.41, issue.2, pp.175-183, 1990.
DOI : 10.1007/BF02123008

P. V. Blagojevi´cblagojevi´c, B. Matschke, and G. Ziegler, Optimal bounds for the colored Tverberg problem, 2009.

E. Boros and Z. Füredi, The number of triangles covering the center of an n-set, Geometriae Dedicata, vol.17, issue.1
DOI : 10.1007/BF00181519

S. Chakraborty, E. Fischer, A. Matsliah, and R. Yuster, Hardness and algorithms for rainbow connection, Journal of Combinatorial Optimization, vol.133, issue.1, pp.330-347, 2011.
DOI : 10.1007/s10878-009-9250-9

B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, M. Sharir et al., Improved bounds on weak ??-nets for convex sets, Discrete & Computational Geometry, vol.6, issue.1, pp.1-15, 1995.
DOI : 10.1007/BF02574025

X. Chen and X. Deng, On the Complexity of 2D Discrete Fixed Point Problem, Automata, Languages and Programming, pp.489-500, 2006.
DOI : 10.1007/11786986_43

X. Chen, X. Deng, and S. Teng, Settling the complexity of computing two-player Nash equilibria, Journal of the ACM, vol.56, issue.3, pp.1-1457, 2009.
DOI : 10.1145/1516512.1516516

D. I. Cohen, On the Sperner lemma, Journal of Combinatorial Theory, vol.2, issue.4, pp.585-587, 1967.
DOI : 10.1016/S0021-9800(67)80062-0

G. Custard, A. Deza, T. Stephen, and F. Xie, Small octahedral systems, Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG'11), 2011.

G. B. Dantzig, Linear programming and extensions, 1963.
DOI : 10.1515/9781400884179

G. B. Dantzig, The Diet Problem, Interfaces, vol.20, issue.4, pp.43-47, 1990.
DOI : 10.1287/inte.20.4.43

A. Deza, S. Huang, T. Stephen, and T. Terlaky, Colourful Simplicial Depth, Discrete & Computational Geometry, vol.35, issue.4, pp.597-604, 2006.
DOI : 10.1007/s00454-006-1233-3
URL : https://hal.archives-ouvertes.fr/hal-00822118

A. Deza, S. Huang, T. Stephen, and T. Terlaky, The colourful feasibility problem, Discrete Applied Mathematics, vol.156, issue.11, pp.2166-2177, 2008.
DOI : 10.1016/j.dam.2008.01.016

A. Deza, T. Stephen, and F. Xie, More Colourful Simplices, Discrete & Computational Geometry, vol.16, issue.4, pp.272-278, 2011.
DOI : 10.1007/s00454-010-9291-y
URL : http://arxiv.org/abs/1001.4582

A. Deza, F. Meunier, and P. Sarrabezolles, A Combinatorial Approach to Colourful Simplicial Depth, SIAM Journal on Discrete Mathematics, vol.28, issue.1, pp.306-322, 2014.
DOI : 10.1137/130913031
URL : https://hal.archives-ouvertes.fr/hal-00822118

M. R. Garey and D. S. Johnson, Computers and intractability: A Guide to the Theory of NP-Completeness, Freeman, vol.174, 1979.

I. Gilboa and E. Zemel, Nash and correlated equilibria: Some complexity considerations, Games and Economic Behavior, vol.1, issue.1, pp.80-93, 1989.
DOI : 10.1016/0899-8256(89)90006-7
URL : https://hal.archives-ouvertes.fr/hal-00753241

M. Gromov, Singularities, expanders and topology of maps Part 2: from combinatorics to topology via algebraic isoperimetry. Geometric and Functional Analysis, pp.416-526, 2010.

A. F. Holmsen, J. Pach, H. Tverberg, R. Huang, and G. Rota, Points surrounding the origin On the relations of various conjectures on latin squares and straightening coefficients, Combinatorica Discrete Mathematics, vol.28, issue.128, pp.633-6441, 1994.

S. Huang, MATLAB code for Colourful Linear Programming, available at: http://optlab.mcmaster.ca

D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis, How easy is local search?, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.79-100, 1988.
DOI : 10.1109/SFCS.1985.31

R. Karasev, A Simpler Proof of??the??Boros???F??redi???B??r??ny???Pach???Gromov Theorem, Discrete & Computational Geometry, vol.61, issue.2, pp.492-495, 2012.
DOI : 10.1007/s00454-011-9332-1

S. Kintali, L. J. Poplawski, R. Rajaraman, R. Sundaram, and S. Teng, Reducibility among fractional stability problems, pp.2063-2113, 2013.
DOI : 10.1109/focs.2009.57

T. Király and J. Pap, PPAD-completeness of polyhedral versions of Sperner???s Lemma, Discrete Mathematics, vol.313, issue.15, pp.1594-1599, 2013.
DOI : 10.1016/j.disc.2013.04.006

E. L. Lawler, Matroid intersection algorithms, Mathematical Programming, vol.45, issue.1, pp.31-56, 1975.
DOI : 10.1007/BF01681329

C. E. Lemke, Bimatrix Equilibrium Points and Mathematical Programming, Management Science, vol.11, issue.7, pp.681-689, 1965.
DOI : 10.1287/mnsc.11.7.681

C. E. Lemke and J. T. Howson, Equilibrium Points of Bimatrix Games, Journal of the Society for Industrial and Applied Mathematics, vol.12, issue.2, pp.413-423, 1964.
DOI : 10.1137/0112033

R. Y. Liu, On a notion of data depth based on random simplices. The Annals of Statistics, pp.405-414, 1990.

T. L. Magnanti, Complementary bases of a matroid, Discrete Mathematics, vol.8, issue.4, pp.355-361, 1974.
DOI : 10.1016/0012-365X(74)90155-1

J. Matou?ek and B. Gärtner, Understanding and Using Linear Programming (Universitext), 2006.

J. Matou?ek, Lectures on Discrete Geometry, 2002.
DOI : 10.1007/978-1-4613-0039-7

N. Megiddo and R. Chandrasekaran, On the ??-perturbation method for avoiding degeneracy, Operations Research Letters, vol.8, issue.6, pp.305-308, 1989.
DOI : 10.1016/0167-6377(89)90014-X

F. Meunier, Computing and proving with pivots. RAIRO -Operations Research, pp.331-360
URL : https://hal.archives-ouvertes.fr/hal-00849867

F. Meunier and A. Deza, A Further Generalization of the Colourful Carath??odory Theorem, Discrete Geometry and Optimization of Fields Institute Communications, pp.179-190
DOI : 10.1007/978-3-319-00200-2_11

W. Mülzer and Y. Stein, Complexity of finding nearest colorful polytopes, Proceedings of EuroCG, 2014.

J. R. Munkres, Elements of algebraic topology, 1984.

K. G. Murty, Linear Complementarity, Linear and Nonlinear Programming, 1988.

C. H. Papadimitriou, On the complexity of the parity argument and other inefficient proofs of existence, Journal of Computer and System Sciences, vol.48, issue.3, pp.498-532, 1994.
DOI : 10.1016/S0022-0000(05)80063-7

K. S. Sarkaria, Tverberg???s theorem via number fields, Israel Journal of Mathematics, vol.24, issue.2-3, pp.317-320, 1992.
DOI : 10.1007/BF02808223

P. Sarrabezolles, The colourful simplicial depth conjecture, Journal of Combinatorial Theory, Series A, vol.130, issue.0, pp.119-128, 2015.
DOI : 10.1016/j.jcta.2014.11.002
URL : https://hal.archives-ouvertes.fr/hal-00943550

H. Scarf, The Approximation of Fixed Points of a Continuous Mapping, SIAM Journal on Applied Mathematics, vol.15, issue.5, pp.1328-1343, 1967.
DOI : 10.1137/0115116

E. Sperner, Neuer Beweis für die Invarianz der Dimensionszahl und des Gebietes, pp.265-272, 1928.

T. Stephen and H. Thomas, A quadratic lower bound for colourful simplicial depth, Journal of Combinatorial Optimization, vol.35, issue.4, pp.324-327, 2008.
DOI : 10.1007/s10878-008-9149-x

M. J. Todd, Orientation in Complementary Pivot Algorithms, Mathematics of Operations Research, vol.1, issue.1, pp.54-66, 1976.
DOI : 10.1287/moor.1.1.54

H. Tverberg, A generalization of Radon's theorem, Journal of the London Mathematical Society, issue.1, pp.1-41123, 1966.

L. A. Végh, B. Von-stengel, R. T. ?ivaljevi´c?ivaljevi´c, and S. T. Vre´cicavre´cica, Oriented Euler complexes and signed perfect matchings The colored Tverberg's problem and complexes of injective functions, Journal of Combinatorial Theory, Series A, vol.61, pp.309-318, 1992.