{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T04:45:05Z","timestamp":1748061905814,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"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_7","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"87-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the 2-Colored Crossing Number"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2364-0583","authenticated-orcid":false,"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2517-0298","authenticated-orcid":false,"given":"Ruy","family":"Fabila-Monroy","sequence":"additional","affiliation":[]},{"given":"Adrian","family":"Fuchs","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3578-0193","authenticated-orcid":false,"given":"Carlos","family":"Hidalgo-Toscano","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3147-0083","authenticated-orcid":false,"given":"Irene","family":"Parada","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7166-4467","authenticated-orcid":false,"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Zaragoza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"\u00c1brego, B.M., Aichholzer, O., Fern\u00e1ndez-Merchant, S., Hackl, T., Pammer, J., Pilz, A., Ramos, P., Salazar, G., Vogtenhuber, B.: All good drawings of small complete graphs. In: Proceedings of the 31st European Workshop on Computational Geometry (EuroCG 2015), pp. 57\u201360 (2015)","DOI":"10.1007\/s00373-015-1550-5"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.jcta.2006.05.003","volume":"114","author":"BM \u00c1brego","year":"2007","unstructured":"\u00c1brego, B.M., Fern\u00e1ndez-Merchant, S.: Geometric drawings of $${K}_n$$ with few crossings. J. Comb. Theory Ser. A 114(2), 373\u2013379 (2007). https:\/\/doi.org\/10.1016\/j.jcta.2006.05.003","journal-title":"J. Comb. Theory Ser. A"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.endm.2008.01.047","volume":"30","author":"BM \u00c1brego","year":"2008","unstructured":"\u00c1brego, B.M., Fern\u00e1ndez-Merchant, S., Lea\u00f1os, J., Salazar, G.: A central approach to bound the number of crossings in a generalized configuration. Electron. Notes Discret. Math. 30, 273\u2013278 (2008). https:\/\/doi.org\/10.1016\/j.endm.2008.01.047","journal-title":"Electron. Notes Discret. Math."},{"key":"7_CR4","unstructured":"Ackerman, E.: On topological graphs with at most four crossings per edge. ArXiv e-Prints (2013). https:\/\/arxiv.org\/abs\/1509.01932"},{"key":"7_CR5","unstructured":"Aichholzer, O.: The order type data base. http:\/\/www.ist.tugraz.at\/aichholzer\/research\/rp\/triangulations\/ordertypes\/. Accessed 1 Oct 2018"},{"key":"7_CR6","unstructured":"Aichholzer, O., Duque, F., Garc\u00eda-Quintero, O.E., Fabila-Monroy, R., Hidalgo-Toscano, C.: An ongoing project to improve the rectilinear and pseudolinear crossing constants. ArXiv e-Prints (2018). https:\/\/arxiv.org\/abs\/1907.07796"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Fabila-Monroy, R., Fuchs, A., Hidalgo-Toscano, C., Parada, I., Vogtenhuber, B., Zaragoza, F.: On the 2-colored crossing number. ArXiv e-Prints (2019). http:\/\/arxiv.org\/abs\/1908.06461","DOI":"10.1007\/978-3-030-35802-0_7"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.comgeo.2005.07.005","volume":"36","author":"O Aichholzer","year":"2006","unstructured":"Aichholzer, O., Krasser, H.: Abstract order type extension and new results on the rectilinear crossing number. Comput. Geom.: Theory Appl. 36(1), 2\u201315 (2006). https:\/\/doi.org\/10.1016\/j.comgeo.2005.07.005","journal-title":"Comput. Geom.: Theory Appl."},{"key":"7_CR9","unstructured":"Aichholzer, O., Mulzer, W., Schnider, P., Vogtenhuber, B.: NP-completeness of max-cut for segment intersection graphs. In: Proceedings of the 34th European Workshop on Computational Geometry (EuroCG 2018), pp. 1\u20136 (2018)"},{"key":"7_CR10","unstructured":"Aichholzer, O., Orden, D., Ramos, P.: On the structure of sets attaining the rectilinear crossing number. In: Proceedings of the 22nd European Workshop on Computational Geometry (EuroCG 2006), pp. 43\u201346 (2006)"},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/PL00009350","volume":"19","author":"I B\u00e1r\u00e1ny","year":"1998","unstructured":"B\u00e1r\u00e1ny, I., Valtr, P.: A positive fraction Erd\u0151s-Szekeres theorem. Discret. Comput. Geom. 19(3), 335\u2013342 (1998). https:\/\/doi.org\/10.1007\/PL00009350","journal-title":"Discret. Comput. Geom."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1090\/S0002-9904-1962-10850-7","volume":"68","author":"J Battle","year":"1962","unstructured":"Battle, J., Harary, F., Kodama, Y.: Every planar graph with nine points has a nonplanar complement. Bull. Am. Math. Soc. 68, 569\u2013571 (1962). https:\/\/doi.org\/10.1090\/S0002-9904-1962-10850-7","journal-title":"Bull. Am. Math. Soc."},{"key":"7_CR13","series-title":"Bolyai Society Mathematical Studies","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-32439-3_4","volume-title":"More Sets, Graphs and Numbers: A Salute to Vera S\u00f3s and Andr\u00e1s Hajnal","author":"\u00c9 Czabarka","year":"2006","unstructured":"Czabarka, \u00c9., S\u00fdkora, O., Sz\u00e9kely, L.A., Vrt\u2019o, I.: Biplanar crossing numbers I: a survey of results and problems. In: Gy\u0151ri, E., Katona, G.O.H., Lov\u00e1sz, L., Fleiner, T. (eds.) More Sets, Graphs and Numbers: A Salute to Vera S\u00f3s and Andr\u00e1s Hajnal. BSMS, vol. 15, pp. 57\u201377. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/978-3-540-32439-3_4"},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1002\/rsa.20221","volume":"33","author":"E Czabarka","year":"2008","unstructured":"Czabarka, E., S\u00fdkora, O., Sz\u00e9kely, L.A., Vrt\u2019o, I.: Biplanar crossing numbers II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method. Random Struct. Algorithms 33(4), 480\u2013496 (2008). https:\/\/doi.org\/10.1002\/rsa.20221","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"7_CR15","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."},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"393","DOI":"10.7155\/jgaa.00328","volume":"18","author":"R Fabila-Monroy","year":"2014","unstructured":"Fabila-Monroy, R., L\u00f3pez, J.: Computational search of small point sets with small rectilinear crossing number. J. Graph Algorithms Appl. 18(3), 393\u2013399 (2014). https:\/\/doi.org\/10.7155\/jgaa.00328","journal-title":"J. Graph Algorithms Appl."},{"key":"7_CR17","unstructured":"Fuchs, A.: On the number of monochromatic crossings in rectilinear embeddings of complete graphs. Master\u2019s thesis, University of Technology Graz, Austria (2019)"},{"issue":"3","key":"7_CR18","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M Garey","year":"1983","unstructured":"Garey, M., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebr. Discret. Methods 4(3), 312\u2013316 (1983)","journal-title":"SIAM J. Algebr. Discret. Methods"},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/jgt.22027","volume":"84","author":"C Hern\u00e1ndez-V\u00e9lez","year":"2016","unstructured":"Hern\u00e1ndez-V\u00e9lez, C., Lea\u00f1os, J., Salazar, G.: On the pseudolinear crossing number. J. Graph Theory 84(3), 297\u2013310 (2016). https:\/\/doi.org\/10.1002\/jgt.22027","journal-title":"J. Graph Theory"},{"issue":"11","key":"7_CR20","doi-asserted-by":"publisher","first-page":"35","DOI":"10.4230\/DagRep.6.11.35","volume":"6","author":"SH Hong","year":"2017","unstructured":"Hong, S.H., Kaufmann, M., Kobourov, S.G., Pach, J.: Beyond-planar graphs: algorithmics and combinatorics (Dagstuhl seminar 16452). Dagstuhl Rep. 6(11), 35\u201362 (2017). https:\/\/doi.org\/10.4230\/DagRep.6.11.35","journal-title":"Dagstuhl Rep."},{"key":"7_CR21","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol. 212. Springer, New York (2002). https:\/\/doi.org\/10.1007\/978-1-4613-0039-7"},{"issue":"2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/TCT.1971.1083266","volume":"18","author":"A Owens","year":"1971","unstructured":"Owens, A.: On the biplanar crossing number. IEEE Trans. Circuit Theory 18(2), 277\u2013280 (1971). https:\/\/doi.org\/10.1109\/TCT.1971.1083266","journal-title":"IEEE Trans. Circuit Theory"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.comgeo.2017.06.015","volume":"68","author":"J Pach","year":"2018","unstructured":"Pach, J., Sz\u00e9kely, L.A., T\u00f3th, C.D., T\u00f3th, G.: Note on k-planar crossing numbers. Comput. Geom. 68, 2\u20136 (2018). https:\/\/doi.org\/10.1016\/j.comgeo.2017.06.015","journal-title":"Comput. Geom."},{"issue":"2","key":"7_CR24","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/00029890.1997.11990611","volume":"104","author":"RB Richter","year":"1997","unstructured":"Richter, R.B., Thomassen, C.: Relations between crossing numbers of complete and complete bipartite graphs. Am. Math. Mon. 104(2), 131\u2013137 (1997). https:\/\/doi.org\/10.1080\/00029890.1997.11990611","journal-title":"Am. Math. Mon."},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Comb. Dyn. Surv. 21 (2013\/2017)","DOI":"10.37236\/2713"},{"issue":"9","key":"7_CR26","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1016\/j.dam.2005.12.011","volume":"155","author":"F Shahrokhi","year":"2007","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L.A., Vrt\u2019o, I.: On k-planar crossing numbers. Discret. Appl. Math. 155(9), 1106\u20131115 (2007). https:\/\/doi.org\/10.1016\/j.dam.2005.12.011. Advances in Graph Drawing: The 11th International Symposium on Graph Drawing","journal-title":"Discret. Appl. Math."},{"key":"7_CR27","unstructured":"T\u00f3th, C.D.: Personal communication (2018)"},{"issue":"3","key":"7_CR28","doi-asserted-by":"publisher","first-page":"319","DOI":"10.4153\/CMB-1963-026-x","volume":"6","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: The non-biplanar character of the complete 9-graph. Can. Math. Bull. 6(3), 319\u2013330 (1963). https:\/\/doi.org\/10.4153\/CMB-1963-026-x","journal-title":"Can. Math. Bull."}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:02:49Z","timestamp":1701133369000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_7","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"}]}}