{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:31:37Z","timestamp":1743024697171,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492747"},{"type":"electronic","value":"9783031492754"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-49275-4_10","type":"book-chapter","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:02:46Z","timestamp":1704715366000},"page":"141-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Manipulating Weights to\u00a0Improve Stress-Graph Drawings of\u00a03-Connected Planar Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-6863-859X","authenticated-orcid":false,"given":"Alvin","family":"Chiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8943-191X","authenticated-orcid":false,"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,6]]},"reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s00453-006-0177-6","volume":"47","author":"N Bonichon","year":"2007","unstructured":"Bonichon, N., Felsner, S., Mosbah, M.: Convex drawings of 3-connected plane graphs. Algorithmica 47(4), 399\u2013420 (2007)","journal-title":"Algorithmica"},{"key":"10_CR2","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G., Klein, K., Mutzel, P.: The open graph drawing framework (OGDF). In: Handbook of Graph Drawing and Visualization, pp. 543\u2013569. CRC Press (2013)"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Chrobak, M., Goodrich, M.T., Tamassia, R.: Convex drawings of graphs in two and three dimensions. In: 12th Symposium on Computational Geometry (SoCG), pp. 319\u2013328. New York, NY, USA (1996). https:\/\/doi.org\/10.1145\/237218.237401","DOI":"10.1145\/237218.237401"},{"key":"10_CR4","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Hoboken (1999)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/BFb0021805","volume-title":"Graph Drawing","author":"P Eades","year":"1996","unstructured":"Eades, P., Garvan, P.: Drawing stressed planar graphs in three dimensions. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 212\u2013223. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021805"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-92931-2_9","volume-title":"Graph Drawing and Network Visualization","author":"J Erickson","year":"2021","unstructured":"Erickson, J., Lin, P.: Planar and\u00a0toroidal morphs made easier. In: Purchase, H.C., Rutter, I. (eds.) GD 2021. LNCS, vol. 12868, pp. 123\u2013137. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92931-2_9"},{"issue":"2","key":"10_CR7","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 11(2), 229\u2013233 (1948)","journal-title":"Acta Scientiarum Mathematicarum"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Felsner, S.: Lattice structures from planar graphs. The Electronic Journal of Combinatorics, pp. R15\u2013R15 (2004)","DOI":"10.37236\/1768"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Floater, M.S.: Parametric tilings and scattered data approximation. Int. J. Shape Model. 04(03n04), 165\u2013182 (1998). https:\/\/doi.org\/10.1142\/S021865439800012X","DOI":"10.1142\/S021865439800012X"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Floater, M.S., Gotsman, C.: How to morph tilings injectively. J. Comput. Appl. Math. 101(1), 117\u2013129 (1999). https:\/\/doi.org\/10.1016\/S0377-0427(98)00202-7, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377042798002027","DOI":"10.1016\/S0377-0427(98)00202-7"},{"issue":"1\u20136","key":"10_CR11","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01758769","volume":"7","author":"JE Hopcroft","year":"1992","unstructured":"Hopcroft, J.E., Kahn, P.J.: A paradigm for robust geometric algorithms. Algorithmica 7(1\u20136), 339\u2013380 (1992)","journal-title":"Algorithmica"},{"key":"10_CR12","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":"10_CR13","unstructured":"Kobourov, S.G.: Spring embedders and force directed graph drawing algorithms. arXiv preprint arXiv:1201.3011 (2012)"},{"key":"10_CR14","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: 1st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 138\u2013148 (1990)"},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1090\/S0002-9939-1951-0041425-5","volume":"2","author":"SK Stein","year":"1951","unstructured":"Stein, S.K.: Convex maps. Proc. Am. Math. Soc. 2(3), 464\u2013466 (1951)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"3","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. Lond. Math. Soc. 3(1), 743\u2013767 (1963)","journal-title":"Proc. Lond. Math. Soc."},{"key":"10_CR17","first-page":"26","volume":"46","author":"K Wagner","year":"1936","unstructured":"Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresber. Deutsch. Math.-Verein. 46, 26\u201332 (1936)","journal-title":"Jahresber. Deutsch. Math.-Verein."}],"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-031-49275-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:03:47Z","timestamp":1704715427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49275-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492747","9783031492754"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49275-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"6 January 2024","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":"Isola delle Femmine, Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2023.ing.unipg.it\/\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"100","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":"31","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":"7","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":"31% - 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","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":"13","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":"11 posters, 2 abstracts of invited talks, and 1 contest report are also included in the GD 2023 proceedings","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)"}}]}}