{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T10:18:05Z","timestamp":1773051485829,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642400193","type":"print"},{"value":"9783642400209","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40020-9_23","type":"book-chapter","created":{"date-parts":[[2013,8,19]],"date-time":"2013-08-19T01:32:37Z","timestamp":1376875957000},"page":"224-230","source":"Crossref","is-referenced-by-count":16,"title":["Counting the Number of Solutions of KDMDGP Instances"],"prefix":"10.1007","author":[{"given":"Leo","family":"Liberti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlile","family":"Lavor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Alencar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germano","family":"Abud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/301970.301972","volume":"46","author":"B. Berger","year":"1999","unstructured":"Berger, B., Kleinberg, J., Leighton, T.: Reconstructing a three-dimensional model with arbitrary errors. Journal of the ACM\u00a046(2), 212\u2013235 (1999)","journal-title":"Journal of the ACM"},{"key":"23_CR2","first-page":"461","volume":"42","author":"I. Coope","year":"2000","unstructured":"Coope, I.: Reliable computation of the points of intersection of n spheres in \u211d\n                    n\n                  . Australian and New Zealand Industrial and Applied Mathematics Journal\u00a042, 461\u2013477 (2000)","journal-title":"Australian and New Zealand Industrial and Applied Mathematics Journal"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1023\/A:1013857218127","volume":"22","author":"Q. Dong","year":"2002","unstructured":"Dong, Q., Wu, Z.: A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances. Journal of Global Optimization\u00a022, 365\u2013375 (2002)","journal-title":"Journal of Global Optimization"},{"key":"23_CR4","unstructured":"Eren, T., Goldenberg, D., Whiteley, W., Yang, Y., Morse, A., Anderson, B., Belhumeur, P.: Rigidity, computation, and randomization in network localization. In: IEEE Infocom Proceedings, pp. 2673\u20132684 (2004)"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/0404032","volume":"4","author":"J. Graver","year":"1991","unstructured":"Graver, J.: Rigidity matroids. SIAM Journal on Discrete Mathematics\u00a04, 355\u2013368 (1991)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Graver, J., Servatius, B., Servatius, H.: Combinatorial Rigidity. American Mathematical Society (1993)","DOI":"10.1090\/gsm\/002"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/0221008","volume":"21","author":"B. Hendrickson","year":"1992","unstructured":"Hendrickson, B.: Conditions for unique graph realizations. SIAM Journal on Computing\u00a021(1), 65\u201384 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s11590-011-0302-6","volume":"6","author":"C. Lavor","year":"2012","unstructured":"Lavor, C., Lee, J., John, A.L.S., Liberti, L., Mucherino, A., Sviridenko, M.: Discretization orders for distance geometry problems. Optimization Letters\u00a06, 783\u2013796 (2012)","journal-title":"Optimization Letters"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589-011-9402-6","volume":"52","author":"C. Lavor","year":"2012","unstructured":"Lavor, C., Liberti, L., Maculan, N., Mucherino, A.: The discretizable molecular distance geometry problem. Computational Optimization and Applications\u00a052, 115\u2013146 (2012)","journal-title":"Computational Optimization and Applications"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1016\/j.ejor.2011.11.007","volume":"219","author":"C. Lavor","year":"2012","unstructured":"Lavor, C., Liberti, L., Maculan, N., Mucherino, A.: Recent advances on the discretizable molecular distance geometry problem. European Journal of Operational Research\u00a0219, 698\u2013706 (2012)","journal-title":"European Journal of Operational Research"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2007.00622.x","volume":"15","author":"L. Liberti","year":"2008","unstructured":"Liberti, L., Lavor, C., Maculan, N.: A branch-and-prune algorithm for the molecular distance geometry problem. International Transactions in Operational Research\u00a015, 1\u201317 (2008)","journal-title":"International Transactions in Operational Research"},{"key":"23_CR12","volume-title":"Distance Geometry: Theory, Methods, and Applications","author":"L. Liberti","year":"2013","unstructured":"Liberti, L., Lavor, C., Mucherino, A.: The discretizable molecular distance geometry problem is easier on proteins. In: Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Distance Geometry: Theory, Methods, and Applications. Springer, New York (2013)"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1111\/j.1475-3995.2009.00757.x","volume":"18","author":"L. Liberti","year":"2010","unstructured":"Liberti, L., Lavor, C., Mucherino, A., Maculan, N.: Molecular distance geometry methods: from continuous to discrete. International Transactions in Operational Research\u00a018, 33\u201351 (2010)","journal-title":"International Transactions in Operational Research"},{"key":"23_CR14","unstructured":"Liberti, L., Masson, B., Lavor, C., Lee, J., Mucherino, A.: On the number of realizations of certain Henneberg graphs arising in protein conformation. Discrete Applied Mathematics (accepted)"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10107-006-0040-1","volume":"109","author":"A. Man-Cho So","year":"2007","unstructured":"Man-Cho So, A., Ye, Y.: Theory of semidefinite programming for sensor network localization. Mathematical Programming B\u00a0109, 367\u2013384 (2007)","journal-title":"Mathematical Programming B"},{"issue":"2","key":"23_CR16","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10107-008-0253-6","volume":"122","author":"J. Nie","year":"2010","unstructured":"Nie, J., Ranestad, K., Sturmfels, B.: The algebraic degree of semidefinite programming. Mathematical Programming A\u00a0122(2), 379\u2013405 (2010)","journal-title":"Mathematical Programming A"},{"key":"23_CR17","unstructured":"Ranestad, K., Sturmfels, B.: Personal Communication (2013)"},{"key":"23_CR18","unstructured":"Saxe, J.: Embeddability of weighted graphs in k-space is strongly NP-hard. In: Proceedings of 17th Allerton Conference in Communications, Control and Computing, pp. 480\u2013489 (1979)"},{"key":"23_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-22464-0","volume-title":"Molecular modelling and simulation: an interdisciplinary guide","author":"T. Schlick","year":"2002","unstructured":"Schlick, T.: Molecular modelling and simulation: an interdisciplinary guide. Springer, New York (2002)"},{"key":"23_CR20","first-page":"21","volume":"11","author":"T.S. Tay","year":"1985","unstructured":"Tay, T.S., Whiteley, W.: Generating isostatic frameworks. Structural Topology\u00a011, 21\u201369 (1985)","journal-title":"Structural Topology"}],"container-title":["Lecture Notes in Computer Science","Geometric Science of Information"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40020-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T18:20:07Z","timestamp":1558030807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40020-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400193","9783642400209"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40020-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}