{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:38:31Z","timestamp":1757313511070,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"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_18","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"247-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Thickness of\u00a0Fan-Planar Graphs is At\u00a0Most Three"],"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-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":[[2023,1,19]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Ackerman, E.: On topological graphs with at most four crossings per edge. Comput. Geom. 85 (2019)","DOI":"10.1016\/j.comgeo.2019.101574"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Alekseev, V.B., Gon\u010dakov, V.S.: The thickness of an arbitrary complete graph. Math. USSR-Sbornik 30(2), 187\u2013202 (1976). https:\/\/doi.org\/10.1070\/sm1976v030n02abeh002267","DOI":"10.1070\/sm1976v030n02abeh002267"},{"key":"18_CR3","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: 29th International Symposium on Algorithms and Computation (ISAAC 2018), vol. 123, pp. 28:1\u201328:13. LIPIcs (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2018.28","DOI":"10.4230\/LIPIcs.ISAAC.2018.28"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"01","DOI":"10.1017\/S0305004100037385","volume":"60","author":"LW Beineke","year":"1964","unstructured":"Beineke, L.W., Harary, F., Moon, J.W.: On the thickness of the complete bipartite graph. Math. Proc. Cambridge Philos. Soc. 60(1), 01\u201305 (1964). https:\/\/doi.org\/10.1017\/S0305004100037385","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Bekos, M.A., Giacomo, E.D., Didimo, W., Liotta, G., Montecchiani, F., Raftopoulou, C.N.: Edge partitions of optimal 2-plane and 3-plane graphs. Discret. Math. 342(4), 1038\u20131047 (2019). https:\/\/doi.org\/10.1016\/j.disc.2018.12.002","DOI":"10.1016\/j.disc.2018.12.002"},{"key":"18_CR6","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":"18_CR7","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Kaufmann, M., Raftopoulou, C.N.: On optimal 2- and 3-planar graphs. In: 33rd International Symposium on Computational Geometry (SoCG 2017), vol. 77, pp. 16:1\u201316:16. LIPIcs (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.16","DOI":"10.4230\/LIPIcs.SoCG.2017.16"},{"key":"18_CR8","unstructured":"Cheong, O., Pfister, M., Schlipf, L.: The thickness of fan-planar graphs is at most three. CoRR abs\/2208.12324 (2022). https:\/\/arxiv.org\/abs\/2208.12324"},{"key":"18_CR9","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"},{"key":"18_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-6533-5","volume-title":"Beyond Planar Graphs","year":"2020","unstructured":"Hong, S.-H., Tokuyama, T. (eds.): Beyond Planar Graphs. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-6533-5"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Kainen, P.: Thickness and coarseness of graphs. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg 39, 88\u201395 (sept 1973). https:\/\/doi.org\/10.1007\/BF02992822","DOI":"10.1007\/BF02992822"},{"key":"18_CR12","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR abs\/1403.6184v1 (2014). http:\/\/arxiv.org\/abs\/1403.6184v1"},{"key":"18_CR13","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"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-030-92931-2_4","volume-title":"Graph Drawing and Network Visualization","author":"B Klemz","year":"2021","unstructured":"Klemz, B., Knorr, K., Reddy, M.M., Schr\u00f6der, F.: Simplifying non-simple fan-planar drawings. In: Purchase, H.C., Rutter, I. (eds.) GD 2021. LNCS, vol. 12868, pp. 57\u201371. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92931-2_4"},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1017\/S030500410006028X","volume":"93","author":"A Mansfield","year":"1983","unstructured":"Mansfield, A.: Determining the thickness of graphs is NP-hard. Math. Proc. Cambridge Philos. Soc. 93(1), 9\u201323 (1983). https:\/\/doi.org\/10.1017\/S030500410006028X","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Mutzel, P., Odenthal, T., Scharbrodt, M.: The thickness of graphs: a survey. Graphs Comb. 14 (2000). https:\/\/doi.org\/10.1007\/PL00007219","DOI":"10.1007\/PL00007219"},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"Nash-Williams, C.S.A.: Edge-disjoint spanning trees of finite graphs. J. Lond. Math. Soc. s1-36(1), 445\u2013450 (1961). https:\/\/doi.org\/10.1112\/jlms\/s1-36.1.445","DOI":"10.1112\/jlms\/s1-36.1.445"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Pawlik, A.: Triangle-free intersection graphs of line segments with large chromatic number. J. Comb. Theory Ser. B 105, 6\u201310 (2014)","DOI":"10.1016\/j.jctb.2013.11.001"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: The thickness of a graph. In: Indagationes Mathematicae (Proceedings), vol. 66, pp. 567\u2013577. Elsevier (1963)","DOI":"10.1016\/S1385-7258(63)50055-9"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:04:51Z","timestamp":1704351891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_18","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)"}}]}}