{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:20:40Z","timestamp":1758273640646,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030358013"},{"type":"electronic","value":"9783030358020"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_6","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"78-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Crossing Numbers of Beyond-Planar Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4681-5550","authenticated-orcid":false,"given":"Markus","family":"Chimani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0543-8912","authenticated-orcid":false,"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Valtr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF02187731","volume":"4","author":"N Alon","year":"1989","unstructured":"Alon, N., Erd\u00f6s, P.: Disjoint edges in geometric graphs. Disc. Comput. Geom. 4, 287\u2013290 (1989). https:\/\/doi.org\/10.1007\/BF02187731","journal-title":"Disc. Comput. Geom."},{"key":"6_CR2","unstructured":"Batini, C., Furlani, L., Nardelli, E.: What is a good diagram? A pragmatic approach. In: Proceedings of 4th International Conference on Entity-Relationship Approach (ER 1985), pp. 312\u2013319 (1985). http:\/\/dl.acm.org\/citation.cfm?id=647510.726382"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","volume":"12","author":"C Batini","year":"1986","unstructured":"Batini, C., Nardelli, E., Tamassia, R.: A layout algorithm for data flow diagrams. IEEE Trans. Softw. Eng. 12(4), 538\u2013546 (1986). https:\/\/doi.org\/10.1109\/TSE.1986.6312901","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00459","volume":"22","author":"MA Bekos","year":"2018","unstructured":"Bekos, M.A., Kaufmann, M., Montecchiani, F.: Guest editors\u2019 foreword and overview - special issue on graph drawing beyond planarity. J. Graph Algorithms Appl. 22(1), 1\u201310 (2018). https:\/\/doi.org\/10.7155\/jgaa.00459","journal-title":"J. Graph Algorithms Appl."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/BF02574701","volume":"6","author":"D Bienstock","year":"1991","unstructured":"Bienstock, D.: Some provably hard crossing number problems. Disc. Comput. Geom. 6, 443\u2013459 (1991). https:\/\/doi.org\/10.1007\/BF02574701","journal-title":"Disc. Comput. Geom."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Chimani, M., Kindermann, P., Montecchiani, F., Valtr, P.: Crossing numbers of beyond-planar graphs. Arxiv report (2019). http:\/\/arxiv.org\/abs\/1908.03153","DOI":"10.1007\/978-3-030-35802-0_6"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-540-87744-8_24","volume-title":"Algorithms - ESA 2008","author":"M Chimani","year":"2008","unstructured":"Chimani, M., Mutzel, P., Bomze, I.: A new approach to exact crossing minimization. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 284\u2013296. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87744-8_24"},{"key":"6_CR8","volume-title":"Graph Drawing","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Upper Saddle River (1999)"},{"issue":"1","key":"6_CR9","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\u20134:37 (2019). https:\/\/doi.org\/10.1145\/3301281","journal-title":"ACM Comput. Surv."},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Hlin\u011bn\u00fd, P., Chimani, M.: Approximating the crossing number of graphs embeddable in any orientable surface. In: Charikar, M. (ed.) Proceedings 21sth Annual ACM-SIAM Symposium Discrete Algorithms (SODA 2010), pp. 918\u2013927. SIAM (2010). https:\/\/doi.org\/10.1137\/1.9781611973075.74","DOI":"10.1137\/1.9781611973075.74"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Hong, S., Kaufmann, M., Kobourov, S.G., Pach, J.: Beyond-planar graphs: Algorithmics and combinatorics (dagstuhl seminar 16452). In: Dagstuhl Reports, vol. 6, no. 11, pp. 35\u201362 (2016). https:\/\/doi.org\/10.4230\/DagRep.6.11.35","DOI":"10.4230\/DagRep.6.11.35"},{"key":"6_CR12","unstructured":"Hong, S., Tokuyama, T.: Algoritihmcs for beyond planar graphs (NII shonan meeting 2016\u201317). NII Shonan Meeting Report 2016 (2016). http:\/\/shonan.nii.ac.jp\/shonan\/report\/no-2016-17\/"},{"issue":"4","key":"6_CR13","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":"6_CR14","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. Arxiv Report (2014). http:\/\/arxiv.org\/abs\/1403.6184"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Kawarabayashi, K., Reed, B.A.: Computing crossing number in linear time. In: Johnson, D.S., Feige, U. (eds.) Proceedings 39th Annual ACM Symposium Theory Computing(STOC 2007). pp. 382\u2013390. ACM (2007). https:\/\/doi.org\/10.1145\/1250790.1250848","DOI":"10.1145\/1250790.1250848"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cosrev.2017.06.002","volume":"25","author":"SG Kobourov","year":"2017","unstructured":"Kobourov, S.G., Liotta, G., Montecchiani, F.: An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25, 49\u201367 (2017). https:\/\/doi.org\/10.1016\/j.cosrev.2017.06.002","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1002\/jgt.21630","volume":"72","author":"VP Korzhik","year":"2013","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. J. Graph Theory 72(1), 30\u201371 (2013). https:\/\/doi.org\/10.1002\/jgt.21630","journal-title":"J. Graph Theory"},{"issue":"4","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1137\/S1052623498334013","volume":"11","author":"P Mutzel","year":"2001","unstructured":"Mutzel, P.: An alternative method to crossing minimization on hierarchical graphs. SIAM J. Optim. 11(4), 1065\u20131080 (2001). https:\/\/doi.org\/10.1137\/S1052623498334013","journal-title":"SIAM J. Optim."},{"issue":"3","key":"6_CR19","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":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0953-5438(00)00032-1","volume":"13","author":"HC Purchase","year":"2000","unstructured":"Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interact. Comput. 13(2), 147\u2013162 (2000). https:\/\/doi.org\/10.1016\/S0953-5438(00)00032-1","journal-title":"Interact. Comput."},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1016344215610","volume":"7","author":"HC Purchase","year":"2002","unstructured":"Purchase, H.C., Carrington, D.A., Allder, J.A.: Empirical evaluation of aesthetics-based graph layout. Empir. Softw. Eng. 7(3), 233\u2013255 (2002)","journal-title":"Empir. Softw. Eng."},{"key":"6_CR22","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electr. J. Comb., Dynamic Surveys, DS21, 113 p. (2017). https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/DS21"},{"issue":"2","key":"6_CR23","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109\u2013125 (1981). https:\/\/doi.org\/10.1109\/TSMC.1981.4308636","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.comgeo.2015.06.001","volume":"50","author":"A Suk","year":"2015","unstructured":"Suk, A., Walczak, B.: New bounds on the maximum number of edges in k-quasi-planar graphs. Comput. Geom. 50, 24\u201333 (2015). https:\/\/doi.org\/10.1016\/j.comgeo.2015.06.001","journal-title":"Comput. Geom."},{"key":"6_CR25","unstructured":"Vrt\u2019o, I.: Crossing numbers of graphs: A bibliography (2014). ftp:\/\/ftp.ifi.savba.sk\/pub\/imrich\/crobib.pdf"},{"issue":"2","key":"6_CR26","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. Inform. Vis. 1(2), 103\u2013110 (2002). https:\/\/doi.org\/10.1057\/palgrave.ivs.9500013","journal-title":"Inform. Vis."}],"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-35802-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:03:16Z","timestamp":1701133396000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","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":"113","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":"34","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":"8","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":"30% - 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.11","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":"12.55","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"}]}}