{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T08:39:13Z","timestamp":1794559153522,"version":"4.9.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319739144","type":"print"},{"value":"9783319739151","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-73915-1_13","type":"book-chapter","created":{"date-parts":[[2018,1,19]],"date-time":"2018-01-19T22:42:19Z","timestamp":1516401739000},"page":"153-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Many Touchings Force Many Crossings"],"prefix":"10.1007","author":[{"given":"J\u00e1nos","family":"Pach","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00e9za","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M., Szemer\u00e9di, E.: Crossing-free subgraphs. In: Theory and Practice of Combinatorics. North-Holland Mathematics Studies, vol. 60, pp. 9\u201312, North-Holland, Amsterdam (1982)","DOI":"10.1016\/S0304-0208(08)73484-4"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/PL00009354","volume":"19","author":"TK Dey","year":"1998","unstructured":"Dey, T.K.: Improved bounds on planar $$k$$-sets and related problems. Discrete Comput. Geom. 19, 373\u2013382 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Ellenberg, J. S., Solymosi, J., Zahl, J.: New bounds on curve tangencies and orthogonalities. Discrete Anal., Paper No. 18, 22 pp. (2016)","DOI":"10.19086\/da990"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-11440-3_1","volume-title":"WALCOM: Algorithms and Computation","author":"J Fox","year":"2010","unstructured":"Fox, J., Frati, F., Pach, J., Pinchasi, R.: Crossings between curves with many tangencies. In: Rahman, M.S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 1\u20138. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11440-3_1"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1017\/S0963548309990459","volume":"19","author":"J Fox","year":"2010","unstructured":"Fox, J., Pach, J.: A separator theorem for string graphs and its applications. Comb. Probab. Comput. 19, 371\u2013390 (2010)","journal-title":"Comb. Probab. Comput."},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0925-7721(00)00010-9","volume":"16","author":"A Garc\u00eda","year":"2000","unstructured":"Garc\u00eda, A., Noy, M., Tejel, J.: Lower bounds on the number of crossing-free subgraphs of $$K_n$$. Comput. Geom. 16(4), 211\u2013221 (2000)","journal-title":"Comput. Geom."},{"key":"13_CR7","volume-title":"Complexity Issues in VLSI, Foundations of Computing Series","author":"T Leighton","year":"1983","unstructured":"Leighton, T.: Complexity Issues in VLSI, Foundations of Computing Series. MIT Press, Cambridge (1983)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Pach, J., Rubin, N., Tardos, G.: Beyond the Richter-Thomassen Conjecture. In: Proceedings of 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, pp. 957\u2013968. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch68"},{"issue":"5","key":"13_CR9","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"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1017\/S0963548302005527","volume":"12","author":"M Sharir","year":"2003","unstructured":"Sharir, M.: The Clarkson-Shor technique revisited and extended. Comb. Prob. Comput. 12(2), 191\u2013201 (2003)","journal-title":"Comb. Prob. Comput."},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s00454-001-0009-z","volume":"25","author":"J Solymosi","year":"2001","unstructured":"Solymosi, J., T\u00f3th, C.D.: Distinct distances in the plane. Discrete Comput. Geom. 25(4), 629\u2013634 (2001)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1017\/S0963548397002976","volume":"6","author":"LA Sz\u00e9kely","year":"1997","unstructured":"Sz\u00e9kely, L.A.: Crossing numbers and hard Erd\u0151s problems in discrete geometry. Comb. Prob. Comput. 6(3), 353\u2013358 (1997)","journal-title":"Comb. Prob. Comput."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0021-9800(70)80007-2","volume":"8","author":"WT Tutte","year":"1970","unstructured":"Tutte, W.T.: Toward a theory of crossing numbers. J. Comb. Theory 8, 45\u201353 (1970)","journal-title":"J. Comb. Theory"}],"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-319-73915-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T07:22:55Z","timestamp":1710228175000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_13","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 January 2018","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":"Boston","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}