{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:26:48Z","timestamp":1743006408134,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319394404"},{"type":"electronic","value":"9783319394411"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39441-1_25","type":"book-chapter","created":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T07:47:40Z","timestamp":1464767260000},"page":"277-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Distance Geometry Problem with Inexact Distances in Integer Plane"],"prefix":"10.1007","author":[{"given":"Piyush K.","family":"Bhunre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Partha","family":"Bhowmick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayanta","family":"Mukhopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,2]]},"reference":[{"key":"25_CR1","unstructured":"http:\/\/www.graphdrawing.org\/ . Accessed 27 Sept 2015"},{"key":"25_CR2","volume-title":"Theory and Application of Distance Geometry","author":"LM Blumenthal","year":"1953","unstructured":"Blumenthal, L.M.: Theory and Application of Distance Geometry. Oxford University Press, Oxford (1953)"},{"key":"25_CR3","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/978-3-642-00219-9_21","volume-title":"Graph Drawing","author":"Ulrik Brandes","year":"2009","unstructured":"Brandes, U., Pich, C.: An experimental study on distance-based graph drawing. In: GD 2008, Revised Papers, pp. 218\u2013229 (2008)"},{"key":"25_CR4","unstructured":"Bulusu, N., Estrin, D., Heidemann, J.: Scalable coordination for wireless sensor networks self-configuring localization systems. In: Proceedings of the ISCTA (2001)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, L., Wu, C., Zhang, Y., Wu, H., Li, M., Maple, C.: A survey of localization in wireless sensor network. Int. J. Distrib. Sens. Netw., 324\u2013357 (2012)","DOI":"10.1155\/2012\/962523"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/11618058_48","volume-title":"Graph Drawing","author":"A Civril","year":"2006","unstructured":"Civril, A., Magdon-Ismail, M., Bocek-Rivele, E.: SDE: graph drawing using spectral distance embedding. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 512\u2013513. Springer, Heidelberg (2006)"},{"key":"25_CR7","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 distance. J. Global Optim. 22, 365\u2013375 (2002)","journal-title":"J. Global Optim."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1023221624213","volume":"26","author":"Q Dong","year":"2003","unstructured":"Dong, Q., Wu, Z.: A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data. J. Global Optim. 26, 321\u2013333 (2003)","journal-title":"J. Global Optim."},{"issue":"3\u20134","key":"25_CR9","first-page":"324","volume":"12","author":"H Gibson","year":"2012","unstructured":"Gibson, H., Faith, J., Vickers, P.: A survey of two-dimensional graph layout techniques for information visualization. Inf. Vis. 12(3\u20134), 324\u2013357 (2012)","journal-title":"Inf. Vis."},{"key":"25_CR10","volume-title":"Digital Geometry: Geometric Methods for Digital Picture Analysis","author":"R Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Lavor, C., Liberti, L., Maculan, N., Mucherino, A.: Recent advances on the discretizable molecular distance geometry problem. Computational Optimization and Applications (2012)","DOI":"10.1007\/978-1-4614-5128-0_3"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1007\/s10898-011-9799-6","volume":"56","author":"C Lavor","year":"2013","unstructured":"Lavor, C., Liberti, L., Mucherino, A.: The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances. J. Global Optim. 56, 855\u2013871 (2013)","journal-title":"J. Global Optim."},{"key":"25_CR13","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. Intl. Trans. Oper. Res. 15, 1\u201317 (2008)","journal-title":"Intl. Trans. Oper. Res."},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/120875909","volume":"56","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Lavor, C., Mucherino, A.: Euclidean distance geometry and applications. SIAM Rev. 56, 3\u201369 (2014)","journal-title":"SIAM Rev."},{"key":"25_CR15","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. Intl. Trans. Oper. Res. 18, 33\u201351 (2010)","journal-title":"Intl. Trans. Oper. Res."},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Mor$$\\acute{e}$$, J.J., Wu, Z.: Distance geometry optimization for protein structures. J. Global Optim. 15, 219\u2013234 (1999)","DOI":"10.1023\/A:1008380219900"},{"key":"25_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5128-0","volume-title":"Distance Geometry: Theory, Methods, and Applications","author":"A Mucherino","year":"2013","unstructured":"Mucherino, A., Lavor, C., Liberti, L., Maculan, N.: Distance Geometry: Theory, Methods, and Applications, 1st edn. Springer, New York (2013)","edition":"1"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Savvides, A., Han, C.C., Strivastava, M.B.: Dynamic fine-grained localization in ad-hoc networks of sensors. In: Proceedings of the MobiCom 2001, pp. 166\u2013179 (2001)","DOI":"10.1145\/381677.381693"},{"key":"25_CR19","unstructured":"Saxe, J.B.: Embeddability of weighted graphs in k-space is strongly NP-hard. In: Proceedings of the 17th Allerton Conference in Communications, Control & Computing, pp. 480\u2013489 (1979)"},{"key":"25_CR20","unstructured":"Sit, A.: Solving distance geometry problems for protein structure determination. P.h.D thesis, Iowa State University (2010)"}],"container-title":["Lecture Notes in Computer Science","Computational Topology in Image Context"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39441-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T22:43:23Z","timestamp":1656629003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39441-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319394404","9783319394411"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39441-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"2 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}