{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T03:25:12Z","timestamp":1768620312997,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662439470","type":"print"},{"value":"9783662439487","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_11","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"126-137","source":"Crossref","is-referenced-by-count":11,"title":["Morphing Planar Graph Drawings Optimally"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[]},{"given":"Vincenzo","family":"Roselli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Alamdari, S., Angelini, P., Chan, T.M., Di Battista, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V., Singla, S., Wilkinson, B.T.: Morphing planar graph drawings with a polynomial number of steps. In: Khanna, S. (ed.) SODA 2013, pp. 1656\u20131667. SIAM (2013)","DOI":"10.1137\/1.9781611973105.119"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Morphing planar graph drawings optimally. CoRR abs\/1402.4364 (2014)","DOI":"10.1007\/978-3-662-43948-7_11"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-03841-4_5","volume-title":"Graph Drawing","author":"P. Angelini","year":"2013","unstructured":"Angelini, P., Frati, F., Patrignani, M., Roselli, V.: Morphing planar graph drawings efficiently. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 49\u201360. Springer, Heidelberg (2013)"},{"key":"11_CR4","unstructured":"Barrera-Cruz, F., Haxell, P., Lubiw, A.: Morphing planar graph drawings with unidirectional moves. In: Mexican Conference on Discr. Math. and Comput. Geom. (2013)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.2307\/2304300","volume":"51","author":"S.S. Cairns","year":"1944","unstructured":"Cairns, S.S.: Deformations of plane rectilinear complexes. American Math. Monthly\u00a051, 247\u2013252 (1944)","journal-title":"American Math. Monthly"},{"key":"11_CR6","first-page":"153","volume-title":"Progress in Graph Theory","author":"N. Chiba","year":"1984","unstructured":"Chiba, N., Yamanouchi, T., Nishizeki, T.: Linear algorithms for convex drawings of planar graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Progress in Graph Theory, pp. 153\u2013173. Academic Press, New York (1984)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-24595-7_30","volume-title":"Graph Drawing","author":"C. Erten","year":"2004","unstructured":"Erten, C., Kobourov, S.G., Pitta, C.: Intersection-free morphing of planar graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 320\u2013331. Springer, Heidelberg (2004)"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.7155\/jgaa.00057","volume":"6","author":"C. Friedrich","year":"2002","unstructured":"Friedrich, C., Eades, P.: Graph drawing in motion. J. Graph Alg. Appl.\u00a06(3), 353\u2013370 (2002)","journal-title":"J. Graph Alg. Appl."},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0097-8493(00)00108-4","volume":"25","author":"C. Gotsman","year":"2001","unstructured":"Gotsman, C., Surazhsky, V.: Guaranteed intersection-free polygon morphing. Computers & Graphics\u00a025(1), 67\u201375 (2001)","journal-title":"Computers & Graphics"},{"key":"11_CR10","unstructured":"Grunbaum, B., Shephard, G.: The geometry of planar graphs. Camb. Univ. Pr. (1981)"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.jda.2009.05.003","volume":"8","author":"S.H. Hong","year":"2010","unstructured":"Hong, S.H., Nagamochi, H.: Convex drawings of hierarchical planar graphs and clustered planar graphs. J. Discrete Algorithms\u00a08(3), 282\u2013295 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/502783.502784","volume":"20","author":"V. Surazhsky","year":"2001","unstructured":"Surazhsky, V., Gotsman, C.: Controllable morphing of compatible planar triangulations. ACM Trans. Graph\u00a020(4), 203\u2013231 (2001)","journal-title":"ACM Trans. Graph"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1142\/S0218654303000115","volume":"9","author":"V. Surazhsky","year":"2003","unstructured":"Surazhsky, V., Gotsman, C.: Intrinsic morphing of compatible triangulations. Internat. J. of Shape Model.\u00a09, 191\u2013201 (2003)","journal-title":"Internat. J. of Shape Model."},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0095-8956(83)90038-2","volume":"34","author":"C. Thomassen","year":"1983","unstructured":"Thomassen, C.: Deformations of plane graphs. J. Comb. Th. Ser. B\u00a034(3), 244\u2013257 (1983)","journal-title":"J. Comb. Th. Ser. B"},{"key":"11_CR15","first-page":"43","volume-title":"Progress in Graph Theory","author":"C. Thomassen","year":"1984","unstructured":"Thomassen, C.: Plane representations of graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Progress in Graph Theory, pp. 43\u201369. Academic Press, New York (1984)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:22:14Z","timestamp":1558923734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}