{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:36:34Z","timestamp":1766378194733,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_5","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"57-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["How to Morph a Tree on a Small Grid"],"prefix":"10.1007","author":[{"given":"Fidel","family":"Barrera-Cruz","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Borrazzo","sequence":"additional","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","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1137\/16M1069171","volume":"46","author":"S Alamdari","year":"2017","unstructured":"Alamdari, S., et al.: How to morph planar graph drawings. SIAM J. Comput. 46(2), 824\u2013852 (2017). https:\/\/doi.org\/10.1137\/16M1069171","journal-title":"SIAM J. Comput."},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Alamdari, S., et al.: Morphing planar graph drawings with a polynomial number of steps. In: Khanna, S. (ed.) Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, 6\u20138 January 2013, pp. 1656\u20131667. SIAM (2013). https:\/\/doi.org\/10.1137\/1.9781611973105.119","DOI":"10.1137\/1.9781611973105.119"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-662-43948-7_11","volume-title":"Automata, Languages, and Programming","author":"P Angelini","year":"2014","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Morphing planar graph drawings optimally. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 126\u2013137. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_11"},{"key":"5_CR4","unstructured":"Angelini, P., Da Lozzo, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V.: Optimal morphs of convex drawings. In: Symposium on Computational Geometry. LIPIcs, vol. 34, pp. 126\u2013140. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"key":"5_CR5","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. 8242, pp. 49\u201360. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03841-4_5"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-662-45803-7_25","volume-title":"Graph Drawing","author":"F Barrera-Cruz","year":"2014","unstructured":"Barrera-Cruz, F., Haxell, P., Lubiw, A.: Morphing schnyder drawings of planar triangulations. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 294\u2013305. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_25"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"29:1","DOI":"10.1145\/2500118","volume":"9","author":"TC Biedl","year":"2013","unstructured":"Biedl, T.C., Lubiw, A., Petrick, M., Spriggs, M.J.: Morphing orthogonal planar graph drawings. ACM Trans. Algorithms 9(4), 29:1\u201329:24 (2013)","journal-title":"ACM Trans. Algorithms"},{"issue":"5","key":"5_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1080\/00029890.1944.11999082","volume":"51","author":"SS Cairns","year":"1944","unstructured":"Cairns, S.S.: Deformations of plane rectilinear complexes. Am. Math. Monthly 51(5), 247\u2013252 (1944)","journal-title":"Am. Math. Monthly"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.7155\/jgaa.00257","volume":"16","author":"EW Chambers","year":"2012","unstructured":"Chambers, E.W., Eppstein, D., Goodrich, M.T., L\u00f6ffler, M.: Drawing graphs in the plane with a prescribed outer face and polynomial area. J. Graph Algorithms Appl. 16(2), 243\u2013259 (2012). https:\/\/doi.org\/10.7155\/jgaa.00257","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-04414-5_7","volume-title":"Graph Drawing and Network Visualization","author":"G Da Lozzo","year":"2018","unstructured":"Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Upward planar morphs. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 92\u2013105. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_7"},{"key":"5_CR11","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Upper Saddle River (1999)"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"van Goethem, A., Verbeek, K.: Optimal morphs of planar orthogonal drawings. In: Speckmann, B., T\u00f3th, C.D. (eds.) 34th International Symposium on Computational Geometry, SoCG 2018, 11\u201314 June 2018, Budapest, Hungary. LIPIcs, vol. 99, pp. 42:1\u201342:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2018.42","DOI":"10.4230\/LIPIcs.SoCG.2018.42"},{"issue":"3","key":"5_CR13","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. Combin. Theory Ser. B 34(3), 244\u2013257 (1983)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:52:50Z","timestamp":1710265970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}