N. Alon, Splitting necklaces, Proc. of the International Congress of Mathematicians, pp.247-253, 1987.
DOI : 10.1016/0001-8708(87)90055-7
URL : http://doi.org/10.1016/0001-8708(87)90055-7

N. Alon, D. Moshkovitz, and S. Safra, -restrictions, ACM Transactions on Algorithms, vol.2, issue.2, pp.153-177, 2006.
DOI : 10.1145/1150334.1150336
URL : https://hal.archives-ouvertes.fr/halshs-00480214

N. Alon and D. West, The Borsuk-Ulam theorem and bisection of necklaces, Proc. Amer, pp.623-628, 1986.
DOI : 10.1090/S0002-9939-1986-0861764-9

H. Amini, F. Meunier, H. Michel, and A. Mohajeri, Greedy colorings for the binary paintshop problem, Journal of Discrete Algorithms, vol.8, issue.1, pp.8-14, 2010.
DOI : 10.1016/j.jda.2008.05.002
URL : https://hal.archives-ouvertes.fr/hal-00835222

S. D. Andres and W. Hochstättler, Some heuristics for the binary paintshop problem and their expected number of colour changes, Journal of Discrete Algorithms, 2010.

E. Babson, H. Barcelo, M. De-longueville, and R. Laubenbacher, Homotopy theory of graphs, Journal of Algebraic Combinatorics, vol.110, issue.1, pp.31-44, 2006.
DOI : 10.1007/s10801-006-9100-0

S. N. Bhatt and C. E. Leiserson, How to assemble tree machines, Proc. of the 14th Symposium on the Theory of Computing, pp.99-104, 1981.

P. S. Bonsma, T. Epping, and W. Hochstättler, Complexity results on restricted instances of a paint shop problem for words, Discrete Applied Mathematics, vol.154, issue.9, pp.1335-1343, 2006.
DOI : 10.1016/j.dam.2005.05.033

M. De-longueville and R. Zivaljevic, The Borsuk???Ulam-property, Tucker-property and constructive proofs in combinatorics, Journal of Combinatorial Theory, Series A, vol.113, issue.5, pp.839-850, 2006.
DOI : 10.1016/j.jcta.2005.08.002

T. Epping, W. Hochstättler, and P. Oertel, Complexity results on a paint shop problem, Discrete Applied Mathematics, vol.136, issue.2-3, pp.217-226, 2004.
DOI : 10.1016/S0166-218X(03)00442-6

K. Fan, Combinatorial properties of certain simplicial and cubical vertex maps, Archiv der Mathematik, vol.56, issue.1, pp.368-377, 1960.
DOI : 10.1007/BF01236961

C. H. Goldberg and D. West, Bisection of Circle Colorings, SIAM Journal on Algebraic Discrete Methods, vol.6, issue.1, pp.93-106, 1985.
DOI : 10.1137/0606010

J. Matou?ek, Using the Borsuk-Ulam theorem, 2003.
DOI : 10.1007/978-3-540-76649-0

N. Meggido and C. H. Papadimitriou, A note on total functions, existence theorems, and computational complexity, 1989.

F. Meunier, Discrete Splittings of the Necklace, Mathematics of Operations Research, vol.33, issue.3, pp.678-688, 2008.
DOI : 10.1287/moor.1080.0311
URL : https://hal.archives-ouvertes.fr/hal-00740623

F. Meunier and A. , Paintshop, odd cycles and necklace splitting, Discrete Applied Mathematics, vol.157, issue.4, pp.780-793, 2009.
DOI : 10.1016/j.dam.2008.06.017
URL : https://hal.archives-ouvertes.fr/hal-00835238

B. Neveu and G. Trombettoni, INCOP: An Open Library for INcomplete Combinatorial OPtimization, Proc. International Conference on Principles Constraint Programming, CP'03 (Kinsale,Ireland), pp.909-913, 2003.
DOI : 10.1007/978-3-540-45193-8_77

B. Neveu, G. Trombettoni, F. Glover, and . Id-walk, A Candidate List Strategy with a Simple Diversification Device, Proc. 10th International Conference on Principles and Practice of Constraint Programming -CP 2004, pp.423-437, 2004.

C. 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

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

G. Simonyi, Necklace bisection with one cut less than needed, The elecvtronic journal of combinatorics, p.15, 2008.