1. J. Aspnes, T. Eren, D. K. Goldenberg, A. S. Morse, W. Whiteley, Y. R. Yang, B. D. O. Anderson and P. N. Belhumeur, A theory of network localization, IEEE Trans, on Mobile Computing, vol. 5, issue 12 (2006), pp. 1663–1678.
2. G. Baudis, C. Gröp l, S. Hougardy, T. Nierhoff and H. J. Prömel, Approximating minimum spanning sets in hypergraphs and polymatroids, Tech. Report, Humboldt-Universität zu Berlin, 2000.
3. A. R. Berg and T. Jordan, A proof of Connelly’s conjecture on 3-connected circuits of the rigidity matroid, J. Combinatorial Theory, Ser. B., Vol. 88 (2003), 77–97.
4. A. R. Berg and T. Jordán, Algorithms for graph rigidity and scene analysis, Proc. 11th Annual European Symposium on Algorithms (ESA), 2003, (G. Di Battista, U. Zwick, eds.), Springer Lecture Notes in Computer Science 2832 (2003), pp. 78–89.
5. R. Connelly, On generic global rigidity, Applied geometry and discrete mathematics, 147–155, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 4, Amer. Math. Soc, Providence, RI (1991).