{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:59Z","timestamp":1759638359277,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031222023"},{"type":"electronic","value":"9783031222030"}],"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-22203-0_11","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"144-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Strictly-Convex Drawings of\u00a03-Connected Planar Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3414-7444","authenticated-orcid":false,"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2565-090X","authenticated-orcid":false,"given":"Martin","family":"Gronemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0543-8912","authenticated-orcid":false,"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0280-741X","authenticated-orcid":false,"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"369","DOI":"10.4171\/dm\/214","volume":"11","author":"I B\u00e1r\u00e1ny","year":"2006","unstructured":"B\u00e1r\u00e1ny, I., Rote, G.: Strictly convex drawings of planar graphs. Doc. Math. 11, 369\u2013391 (2006)","journal-title":"Doc. Math."},{"key":"11_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2021.101789","volume":"98","author":"MA Bekos","year":"2021","unstructured":"Bekos, M.A., Gronemann, M., Montecchiani, F., P\u00e1lv\u00f6lgyi, D., Symvonis, A., Theocharous, L.: Grid drawings of graphs with constant edge-vertex resolution. Comput. Geom. 98, 101789 (2021)","journal-title":"Comput. Geom."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bekos, M.A., Gronemann, M., Montecchiani, F., Symvonis, A.: Convex grid drawings of planar graphs with constant edge-vertex resolution. In: IWOCA 2022. LNCS, vol. 13270, pp. 157\u2013171. Springer (2022)","DOI":"10.1007\/978-3-031-06678-8_12"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bekos, M.A., Gronemann, M., Montecchiani, F., Symvonis, A.: Strictly-convex drawings of 3-connected planar graphs. CoRR abs\/2208.13388 (2022)","DOI":"10.1007\/978-3-031-22203-0_11"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Goodrich, M.T., Tamassia, R.: Convex drawings of graphs in two and three dimensions (preliminary version). In: Whitesides, S. (ed.) SoCG, pp. 319\u2013328. ACM (1996)","DOI":"10.1145\/237218.237401"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M Chrobak","year":"1997","unstructured":"Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Int. J. Comput. Geom. Appl. 7(3), 211\u2013223 (1997)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M Chrobak","year":"1995","unstructured":"Chrobak, M., Payne, T.H.: A linear-time algorithm for drawing a planar graph on a grid. Inf. Process. Lett. 54(4), 241\u2013246 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H de Fraysseix","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"11_CR9","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-1-4614-0110-0_9","volume-title":"Thirty Essays on Geometric Graph Theory","author":"G Di Battista","year":"2013","unstructured":"Di Battista, G., Frati, F.: Drawing trees, outerplanar graphs, series-parallel graphs, and planar graphs in a small area. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 121\u2013165. Springer, New York (2013)"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/PL00009264","volume":"23","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Tamassia, R., Vismara, L.: Output-sensitive reporting of disjoint paths. Algorithmica 23(4), 302\u2013340 (1999)","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1023\/A:1010604726900","volume":"18","author":"S Felsner","year":"2001","unstructured":"Felsner, S.: Convex drawings of planar graphs and the order dimension of 3-polytopes. Order 18(1), 19\u201337 (2001)","journal-title":"Order"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Felsner, S.: Geometric Graphs and Arrangements. Advanced Lectures in Mathematics, Vieweg (2004)","DOI":"10.1007\/978-3-322-80303-0"},{"key":"11_CR14","first-page":"229","volume":"11","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight lines representation of planar graphs. Acta Sci. Math. (Szeged) 11, 229\u2013233 (1948)","journal-title":"Acta Sci. Math. (Szeged)"},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/PL00009290","volume":"17","author":"X He","year":"1997","unstructured":"He, X.: Grid embedding of 4-connected plane graphs. Discret. Comput. Geom. 17(3), 339\u2013358 (1997)","journal-title":"Discret. Comput. Geom."},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-56402-0_53","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G Kant","year":"1993","unstructured":"Kant, G.: Hexagonal grid drawings. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol. 657, pp. 263\u2013276. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56402-0_53"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16(1), 4\u201332 (1996)","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00454-001-0004-4","volume":"26","author":"K Miura","year":"2001","unstructured":"Miura, K., Nakano, S., Nishizeki, T.: Grid drawings of 4-connected plane graphs. Discret. Comput. Geom. 26(1), 73\u201387 (2001)","journal-title":"Discret. Comput. Geom."},{"key":"11_CR19","unstructured":"Rote, G.: Strictly convex drawings of planar graphs. In: SODA, pp. 728\u2013734. SIAM (2005)"},{"key":"11_CR20","volume-title":"Real analysis","author":"HL Royden","year":"2010","unstructured":"Royden, H.L., Fitzpatrick, P.M.: Real analysis. NY, fourth. edn, Pearson modern classic, Pearson, New York (2010)"},{"key":"11_CR21","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: SODA, pp. 138\u2013148. SIAM (1990)"},{"key":"11_CR22","first-page":"502","volume":"13","author":"W Schnyder","year":"1992","unstructured":"Schnyder, W., Trotter, W.T.: Convex embeddings of 3-connected plane graphs. Abstracts AMS 13, 502 (1992)","journal-title":"Abstracts AMS"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Thomassen, C.: A refinement of Kuratowski\u2019s theorem. J. Comb. Theory, Ser. B D(3), 245\u2013253 (1984)","DOI":"10.1016\/0095-8956(84)90057-1"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. London Math. Soc. 13, 743\u2013768 (1963)","journal-title":"Proc. London Math. Soc."},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-540-45078-8_43","volume-title":"Algorithms and Data Structures","author":"H Zhang","year":"2003","unstructured":"Zhang, H., He, X.: Compact visibility representation and straight-line grid embedding of plane graphs. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 493\u2013504. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45078-8_43"}],"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-22203-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:04:11Z","timestamp":1704351851000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_11","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":"19 January 2023","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":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/graphdrawing.github.io\/gd2022\/","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":"70","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":"25","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":"36% - 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.01","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":"7.03","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)"}}]}}