{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T02:58:57Z","timestamp":1767841137714,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T00:00:00Z","timestamp":1589414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T00:00:00Z","timestamp":1589414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["20157EFM5C-PE6"],"award-info":[{"award-number":["20157EFM5C-PE6"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["34120"],"award-info":[{"award-number":["34120"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["20174LF3T8"],"award-info":[{"award-number":["20174LF3T8"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"crossref","award":["734922"],"award-info":[{"award-number":["734922"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s00453-020-00714-6","type":"journal-article","created":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T02:02:14Z","timestamp":1589421734000},"page":"2985-3017","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Upward Planar Morphs"],"prefix":"10.1007","volume":"82","author":[{"given":"Giordano","family":"Da Lozzo","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5987-8713","authenticated-orcid":false,"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":[[2020,5,14]]},"reference":[{"key":"714_CR1","unstructured":"Aichholzer, O., Aloupis, G., Demaine, E.D., Demaine, M.L., Dujmovic, V., Hurtado, F., Lubiw, A., Rote, G., Schulz, A., Souvaine, D.L., Winslow, A.: Convexifying polygons without losing visibilities. In: 23rd Canadian Conference on Computational Geometry (CCCG \u201911) (2011)"},{"issue":"2","key":"714_CR2","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1137\/16M1069171","volume":"46","author":"S Alamdari","year":"2017","unstructured":"Alamdari, S., Angelini, P., Barrera-Cruz, F., Chan, T.M., Da Lozzo, G., Di Battista, G., Frati, F., Haxell, P., Lubiw, A., Patrignani, M., Roselli, V., Singla, S., Wilkinson, B.T.: How to morph planar graph drawings. SIAM J. Comput. 46(2), 824\u2013852 (2017)","journal-title":"SIAM J. Comput."},{"key":"714_CR3","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.) 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201913), pp. 1656\u20131667 (2013)","DOI":"10.1137\/1.9781611973105.119"},{"key":"714_CR4","first-page":"126","volume-title":"41st InternationalColloquium on Automata, Languages and Programming (ICALP \u201914), volume of 8572 Lecture Notes in Computer Science","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.) 41st International Colloquium on Automata, Languages and Programming (ICALP \u201914), volume of 8572 Lecture Notes in Computer Science, pp. 126\u2013137. Springer, Berlin (2014)"},{"key":"714_CR5","unstructured":"Angelini, P., Da Lozzo, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V.: Optimal morphs of convex drawings. In: Symposium on Computational Geometry, volume\u00a034 of LIPIcs, pp. 126\u2013140. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)"},{"key":"714_CR6","doi-asserted-by":"crossref","unstructured":"Angelini, P., Frati, F., Patrignani, M., Roselli, V.: Morphing planar graph drawings efficiently. In: Wismath, S., Wolff, A. (eds.) Proceedings of 21st International Symposium on Graph Drawing (GD \u201913), Lecture Notes in Computer Science. Springer (2013)","DOI":"10.1007\/978-3-319-03841-4_5"},{"key":"714_CR7","doi-asserted-by":"crossref","unstructured":"Barrera-Cruz, F., Borrazzo, M., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: How to morph a tree on a small grid. In: Friggstad, Z., Sack, J., Salavatipour, M.R. (eds.) Algorithms and Data Structures: 16th International Symposium, WADS 2019, Edmonton, AB, Canada, 5\u20137 August 2019, Proceedings, volume 11646 of Lecture Notes in Computer Science, pp. 57\u201370. Springer, Berlin (2019)","DOI":"10.1007\/978-3-030-24766-9_5"},{"key":"714_CR8","unstructured":"Barrera-Cruz, F., Haxell, P., Lubiw, A.: Morphing planar graph drawings with unidirectional moves. In: Mexican Conference on Discrete Mathematics and Computational Geometry, pp. 57\u201365 (2013). arXiv:1411.6185"},{"issue":"4","key":"714_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1142\/S0218195994000215","volume":"4","author":"P Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Cohen, R.F., Di Battista, G., Tamassia, R., Tollis, I.G.: How to draw a series-parallel digraph. Int. J. Comput. Geom. Appl. 4(4), 385\u2013402 (1994)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"6","key":"714_CR10","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/BF01188716","volume":"12","author":"P Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 12(6), 476\u2013497 (1994)","journal-title":"Algorithmica"},{"issue":"1","key":"714_CR11","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27(1), 132\u2013169 (1998)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"714_CR12","first-page":"29","volume":"9","author":"T Biedl","year":"2013","unstructured":"Biedl, T., Lubiw, A., Petrick, M., Spriggs, M.: Morphing orthogonal planar graph drawings. ACM Trans. Algorithms (TALG) 9(4), 29 (2013)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"714_CR13","doi-asserted-by":"crossref","unstructured":"Biedl, T.C., Lubiw, A., Spriggs, M.J.: Morphing planar graphs while preserving edge directions. In: Healy, P., Nikolov, N.S. (eds.) 13th International Symposium on Graph Drawing (GD \u201905), volume 3843 of Lecture Notes in Computer Science, pp. 13\u201324. Springer (2006)","DOI":"10.1007\/11618058_2"},{"issue":"5","key":"714_CR14","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. Mon. 51(5), 247\u2013252 (1944)","journal-title":"Am. Math. Mon."},{"issue":"5","key":"714_CR15","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539792235724","volume":"24","author":"RF Cohen","year":"1995","unstructured":"Cohen, R.F., Di Battista, G., Tamassia, R., Tollis, I.G.: Dynamic graph drawings: trees, series-parallel digraphs, and planar ST-digraphs. SIAM J. Comput. 24(5), 970\u20131001 (1995)","journal-title":"SIAM J. Comput."},{"key":"714_CR16","doi-asserted-by":"crossref","unstructured":"Da Lozzo, G., Di Battista, G., Frati, F.: Extending upward planar graph drawings. In: WADS, volume 11646 of Lecture Notes in Computer Science, pp. 339\u2013352. Springer (2019)","DOI":"10.1007\/978-3-030-24766-9_25"},{"key":"714_CR17","doi-asserted-by":"crossref","unstructured":"Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Upward planar morphs. In: Biedl, T., Kerren, A. (eds.) 26th International Symposium on Graph Drawing and Network Visualization (GD \u201918), Lecture Notes in Computer Science. Springer (2018) (to appear)","DOI":"10.1007\/978-3-030-04414-5_7"},{"key":"714_CR18","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":"714_CR19","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61, 175\u2013198 (1988)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"714_CR20","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G Di Battista","year":"1992","unstructured":"Di Battista, G., Tamassia, R., Tollis, I.G.: Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geom. 7(4), 381\u2013401 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"714_CR21","first-page":"229","volume":"11","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight-line representation of planar graphs. Acta Scientiarum Mathematicarum (Szeged) 11, 229\u2013233 (1948)","journal-title":"Acta Scientiarum Mathematicarum (Szeged)"},{"key":"714_CR22","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tcs.2014.04.024","volume":"544","author":"F Frati","year":"2014","unstructured":"Frati, F., Gudmundsson, J., Welzl, E.: On the number of upward planar orientations of maximal planar graphs. Theor. Comput. Sci. 544, 32\u201359 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"714_CR23","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A Garg","year":"2002","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601\u2013625 (2002)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"714_CR24","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.jda.2009.05.003","volume":"8","author":"S Hong","year":"2010","unstructured":"Hong, S., Nagamochi, H.: Convex drawings of hierarchical planar graphs and clustered planar graphs. J. Discrete Algorithms 8(3), 282\u2013295 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"714_CR25","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"714_CR26","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.comgeo.2019.07.007","volume":"84","author":"L Kleist","year":"2019","unstructured":"Kleist, L., Klemz, B., Lubiw, A., Schlipf, L., Staals, F., Strash, D.: Convexity-increasing morphs of planar graphs. Comput. Geom. 84, 69\u201388 (2019)","journal-title":"Comput. Geom."},{"key":"714_CR27","volume-title":"Data Structures and Algorithms: Multi-dimensional Searching and Computational Geometry","author":"K Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms: Multi-dimensional Searching and Computational Geometry, vol. 3. Springer, Berlin (1984)"},{"key":"714_CR28","unstructured":"Roselli, V.: Morphing and visiting drawings of graphs. Ph.D. thesis, Universit\u00e0 degli Studi di Roma \u201cRoma Tre\u201d, Dottorato di Ricerca in Ingegneria, Sezione Informatica ed Automazione, XXVI Ciclo (2014)"},{"key":"714_CR29","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom. 1, 343\u2013353 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"714_CR30","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201990, pp. 138\u2013148, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics (1990)"},{"issue":"2","key":"714_CR31","doi-asserted-by":"publisher","first-page":"137","DOI":"10.2307\/1967770","volume":"19","author":"HL Smith","year":"1917","unstructured":"Smith, H.L.: On continuous representations of a square upon itself. Ann. Math. 19(2), 137\u2013141 (1917)","journal-title":"Ann. Math."},{"key":"714_CR32","doi-asserted-by":"crossref","unstructured":"Tamassia, R., Tollis, I.G.: Algorithms for visibility representations of planar graphs. In: Monien, B., Vidal-Naquet, G. (eds.) STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, 16\u201318 January 1986, Proceedings, volume 210 of Lecture Notes in Computer Science, pp. 130\u2013141. Springer (1986)","DOI":"10.1007\/3-540-16078-7_71"},{"key":"714_CR33","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discrete Comput. Geom. 1, 321\u2013341 (1986)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"714_CR34","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"},{"issue":"1","key":"714_CR35","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF03015194","volume":"38","author":"H Tietze","year":"1914","unstructured":"Tietze, H.: \u00dcber stetige abbildungen einer quadratfl\u00e4che auf sich selbst. Rendiconti del Circolo Matematico di Palermo 38(1), 247\u2013304 (1914)","journal-title":"Rendiconti del Circolo Matematico di Palermo"},{"key":"714_CR36","unstructured":"van Goethem, A., Verbeek, K.: Optimal morphs of planar orthogonal drawings. In: 34th International Symposium on Computational Geometry, SoCG 2018, 11\u201314 June 2018, Budapest, Hungary, pp. 42:1\u201342:14 (2018)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00714-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00714-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00714-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T18:02:06Z","timestamp":1666548126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00714-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,14]]},"references-count":36,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["714"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00714-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,14]]},"assertion":[{"value":"25 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}