1. Euclidean distance geometry and applications;Liberti;SIAM Rev.,2014
2. Distance Geometry: Theory, Methods and Applications,2013
3. J. Saxe, Embeddability of weighted graphs in k-space is strongly NP-hard, in: Proceedings of 17th Allerton Conference in Communications, Control and Computing, 1979, pp. 480–489.
4. On the recognition of unit disk graphs and the distance geometry problem with ranges;da Fonseca;Discrete Appl. Math.,2015
5. An alternative approach to distance geometry using L∞ distances;Crippen;Discrete Appl. Math.,2015