P. Biswas, T. Lian, T. Wang, and Y. Ye, Semidefinite programming based algorithms for sensor network localization, ACM Transactions in Sensor Networks, vol.2, pp.188-220, 2006.

F. R. Chung and L. Lu, Complex Graphs and Networks, American Mathematical Society and CBMS Regional Conference Series in Mathematics, vol.107, 2006.

Y. Ding, N. Krislock, J. Qian, and H. Wolkowicz, Sensor network localization, euclidean distance matrix completions, and graph realization, Optimization and Engineering, vol.11, pp.45-66, 2010.

E. D. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles, Mathematical Programming, vol.91, issue.2, pp.201-213, 2002.

D. S. Gonçalves and A. Mucherino, Optimal partial discretization orders for discretizable distance geometry, International Transactions in Operational Research, vol.23, issue.5, pp.947-967, 2016.

J. C. Mehdi-hemmati, M. T. Smith, and . Thai, A cutting-plane algorithm for solving a weighted influence interdiction problem, Computational Optimization and Applications, vol.57, issue.1, pp.71-104, 2014.

M. J. Keeling and K. T. Eames, Networks and epidemic models, Journal of the Royal Society Interface, vol.2, pp.295-307, 2005.

C. Lavor, L. Liberti, N. Maculan, and A. Mucherino, The discretizable molecular distance geometry problem, Computational Optimization and Applications, vol.52, issue.1, pp.115-146, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00756940

C. Lavor, J. Lee, A. Lee-st, L. John, A. Liberti et al., Discretization orders for distance geometry problems, Optimization Letters, vol.6, issue.4, pp.783-796, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00756941

L. Liberti, C. Lavor, N. Maculan, and A. Mucherino, Euclidean distance geometry and applications, SIAM Review, vol.56, pp.3-69, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01093056

L. Liberti, B. Masson, J. Lee, C. Lavor, and A. Mucherino, On the number of realizations of certain Henneberg graphs arising in protein conformation, Discrete Applied Mathematics, vol.165, pp.213-232, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01093060

L. Liberti, C. Lavor, and N. Maculan, A branch-and-prune algorithm for the molecular distance geometry problem, International Transactions in Operational Research, vol.15, issue.1, pp.1-17, 2008.

M. Macneil and M. Bodur, Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems, 2019.

C. Miller, A. Tucker, and R. Zemlin, Integer programming formulations and the travelling salesman problems, Journal of the ACM, vol.7, pp.326-329, 1960.

A. Mucherino, C. Lavor, and L. Liberti, The discretizable distance geometry problem, Optimization Letters, vol.6, pp.1671-1686, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00756943

A. Mucherino, On the Identification of Discretization Orders for Distance Geometry with Intervals, Lecture Notes in Computer Science, pp.231-238, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00912677

J. Omer and D. S. Gonçalves, An integer programming approach for the search of discretization orders in distance geometry problems. Optimization Letters, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01517061

J. Omer and T. Migot, Vertex ordering with optimal number of adjacent predecessors, Discrete Mathematics and Theoretical Computer Science, vol.22, issue.1, p.19, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02025298