{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T03:50:49Z","timestamp":1769572249081,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030929305","type":"print"},{"value":"9783030929312","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92931-2_4","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"57-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Simplifying Non-simple Fan-Planar Drawings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4532-3765","authenticated-orcid":false,"given":"Boris","family":"Klemz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4239-424X","authenticated-orcid":false,"given":"Kristin","family":"Knorr","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9185-1246","authenticated-orcid":false,"given":"Meghana M.","family":"Reddy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8563-3517","authenticated-orcid":false,"given":"Felix","family":"Schr\u00f6der","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.jcta.2006.08.002","volume":"114","author":"E Ackerman","year":"2007","unstructured":"Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J. Comb. Theory, Ser. A 114(3), 563\u2013571 (2007). https:\/\/doi.org\/10.1016\/j.jcta.2006.08.002","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01196127","volume":"17","author":"PK Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica 17(1), 1\u20139 (1997). https:\/\/doi.org\/10.1007\/BF01196127","journal-title":"Combinatorica"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2018.03.005","volume":"723","author":"P Angelini","year":"2018","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Kindermann, P., Schneck, T.: 1-fan-bundle-planar drawings of graphs. Theor. Comput. Sci. 723, 23\u201350 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.03.005","journal-title":"Theor. Comput. Sci."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2018.05.029","volume":"745","author":"SW Bae","year":"2018","unstructured":"Bae, S.W., Baffier, J., Chun, J., Eades, P., Eickmeyer, K., Grilli, L., Hong, S., Korman, M., Montecchiani, F., Rutter, I., T\u00f3th, C.D.: Gap-planar graphs. Theor. Comput. Sci. 745, 36\u201352 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.05.029","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s00453-016-0200-5","volume":"79","author":"MA Bekos","year":"2016","unstructured":"Bekos, M.A., Cornelsen, S., Grilli, L., Hong, S.-H., Kaufmann, M.: On the recognition of fan-planar and maximal outer-fan-planar graphs. Algorithmica 79(2), 401\u2013427 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0200-5","journal-title":"Algorithmica"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-981-15-6533-5_8","volume-title":"Beyond Planar Graphs","author":"MA Bekos","year":"2020","unstructured":"Bekos, M.A., Grilli, L.: Fan-planar graphs. In: Hong, S.-H., Tokuyama, T. (eds.) Beyond Planar Graphs, pp. 131\u2013148. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-6533-5_8"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Kaufmann, M., Raftopoulou, C.N.: On optimal 2- and 3-planar graphs. In: Aronov, B., Katz, M.J. (eds.) 33rd International Symposium on Computational Geometry, SoCG 2017, July 4\u20137, 2017, Brisbane, Australia. LIPIcs, vol. 77, pp. 16:1\u201316:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.16","DOI":"10.4230\/LIPIcs.SoCG.2017.16"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.7155\/jgaa.00398","volume":"21","author":"C Binucci","year":"2017","unstructured":"Binucci, C., Chimani, M., Didimo, W., Gronemann, M., Klein, K., Kratochv\u00edl, J., Montecchiani, F., Tollis, I.G.: Algorithms and characterizations for 2-layer fan-planarity: from caterpillar to stegosaurus. J. Graph Algorithms Appl. 21(1), 81\u2013102 (2017). https:\/\/doi.org\/10.7155\/jgaa.00398","journal-title":"J. Graph Algorithms Appl."},{"key":"4_CR9","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., Giacomo, E.D., Didimo, W., Montecchiani, F., Patrignani, M., Symvonis, A., Tollis, I.G.: 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_CR10","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":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s00453-014-9935-z","volume":"73","author":"O Cheong","year":"2014","unstructured":"Cheong, O., Har-Peled, S., Kim, H., Kim, H.-S.: On the number of edges of fan-crossing free graphs. Algorithmica 73(4), 673\u2013695 (2014). https:\/\/doi.org\/10.1007\/s00453-014-9935-z","journal-title":"Algorithmica"},{"issue":"39","key":"4_CR12","doi-asserted-by":"publisher","first-page":"5156","DOI":"10.1016\/j.tcs.2011.05.025","volume":"412","author":"W Didimo","year":"2011","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. Theor. Comput. Sci. 412(39), 5156\u20135166 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.025","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/3301281","volume":"52","author":"W Didimo","year":"2019","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. ACM Comput. Surv. 52(1), 4:1-4:37 (2019). https:\/\/doi.org\/10.1145\/3301281","journal-title":"ACM Comput. Surv."},{"issue":"5","key":"4_CR14","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TVCG.2006.147","volume":"12","author":"D Holten","year":"2006","unstructured":"Holten, D.: Hierarchical edge bundles: visualization of adjacency relations in hierarchical data. IEEE Trans. Vis. Comput. Graph. 12(5), 741\u2013748 (2006). https:\/\/doi.org\/10.1109\/TVCG.2006.147","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1111\/j.1467-8659.2009.01450.x","volume":"28","author":"D Holten","year":"2009","unstructured":"Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. Comput. Graph. Forum 28(3), 983\u2013990 (2009). https:\/\/doi.org\/10.1111\/j.1467-8659.2009.01450.x","journal-title":"Comput. Graph. Forum"},{"key":"4_CR16","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":"4_CR17","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR abs\/1403.6184v1 (2014). http:\/\/arxiv.org\/abs\/1403.6184v1"},{"key":"4_CR18","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR abs\/1403.6184v2 (2014). http:\/\/arxiv.org\/abs\/1403.6184v2"},{"key":"4_CR19","unstructured":"Klemz, B., Knorr, K., Reddy, M.M., Schr\u00f6der, F.: Simplifying non-simple fan-planar drawings. CoRR abs\/2108.13345 (2021). https:\/\/arxiv.org\/abs\/2108.13345"},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997). https:\/\/doi.org\/10.1007\/BF01215922","journal-title":"Combinatorica"},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1111\/j.1467-8659.2009.01680.x","volume":"29","author":"AC Telea","year":"2010","unstructured":"Telea, A.C., Ersoy, O.: Image-based edge bundles: simplified visualization of large graphs. Comput. Graph. Forum 29(3), 843\u2013852 (2010). https:\/\/doi.org\/10.1111\/j.1467-8659.2009.01680.x","journal-title":"Comput. Graph. Forum"}],"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-030-92931-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:01:49Z","timestamp":1766365309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92931-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 December 2021","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":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo.inf.uni-tuebingen.de\/gd2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"74","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":"23","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":"5","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.02","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":"8.6","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}