{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:35:14Z","timestamp":1743046514724,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030358013"},{"type":"electronic","value":"9783030358020"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_3","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"33-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Morphs of Planar Orthogonal Drawings II"],"prefix":"10.1007","author":[{"given":"Arthur","family":"van Goethem","sequence":"first","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Verbeek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"issue":"2","key":"3_CR1","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., Da Lozzo, G., Di Battista, G., Frati, F., Haxell, P., Lubiw, A., Patrignani, M., Roselli, V., Singla, S., Wilkinson, B.: How to morph planar graph drawings. SIAM J. Comput. 46(2), 824\u2013852 (2017)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s00454-015-9716-8","volume":"54","author":"G Aloupis","year":"2015","unstructured":"Aloupis, G., Barba, L., Carmi, P., Dujmovi\u0107, V., Frati, F., Morin, P.: Compatible connectivity augmentation of planar disconnected graphs. Discrete Comput. Geom. 54(2), 459\u2013480 (2015)","journal-title":"Discrete Comput. Geom."},{"key":"3_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. 8242, pp. 49\u201360. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03841-4_5"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Biedl, T., Lubiw, A., Petrick, M., Spriggs, M.J.: Morphing orthogonal planar graph drawings. ACM Trans. Algorithms 9(4), 29:1\u201329:24 (2013)","DOI":"10.1145\/2500118"},{"key":"3_CR5","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"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.comgeo.2016.03.001","volume":"55","author":"T Bl\u00e4sius","year":"2016","unstructured":"Bl\u00e4sius, T., Lehmann, S., Rutter, I.: Orthogonal graph drawing with inflexible edges. Comput. Geom. 55, 26\u201340 (2016)","journal-title":"Comput. Geom."},{"issue":"5","key":"3_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1080\/00029890.1944.11999082","volume":"51","author":"S Cairns","year":"1944","unstructured":"Cairns, S.: Deformations of plane rectilinear complexes. Am. Math. Monthly 51(5), 247\u2013252 (1944)","journal-title":"Am. Math. Monthly"},{"issue":"6","key":"3_CR8","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G Di Battista","year":"1998","unstructured":"Di Battista, G., Liotta, G., Vargiu, F.: Spirality and optimal orthogonal drawings. SIAM J. Comput. 27(6), 1764\u20131811 (1998)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/070696854","volume":"23","author":"W Didimo","year":"2009","unstructured":"Didimo, W., Giordano, F., Liotta, G.: Upward spirality and upward planarity testing. SIAM J. Discrete Math. 23(4), 1842\u20131899 (2009)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"3_CR10","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"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"van Goethem, A., Speckmann, B., Verbeek, K.: Optimal Morphs of Planar Orthogonal Drawings II. arXiv e-prints, August 2019. arXiv:1908.08365","DOI":"10.1007\/978-3-030-35802-0_3"},{"key":"3_CR12","unstructured":"van Goethem, A., Verbeek, K.: Optimal morphs of planar orthogonal drawings. In: Proceedings of the 34th International Symposium on Computational Geometry (SoCG 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-35802-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:02:35Z","timestamp":1701133355000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_3","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":"28 November 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","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":"113","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":"34","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":"8","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":"30% - 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.11","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":"12.55","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}