{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:52:00Z","timestamp":1780822320919,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540208310","type":"print"},{"value":"9783540245957","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24595-7_26","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:46:01Z","timestamp":1280393161000},"page":"283-294","source":"Crossref","is-referenced-by-count":4,"title":["Planar Embeddings of Graphs with Specified Edge Lengths"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Cabello","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Berger, B., Kleinberg, J., Leighton, T.: Reconstructing a three-dimensional model with arbitrary errors. In: Proc. 28th Annu. ACM Sympos. Theory Comput., May 1996, pp. 449\u2013458 (1996)","DOI":"10.1145\/237814.237993"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s004530010005","volume":"27","author":"C. Burnikel","year":"2000","unstructured":"Burnikel, C., Fleischer, R., Mehlhorn, K., Schirra, S.: A strong and easily computable separation bound for arithmetic expressions involving radicals. Algorithmica\u00a027(1), 87\u201399 (2000)","journal-title":"Algorithmica"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-44676-1_21","volume-title":"Algorithms - ESA 2001","author":"C. Burnikel","year":"2001","unstructured":"Burnikel, C., Funke, S., Mehlhorn, K., Schirra, S., Schmitt, S.: A separation bound for real algebraic expressions. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 254\u2013265. Springer, Heidelberg (2001)"},{"key":"26_CR4","volume-title":"Map Use and Analysis","author":"J. Campbell","year":"2001","unstructured":"Campbell, J.: Map Use and Analysis, 4th edn. McGraw-Hill, Boston (2001)","edition":"4"},{"key":"26_CR5","unstructured":"\u010capkun, S., Hamdi, M., Hubaux, J.: GPS-free positioning in mobile ad-hoc networks. In: Proceedings of the 34th Hawaii International Conference on System Sciences, January 2001, pp. 3481\u20133490 (2001)"},{"issue":"5","key":"26_CR6","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comput. Geom.\u00a06(5), 485\u2013524 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Connelly, R.: On generic global rigidity. In: Gritzman, P., Sturmfels, B. (eds.) Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a04, pp. 147\u2013155. AMS Press (1991)","DOI":"10.1090\/dimacs\/004\/11"},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1142\/S0218195992000202","volume":"2","author":"C. Coullard","year":"1992","unstructured":"Coullard, C., Lubiw, A.: Distance visibility graphs. Internat. J. Comput. Geom. Appl.\u00a02(4), 349\u2013362 (1992)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"26_CR9","volume-title":"Distance Geometry and Molecular Conformation","author":"G.M. Crippen","year":"1988","unstructured":"Crippen, G.M., Havel, T.F.: Distance Geometry and Molecular Conformation. John Wiley & Sons, Chichester (1988)"},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0925-7721(98)00039-X","volume":"11","author":"O. Devillers","year":"1998","unstructured":"Devillers, O., Liotta, G., Preparata, F.P., Tamassia, R.: Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom. Theory Appl.\u00a011, 187\u2013208 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"26_CR11","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"key":"26_CR12","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory, 2nd edn. Springer, New York (2000)","edition":"2"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0166-218X(90)90110-X","volume":"28","author":"P. Eades","year":"1990","unstructured":"Eades, P., Wormald, N.: Fixed edge length graph drawing is NP-hard. Discrete Appl. Math.\u00a028, 111\u2013134 (1990)","journal-title":"Discrete Appl. Math."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Everett, H., Ho\u00e0ng, C.T., Kilakos, K., Noy, M.: Distance segment visibility graphs (1999) (manuscript), http:\/\/www.loria.fr\/~everett\/publications\/distance.html","DOI":"10.1016\/S0925-7721(00)00009-2"},{"key":"26_CR15","volume-title":"Combinatorial Rigidity","author":"J. Graver","year":"1993","unstructured":"Graver, J., Servatius, B., Servatius, H.: Combinatorial Rigidity. American Mathematical Society, Providence (1993)"},{"issue":"1","key":"26_CR16","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 J. Comput.\u00a021(1), 65\u201384 (1992)","journal-title":"SIAM J. Comput."},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/0805040","volume":"5","author":"B. Hendrickson","year":"1995","unstructured":"Hendrickson, B.: The molecule problem: Exploiting structure in global optimization. SIAM J. on Optimization\u00a05, 835\u2013857 (1995)","journal-title":"SIAM J. on Optimization"},{"key":"26_CR18","unstructured":"Jackson, B., Jord\u00e1n, T.: Connected rigidity matroids and unique realizations of graphs (March 2003) (manuscript)"},{"issue":"3","key":"26_CR19","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/0405033","volume":"5","author":"D.E. Knuth","year":"1992","unstructured":"Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM J. on Discrete Mathematics\u00a05(3), 422\u2013427 (1992)","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"26_CR20","unstructured":"Li, C., Yap, C.: A new constructive root bound for algebraic expressions. In: Proc. 12th Annu. ACM\u2013SIAM Sympos. Discrete Algorithms, pp. 496\u2013505 (2001)"},{"issue":"2","key":"26_CR21","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput.\u00a011(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"key":"26_CR22","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial Geometry","author":"J. Pach","year":"1995","unstructured":"Pach, J., Agarwal, P.: Combinatorial Geometry. John Wiley & Sons, New York (1995)"},{"key":"26_CR23","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1990","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction, 3rd edn. Springer, Heidelberg (October 1990)","edition":"3"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"Priyantha, N.B., Chakraborty, A., Balakrishnan, H.: The Cricket locationsupport system. In: Proceedings of 6th Annual International Conference on Mobile Computing and Networking, Boston, MA, August 2000, pp. 32\u201343 (2000)","DOI":"10.1145\/345910.345917"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Savarese, C., Rabaey, J., Beutel, J.: Locationing in distributed ad-hoc wireless sensor networks. In: Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, Salt Lake City, UT, May 2001, pp. 2037\u20132040 (2001)","DOI":"10.1109\/ICASSP.2001.940391"},{"key":"26_CR26","unstructured":"Saxe, J.B.: Embeddability of weighted graphs in k-space is strongly NP-hard. In: Proc. 17th Allerton Conf. Commun. Control Comput., pp. 480\u2013489 (1979)"},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Yemini, Y.: Some theoretical aspects of position-location problems. In: Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci., pp. 1\u20138 (1979)","DOI":"10.1109\/SFCS.1979.39"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24595-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T15:29:26Z","timestamp":1740324566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24595-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208310","9783540245957"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24595-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}