{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:12:29Z","timestamp":1743019949032,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501055"},{"type":"electronic","value":"9783319501062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_34","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"441-453","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Topological Drawings of Complete Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Jean","family":"Cardinal","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Felsner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"issue":"4","key":"34_CR1","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s00454-013-9514-0","volume":"49","author":"BM \u00c1brego","year":"2013","unstructured":"\u00c1brego, B.M., Aichholzer, O., Fern\u00e1ndez-Merchant, S., Ramos, P., Salazar, G.: The 2-page crossing number of $$K_n$$. Discret. Comput. Geom. 49(4), 747\u2013777 (2013)","journal-title":"Discret. Comput. Geom."},{"key":"34_CR2","unstructured":"Bla\u017eek, J., Koman, M.: A minimal problem concerning complete plane graphs. In: Fiedler, M. (ed.) Theory of Graphs and Its Applications, pp. 113\u2013117. Czech. Acad. of Sci. (1964)"},{"key":"34_CR3","unstructured":"Cardinal, J., Felsner, S.: Topological drawings of complete bipartite graphs (full version). \n                      arXiv:1608.08324\n                      \n                     [cs.CG]"},{"issue":"2","key":"34_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.jctb.2012.11.001","volume":"103","author":"R Christian","year":"2013","unstructured":"Christian, R., Richter, R.B., Salazar, G.: Zarankiewicz\u2019s conjecture is finite for each fixed $$m$$. J. Comb. Theory Ser. B 103(2), 237\u2013247 (2013)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"34_CR5","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s00454-010-9320-x","volume":"45","author":"J Kyn\u010dl","year":"2011","unstructured":"Kyn\u010dl, J.: Simple realizability of complete abstract topological graphs in P. Discret. Comput. Geom. 45(3), 383\u2013399 (2011)","journal-title":"Discret. Comput. Geom."},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-319-27261-0_26","volume-title":"Graph Drawing and Network Visualization","author":"J Kyn\u010dl","year":"2015","unstructured":"Kyn\u010dl, J.: Simple realizability of complete abstract topological graphs simplified. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 309\u2013320. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-319-27261-0_26"},{"key":"34_CR7","series-title":"Advanced Lectures in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-80303-0","volume-title":"Geometric Graphs and Arrangements","author":"S Felsner","year":"2004","unstructured":"Felsner, S.: Geometric Graphs and Arrangements. Advanced Lectures in Mathematics. Vieweg Verlag, Berlin (2004)"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1017\/S0013091500025645","volume":"13","author":"F Harary","year":"1963","unstructured":"Harary, F., Hill, A.: On the number of crossings in a complete graph. Proc. Edinburgh Math. Soc. 13, 333\u2013338 (1963)","journal-title":"Proc. Edinburgh Math. Soc."},{"issue":"2","key":"34_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/0404022","volume":"4","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Lubiw, A., Ne\u0161et\u0159il, J.: Noncrossing subgraphs in topological layouts. SIAM J. Discrete Math. 4(2), 223\u2013244 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"34_CR10","first-page":"761","volume":"30","author":"J Kratochv\u00edl","year":"1989","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: NP-hardness results for intersection graphs. Commentationes Math. Univ. Carol. 30, 761\u2013773 (1989)","journal-title":"Commentationes Math. Univ. Carol."},{"issue":"5","key":"34_CR11","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s00493-006-0032-z","volume":"26","author":"J Pach","year":"2006","unstructured":"Pach, J., T\u00f3th, G.: How many ways can one draw a graph? Combinatorica 26(5), 559\u2013576 (2006)","journal-title":"Combinatorica"},{"key":"34_CR12","doi-asserted-by":"crossref","first-page":"137","DOI":"10.4064\/fm-41-1-137-145","volume":"41","author":"K Zarankiewicz","year":"1954","unstructured":"Zarankiewicz, K.: On a problem of P Tur\u00e1n concerning graphs. Fundamenta Mathematicae 41, 137\u2013145 (1954)","journal-title":"Fundamenta Mathematicae"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:42:32Z","timestamp":1600476152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","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":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}