{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T10:09:18Z","timestamp":1748426958285,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"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_8","type":"book-chapter","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:02:46Z","timestamp":1704715366000},"page":"117-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Schnyder-Type Drawing Algorithm for\u00a05-Connected Triangulations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3231-7152","authenticated-orcid":false,"given":"Olivier","family":"Bernardi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6517-2231","authenticated-orcid":false,"given":"\u00c9ric","family":"Fusy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2611-1451","authenticated-orcid":false,"given":"Shizhe","family":"Liang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,6]]},"reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1007\/s00453-011-9514-5","volume":"62","author":"O Bernardi","year":"2012","unstructured":"Bernardi, O., Fusy, \u00c9.: Schnyder decompositions for regular plane graphs and application to drawing. Algorithmica 62(3), 1159\u20131197 (2012)","journal-title":"Algorithmica"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1016\/j.jcta.2012.03.007","volume":"119","author":"O Bernardi","year":"2012","unstructured":"Bernardi, O., Fusy, \u00c9.: Unified bijections for maps with prescribed degrees and girth. J. Comb. Theory, Ser. A 119, 1351\u20131387 (2012)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"8_CR3","unstructured":"Bernardi, O., Fusy, \u00c9., Liang, S.: Grand Schnyder woods. arXiv preprint: arXiv:2303.15630 (2023)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bernardi, O., Fusy, \u00c9., Liang, S.: A Schnyder-type drawing algorithm for 5-connected triangulations. arXiv preprint: arXiv:2305.19058v2 (2023)","DOI":"10.1007\/978-3-031-49275-4_8"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T Biedl","year":"1998","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. Theory Appl 9, 159\u2013180 (1998)","journal-title":"Comput. Geom. Theory Appl"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.disc.2004.01.021","volume":"298","author":"N Bonichon","year":"2005","unstructured":"Bonichon, N.: A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths. Discrete Math. 298, 104\u2013114 (2005)","journal-title":"Discrete Math."},{"issue":"4","key":"8_CR7","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"},{"issue":"03","key":"8_CR8","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. Geometry Appl. 7(03), 211\u2013223 (1997)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"8_CR9","unstructured":"Colin de Verdi\u00e8re, E.: Shortening of curves and decomposition of surfaces. Ph.D. thesis, Universit\u00e9 Paris 7 (2003)"},{"issue":"4","key":"8_CR10","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"},{"key":"8_CR11","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, 19\u201337 (2001)","journal-title":"Order"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/B:ORDE.0000009251.68514.8b","volume":"20","author":"S Felsner","year":"2003","unstructured":"Felsner, S.: Geodesic embeddings and planar graphs. Order 20, 135\u2013150 (2003)","journal-title":"Order"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Felsner, S., Schrezenmaier, H., Steiner, R.: Pentagon contact representations. Electr. J. Comb. 25(3), P3.39 (2018)","DOI":"10.37236\/7216"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00454-007-9027-9","volume":"40","author":"S Felsner","year":"2008","unstructured":"Felsner, S., Zickfeld, F.: Schnyder woods and orthogonal surfaces. Discrete Comput. Geometry 40(1), 103\u2013126 (2008)","journal-title":"Discrete Comput. Geometry"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting F\u00e1ry embeddings of planar graphs. In: Proceedings of STOC, pp. 426\u2013433. ACM (1988)","DOI":"10.1145\/62212.62254"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"1870","DOI":"10.1016\/j.disc.2007.12.093","volume":"309","author":"\u00c9 Fusy","year":"2009","unstructured":"Fusy, \u00c9.: Transversal structures on triangulations: a combinatorial study and straight-line drawings. Discrete Math. 309, 1870\u20131894 (2009)","journal-title":"Discrete Math."},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1002\/jgt.1021","volume":"38","author":"Z Gao","year":"2001","unstructured":"Gao, Z., Wanless, I., Wormald, N.: Counting 5-connected planar triangulations. J. Graph Theory 38(1), 18\u201335 (2001)","journal-title":"J. Graph Theory"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1137\/0222072","volume":"22","author":"X He","year":"1993","unstructured":"He, X.: On finding the rectangular duals of planar triangulated graphs. SIAM J. Comput. 22, 1218\u20131226 (1993)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"8_CR19","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. Discrete Comput. Geometry 17(3), 339\u2013358 (1997)","journal-title":"Discrete Comput. Geometry"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.4171\/dm\/117","volume":"7","author":"E Miller","year":"2002","unstructured":"Miller, E.: Planar graphs as minimal resolutions of trivariate monomial ideals. Doc. Math. 7, 43\u201390 (2002)","journal-title":"Doc. Math."},{"issue":"9","key":"8_CR21","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1587\/transfun.2021DMP0010","volume":"105","author":"K Miura","year":"2022","unstructured":"Miura, K.: Grid drawings of five-connected plane graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105(9), 1228\u20131234 (2022)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"1","key":"8_CR22","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":"8_CR23","doi-asserted-by":"crossref","unstructured":"Nagai, S., Nakano, S.: A linear-time algorithm to find independent spanning trees in maximal planar graphs. In: Graph-Theoretic Concepts in Computer Science: WG\u20192000, pp. 290\u2013301 (2000)","DOI":"10.1007\/3-540-40064-8_27"},{"issue":"4","key":"8_CR24","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W Schnyder","year":"1989","unstructured":"Schnyder, W.: Planar graphs and poset dimension. Order 5(4), 323\u2013343 (1989)","journal-title":"Order"},{"key":"8_CR25","unstructured":"Schnyder, W.: Embedding planar graphs in the grid. In: Symposium on Discrete Algorithms (SODA), pp. 138\u2013148 (1990)"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in a grid with the minimum number of bends. SIAM J. Comput. 16, 421\u2013444 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"8_CR27","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"3","author":"W Tutte","year":"1963","unstructured":"Tutte, W.: How to draw a graph. Proc. Lond. Math. Soc. 3(1), 743\u2013767 (1963)","journal-title":"Proc. Lond. Math. Soc."}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T17:16:34Z","timestamp":1730999794000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49275-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492747","9783031492754"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49275-4_8","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)"}}]}}