{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:09:02Z","timestamp":1743052142090,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492716"},{"type":"electronic","value":"9783031492723"}],"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-49272-3_4","type":"book-chapter","created":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:04:34Z","timestamp":1704963874000},"page":"53-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Weakly and\u00a0Strongly Fan-Planar Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4467-7075","authenticated-orcid":false,"given":"Otfried","family":"Cheong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1441-4189","authenticated-orcid":false,"given":"Henry","family":"F\u00f6rster","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7545-0730","authenticated-orcid":false,"given":"Julia","family":"Katheder","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7203-0669","authenticated-orcid":false,"given":"Maximilian","family":"Pfister","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7043-1867","authenticated-orcid":false,"given":"Lena","family":"Schlipf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,1]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Pfister, M., Ueckerdt, T.: Beyond-planarity: Tur\u00e1n-type results for non-planar bipartite graphs. In: Hsu, W., Lee, D., Liao, C. (eds.) 29th International Symposium on Algorithms and Computation, ISAAC 2018, Jiaoxi, Yilan, Taiwan, 16\u201319 December 2018. LIPIcs, vol. 123, pp. 28:1\u201328:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2018.28","DOI":"10.4230\/LIPIcs.ISAAC.2018.28"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Grilli, L.: Fan-planar graphs. In: Hong and Tokuyama [10], chap. 8, pp. 131\u2013148. https:\/\/doi.org\/10.1007\/978-981-15-6533-5_8","DOI":"10.1007\/978-981-15-6533-5_8"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2015.04.020","volume":"589","author":"C Binucci","year":"2015","unstructured":"Binucci, C., et al.: Fan-planarity: properties and complexity. Theor. Comput. Sci. 589, 76\u201386 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.04.020","journal-title":"Theor. Comput. Sci."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.tcs.2020.07.002","volume":"841","author":"FJ Brandenburg","year":"2020","unstructured":"Brandenburg, F.J.: On fan-crossing graphs. Theor. Comput. Sci. 841, 39\u201349 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.07.002","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"4_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.disc.2005.10.005","volume":"305","author":"G Brinkmann","year":"2005","unstructured":"Brinkmann, G., Greenberg, S., Greenhill, C.S., McKay, B.D., Thomas, R., Wollan, P.: Generation of simple quadrangulations of the sphere. Discret. Math. 305(1\u20133), 33\u201354 (2005). https:\/\/doi.org\/10.1016\/j.disc.2005.10.005","journal-title":"Discret. Math."},{"key":"4_CR6","unstructured":"Cheong, O., F\u00f6rster, H., Katheder, J., Pfister, M., Schlipf, L.: Weakly and strongly fan-planar graphs. CoRR abs\/2308.08966v2 (2023). https:\/\/arxiv.org\/abs\/2308.08966v2"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-031-22203-0_18","volume-title":"Graph Drawing and Network Visualization","author":"O Cheong","year":"2023","unstructured":"Cheong, O., Pfister, M., Schlipf, L.: The thickness of fan-planar graphs is at most three. In: Angelini, P., von Hanxleden, R. (eds.) GD 2022. LNCS, vol. 13764, pp. 247\u2013260. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-22203-0_18"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. ACM Comput. Surv. 52(1) (2019). https:\/\/doi.org\/10.1145\/3301281","DOI":"10.1145\/3301281"},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic Discret. Methods 4(3), 312\u2013316 (1983). https:\/\/doi.org\/10.1137\/0604033","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"4_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-6533-5","volume-title":"Beyond Planar Graphs, Communications of NII Shonan Meetings","author":"S Hong","year":"2020","unstructured":"Hong, S., Tokuyama, T.: Beyond Planar Graphs, Communications of NII Shonan Meetings. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-981-15-6533-5"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Huang, W.: Using eye tracking to investigate graph layout effects. In: Hong, S., Ma, K. (eds.) 6th International Asia-Pacific Symposium on Visualization, APVIS 2007, Sydney, Australia, 5\u20137 February 2007, pp. 97\u2013100. IEEE Computer Society (2007). https:\/\/doi.org\/10.1109\/APVIS.2007.329282","DOI":"10.1109\/APVIS.2007.329282"},{"issue":"4","key":"4_CR12","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.jvlc.2014.03.001","volume":"25","author":"W Huang","year":"2014","unstructured":"Huang, W., Eades, P., Hong, S.: Larger crossing angles make graphs easier to read. J. Vis. Lang. Comput. 25(4), 452\u2013465 (2014). https:\/\/doi.org\/10.1016\/j.jvlc.2014.03.001","journal-title":"J. Vis. Lang. Comput."},{"key":"4_CR13","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR abs\/1403.6184v1 (2014). http:\/\/arxiv.org\/abs\/1403.6184v1"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. Electron. J. Comb. 29(1) (2022). https:\/\/doi.org\/10.37236\/10521","DOI":"10.37236\/10521"},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.7155\/jgaa.00618","volume":"27","author":"B Klemz","year":"2023","unstructured":"Klemz, B., Knorr, K., Reddy, M.M., Schr\u00f6der, F.: Simplifying non-simple fan-planar drawings. J. Graph Algorithms Appl. 27(2), 147\u2013172 (2023). https:\/\/doi.org\/10.7155\/jgaa.00618","journal-title":"J. Graph Algorithms Appl."},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-62495-3_57","volume-title":"Graph Drawing","author":"P Mutzel","year":"1997","unstructured":"Mutzel, P.: An alternative method to crossing minimization on hierarchical graphs. In: North, S. (ed.) GD 1996. LNCS, vol. 1190, pp. 318\u2013333. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62495-3_57"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Graph Drawing","author":"H Purchase","year":"1997","unstructured":"Purchase, H.: Which aesthetic has the greatest effect on human understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248\u2013261. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63938-1_67"},{"issue":"2","key":"4_CR18","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","volume":"1","author":"C Ware","year":"2002","unstructured":"Ware, C., Purchase, H.C., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Inf. Vis. 1(2), 103\u2013110 (2002). https:\/\/doi.org\/10.1057\/palgrave.ivs.9500013","journal-title":"Inf. Vis."},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-1-4612-2972-8_4","volume-title":"Hassler Whitney Collected Papers Contemporary Mathematicians","author":"H Whitney","year":"1992","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. In: Eells, J., Toledo, D. (eds.) Hassler Whitney Collected Papers Contemporary Mathematicians, pp. 61\u201379. Birkh\u00e4user, Boston (1992). https:\/\/doi.org\/10.1007\/978-1-4612-2972-8_4"}],"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-49272-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:05:00Z","timestamp":1704963900000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49272-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492716","9783031492723"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49272-3_4","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":"1 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)"}}]}}