{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T13:36:06Z","timestamp":1649079366101},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T00:00:00Z","timestamp":1432771200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s00454-015-9704-z","type":"journal-article","created":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T13:31:14Z","timestamp":1432733474000},"page":"259-289","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Free Edge Lengths in Plane Graphs"],"prefix":"10.1007","volume":"54","author":[{"given":"Zachary","family":"Abel","sequence":"first","affiliation":[]},{"given":"Robert","family":"Connelly","sequence":"additional","affiliation":[]},{"given":"Sarah","family":"Eisenstat","sequence":"additional","affiliation":[]},{"given":"Radoslav","family":"Fulek","sequence":"additional","affiliation":[]},{"given":"Filip","family":"Mori\u0107","sequence":"additional","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Tibor","family":"Szab\u00f3","sequence":"additional","affiliation":[]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,28]]},"reference":[{"key":"9704_CR1","doi-asserted-by":"crossref","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Morphing planar graph drawings optimally. In: Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP), Part I. Lecture Notes in Computer Science 8572, pp. 126\u2013137. Springer, New York (2014)","DOI":"10.1007\/978-3-662-43948-7_11"},{"key":"9704_CR2","doi-asserted-by":"crossref","unstructured":"Angelini, P., Di Battista, G., Frati, F., Jel\u00ednek, V., Kratochv\u00edl, J., Patrignani, M., Rutter, I.: Testing planarity of partially embedded graphs. ACM Transactions on Algorithms 11(4), Art No. 32 (2015)","DOI":"10.1145\/2629341"},{"issue":"1","key":"9704_CR3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.7155\/jgaa.00145","volume":"11","author":"S Cabello","year":"2007","unstructured":"Cabello, S., Demaine, E.D., Rote, G.: Planar embeddings of graphs with specified edge lengths. J. Graph Algorithms Appl. 11(1), 259\u2013276 (2007)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"9704_CR4","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s00454-004-1124-4","volume":"33","author":"R Connelly","year":"2005","unstructured":"Connelly, R.: Generic global rigidity. Discrete Comput. Geom. 33(4), 549\u2013563 (2005)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"9704_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s00454-003-0006-7","volume":"30","author":"R Connelly","year":"2003","unstructured":"Connelly, R., Demaine, E.D., Rote, G.: Straightening polygonal arcs and convexifying polygonal cycles. Discrete Comput. Geom. 30(2), 205\u2013239 (2003)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"9704_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"3","key":"9704_CR7","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/S0895480194264010","volume":"9","author":"G Battista Di","year":"1996","unstructured":"Di Battista, G., Vismara, L.: Angles of planar triangular graphs. SIAM J. Discrete Math. 9(3), 349\u2013359 (1996)","journal-title":"SIAM J. Discrete Math."},{"key":"9704_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0166-218X(90)90110-X","volume":"28","author":"P Eades","year":"1990","unstructured":"Eades, P., Wormald, N.C.: Fixed edge-length graph drawing is NP-hard. Discrete Appl. Math. 28, 111\u2013134 (1990)","journal-title":"Discrete Appl. Math."},{"key":"9704_CR9","first-page":"229","volume":"11","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight line representation of plane graphs. Acta. Sci. Math. Szeged 11, 229\u2013233 (1948)","journal-title":"Acta. Sci. Math. Szeged"},{"key":"9704_CR10","doi-asserted-by":"crossref","unstructured":"Frati, F., Patrignani, M.: A note on minimum-area straight-line drawings of planar graphs. In: 15th Graph Drawing. Lecture Notes in Computer Science 4875, pp. 339\u2013344. Springer, New York (2008)","DOI":"10.1007\/978-3-540-77537-9_33"},{"key":"9704_CR11","doi-asserted-by":"crossref","first-page":"2368","DOI":"10.1016\/j.dam.2007.10.012","volume":"156","author":"S-H Hong","year":"2008","unstructured":"Hong, S.-H., Nagamochi, H.: Convex drawings of graphs with non-convex boundary constraints. Discrete Appl. Math. 156, 2368\u20132380 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9704_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2004.11.002","volume":"94","author":"B Jackson","year":"2005","unstructured":"Jackson, B., Jord\u00e1n, T.: Connected rigidity matroids and unique realizations of graphs. J. Comb. Theory Ser. B 94(1), 1\u201329 (2005)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"9704_CR13","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/j.comgeo.2012.07.005","volume":"46","author":"V Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Kratochv\u00edl, J., Rutter, I.: A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom. Theory Appl. 46(4), 466\u2013492 (2013)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9704_CR14","doi-asserted-by":"crossref","unstructured":"Kurowski, M.: Planar straight-line drawing in an $$O(n)\\times O(n)$$ O ( n ) \u00d7 O ( n ) grid with angular resolution $$\\Omega (1\/n)$$ \u03a9 ( 1 \/ n ) . In: Proceedings of the 31st Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM). Lecture Notes in Computer Science 3381, pp. 250\u2013258. Springer, New York (2005)","DOI":"10.1007\/978-3-540-30577-4_28"},{"key":"9704_CR15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02574031","volume":"13","author":"WJ Lenhart","year":"1995","unstructured":"Lenhart, W.J., Whitesides, S.H.: Reconfiguring closed polygonal chains in euclidean $$d$$ d -space. Discrete Comput. Geom. 13, 123\u2013140 (1995)","journal-title":"Discrete Comput. Geom."},{"issue":"5","key":"9704_CR16","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1142\/S0129054106004261","volume":"17","author":"M Patrignani","year":"2006","unstructured":"Patrignani, M.: On extending a partial straight-line drawing. Found. Comput. Sci. 17(5), 1061\u20131069 (2006)","journal-title":"Found. Comput. Sci."},{"key":"9704_CR17","doi-asserted-by":"crossref","first-page":"222","DOI":"10.4153\/CJM-2012-022-4","volume":"65","author":"NW Sauer","year":"2013","unstructured":"Sauer, N.W.: Distance sets of Urysohn metric spaces. Can. J. Math. 65, 222\u2013240 (2013)","journal-title":"Can. J. Math."},{"key":"9704_CR18","unstructured":"Sauer, N.W.: Edge labelled graphs and metric spaces. In: Abstracts of the Erd\u0151s Centennial, p. 78. Budapest (2013)"},{"key":"9704_CR19","unstructured":"Schnyder, W.: Embedding planar graphs in the grid. In: Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms, pp. 138\u2013147. ACM, San Francisco (1990)"},{"issue":"1","key":"9704_CR20","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"3\u201313","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. Lond. Math. Soc. 3\u201313(1), 743\u2013767 (1963)","journal-title":"Proc. Lond. Math. Soc."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-015-9704-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-015-9704-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-015-9704-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T13:22:12Z","timestamp":1566739332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-015-9704-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,28]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9704"],"URL":"https:\/\/doi.org\/10.1007\/s00454-015-9704-z","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,28]]}}}