{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:31:56Z","timestamp":1760441516793,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030044138"},{"type":"electronic","value":"9783030044145"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04414-5_7","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T13:20:45Z","timestamp":1545052845000},"page":"92-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Upward Planar Morphs"],"prefix":"10.1007","author":[{"given":"Giordano","family":"Da Lozzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Roselli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"key":"7_CR1","unstructured":"Aichholzer, O., et al.: Convexifying polygons without losing visibilities. In: 23rd Canadian Conference on Computational Geometry, CCCG 2011 (2011)"},{"issue":"2","key":"7_CR2","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)","journal-title":"SIAM J. Comput."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1137\/1.9781611973105.119","volume-title":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Soroush Alamdari","year":"2013","unstructured":"Alamdari, S., et al.: Morphing planar graph drawings with a polynomial number of steps. In: Khanna, S. (ed.) 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, pp. 1656\u20131667 (2013)"},{"key":"7_CR4","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":"7_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, vol. 34 of LIPIcs, pp. 126\u2013140. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"key":"7_CR6","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":"7_CR7","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). http:\/\/arxiv.org\/abs\/1411.6185"},{"issue":"4","key":"7_CR8","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":"7_CR9","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":"7_CR10","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":"7_CR11","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":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11618058_2","volume-title":"Graph Drawing","author":"T Biedl","year":"2006","unstructured":"Biedl, T., Lubiw, A., Spriggs, M.J.: Morphing planar graphs while preserving edge directions. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 13\u201324. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11618058_2"},{"issue":"5","key":"7_CR13","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":"5","key":"7_CR14","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":"7_CR15","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":"7_CR16","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":"7_CR17","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."},{"issue":"2","key":"7_CR18","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":"7_CR19","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 Alg. 8(3), 282\u2013295 (2010)","journal-title":"J. Discrete Alg."},{"issue":"4","key":"7_CR20","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":"7_CR21","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":"7_CR22","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990, pp. 138\u2013148. Society for Industrial and Applied Mathematics, Philadelphia (1990)"},{"issue":"2","key":"7_CR23","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."},{"issue":"3","key":"7_CR24","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. Theory Ser. B 34(3), 244\u2013257 (1983)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"7_CR25","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":"7_CR26","unstructured":"van Goethem, A., Verbeek, K.: Optimal morphs of planar orthogonal drawings. In: 34th International Symposium on Computational Geometry, SoCG 2018, Budapest, Hungary, 11\u201314 June 2018, pp. 42:1\u201342:14 (2018)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04414-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:53:03Z","timestamp":1710233583000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04414-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030044138","9783030044145"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04414-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dccg.upc.edu\/gd2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.25","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.92","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The book also contains 1 full invited paper and 1 contest report","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}