{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:40Z","timestamp":1725512020477},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709039"},{"type":"electronic","value":"9783540709046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70904-6_18","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T11:44:43Z","timestamp":1179402283000},"page":"174-183","source":"Crossref","is-referenced-by-count":2,"title":["On the Decay of Crossing Numbers"],"prefix":"10.1007","author":[{"given":"Jacob","family":"Fox","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Mathematical Studies","first-page":"9","volume-title":"Theory and Practice of Combinatorics","author":"M. Ajtai","year":"1982","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M., Szemer\u00e9di, E.: Crossing-free subgraphs. In: Theory and Practice of Combinatorics. Mathematical Studies, vol.\u00a060, pp. 9\u201312. North-Holland, Amsterdam (1982)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579234","volume":"2","author":"P. Erd\u0151s","year":"1982","unstructured":"Erd\u0151s, P., Simonovits, M.: Compactness results in extremal graph theory. Combinatorica\u00a02, 275\u2013288 (1982)","journal-title":"Combinatorica"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/3-540-52921-7_83","volume-title":"Algorithms","author":"H. Gazit","year":"1990","unstructured":"Gazit, H., Miller, G.L.: Planar separators and the Euclidean norm. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol.\u00a0450, pp. 338\u2013347. Springer, Heidelberg (1990)"},{"key":"18_CR4","volume-title":"Complexity Issues in VLSI","author":"T. Leighton","year":"1983","unstructured":"Leighton, T.: Complexity Issues in VLSI. MIT Press, Cambridge (1983)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01744433","volume":"17","author":"T. Leighton","year":"1984","unstructured":"Leighton, T.: New lower bound techniques for VLSI. Math. Systems Theory\u00a017, 47\u201370 (1984)","journal-title":"Math. Systems Theory"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math.\u00a036, 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica\u00a07, 583\u2013596 (1992)","journal-title":"Algorithmica"},{"key":"18_CR8","first-page":"68","volume-title":"20th ACM Symposium on Computational Geometry","author":"J. Pach","year":"2004","unstructured":"Pach, J., Radoi\u010di\u0107, R., Tardos, G., T\u00f3th, G.: Improving the Crossing Lemma by finding more crossings in sparse graphs. In: 20th ACM Symposium on Computational Geometry, pp. 68\u201375. ACM Press, New York (2004)"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02086610","volume":"16","author":"J. Pach","year":"1996","unstructured":"Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. Algorithmica\u00a016, 111\u2013117 (1996)","journal-title":"Algorithmica"},{"key":"18_CR10","unstructured":"Pach, J., Solymosi, J., Tardos, G.: Crossing numbers of imbalanced graphs. Lecture presented at SIAM Conf. Discrete Math., Victoria, BC (2006)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s004540010050","volume":"24","author":"J. Pach","year":"2000","unstructured":"Pach, J., Spencer, J., T\u00f3th, G.: New bounds on crossing numbers. Discrete Comput. Geom.\u00a024, 623\u2013644 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"18_CR12","first-page":"194","volume":"9","author":"J. Pach","year":"2000","unstructured":"Pach, J., T\u00f3th, G.: Thirteen problems on crossing numbers. Geombinatorics\u00a09, 194\u2013207 (2000)","journal-title":"Geombinatorics"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1006\/jctb.1993.1038","volume":"58","author":"B. Richter","year":"1993","unstructured":"Richter, B., Thomassen, C.: Minimal graphs with crossing number at least k. J. Combin. Theory Ser.\u00a0B\u00a058, 217\u2013224 (1993)","journal-title":"J. Combin. Theory Ser.\u00a0B"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1006\/jctb.1999.1943","volume":"79","author":"G. Salazar","year":"2000","unstructured":"Salazar, G.: On a crossing number result of Richter and Thomassen. J. Combin. Theory Ser.\u00a0B\u00a079, 98\u201399 (2000)","journal-title":"J. Combin. Theory Ser.\u00a0B"},{"key":"18_CR15","series-title":"Bolyai Soc. Math. Stud","first-page":"179","volume-title":"Intuitive geometry (Budapest, 1995)","author":"F. Shahrokhi","year":"1997","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L.A., Vrt\u2019o, I.: Crossing numbers: bounds and applications. In: Intuitive geometry (Budapest, 1995). Bolyai Soc. Math. Stud, vol.\u00a06, pp. 179\u2013206. J\u00e1nos Bolyai Math. Soc., Budapest (1997)"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0012-365X(03)00317-0","volume":"276","author":"L.A. Sz\u00e9kely","year":"2004","unstructured":"Sz\u00e9kely, L.A.: A successful concept for measuring non-planarity of graphs: the crossing number. Discrete Math.\u00a0276, 331\u2013352 (2004)","journal-title":"Discrete Math."},{"key":"18_CR17","series-title":"Contemp. Math","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1090\/conm\/342\/06149","volume-title":"Towards a theory of geometric graphs","author":"L.A. Sz\u00e9kely","year":"2004","unstructured":"Sz\u00e9kely, L.A.: Short proof for a theorem of Pach, Spencer, and T\u00f3th. In: Towards a theory of geometric graphs. Contemp. Math, vol.\u00a0342, pp. 281\u2013283. AMS, Providence (2004)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70904-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:11:26Z","timestamp":1605744686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70904-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709039","9783540709046"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70904-6_18","relation":{},"subject":[]}}