{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T17:35:23Z","timestamp":1696354523130},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T00:00:00Z","timestamp":1330128000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00373-012-1137-3","type":"journal-article","created":{"date-parts":[[2012,2,24]],"date-time":"2012-02-24T09:44:13Z","timestamp":1330076653000},"page":"365-371","source":"Crossref","is-referenced-by-count":1,"title":["Improvement on the Decay of Crossing Numbers"],"prefix":"10.1007","volume":"29","author":[{"given":"Jakub","family":"\u010cern\u00fd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kyn\u010dl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9za","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,25]]},"reference":[{"key":"1137_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s003730200002","volume":"18","author":"N. Alon","year":"2002","unstructured":"Alon N., Hoory S., Linial N.: The Moore bound for irregular graphs. Graphs Combin 18, 53\u201357 (2002)","journal-title":"Graphs Combin"},{"key":"1137_CR2","doi-asserted-by":"crossref","unstructured":"\u010cern\u00fd, J., Kyn\u010dl, J., T\u00f3th, G.: Improvement on the decay of crossing numbers. In: Proceedings of the 15th International Symposium on Graph Drawing (Graph Drawing 2007). Lecture Notes in Computer Science, vol. 4875, pp. 25\u201330. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-77537-9_5"},{"issue":"1","key":"1137_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.jctb.2007.03.005","volume":"98","author":"J. Fox","year":"2008","unstructured":"Fox J., T\u00f3th Cs: On the decay of crossing numbers. J. Combin. Theory Ser B 98(1), 33\u201342 (2008)","journal-title":"J. Combin. Theory Ser B"},{"key":"1137_CR4","volume-title":"Complexity Issues in VLSI","author":"T. Leighton","year":"1983","unstructured":"Leighton T.: Complexity Issues in VLSI. MIT Press, Cambridge (1983)"},{"key":"1137_CR5","unstructured":"Pach, J., Radoi\u010di\u0107, R., Tardos, G., T\u00f3th, G.: Improving the Crossing Lemma by finding more crossings in sparse graphs. In: Proceedings of the 19th ACM Symposium on Computational Geometry, pp. 68\u201375 (2004) [Also in Discrete Comput. Geom. 36, 527\u2013552 (2006)]"},{"key":"1137_CR6","first-page":"194","volume":"9","author":"J. Pach","year":"2000","unstructured":"Pach J., T\u00f3th G.: Thirteen problems on crossing numbers. Geombinatorics 9, 194\u2013207 (2000)","journal-title":"Geombinatorics"},{"key":"1137_CR7","doi-asserted-by":"crossref","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. B 58, 217\u2013224 (1993)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1137_CR8","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L., Vrt\u2019o, I.: Crossing numbers: bounds and applications. In: Intuitive Geometry (Budapest, 1995), vol. 6, pp. 179\u2013206. Bolyai Society Mathematical Studies,Budapest (1997)"},{"key":"1137_CR9","doi-asserted-by":"crossref","unstructured":"Sz\u00e9kely, L.: Short proof for a theorem of Pach, Spencer, and T\u00f3th. In: Towards a Theory of Geometric Graphs. Contemporary Mathematics, vol. 342, pp. 281\u2013283. AMS, Providence (2004)","DOI":"10.1090\/conm\/342\/06149"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1137-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1137-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1137-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T06:15:09Z","timestamp":1561356909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1137-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,25]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["1137"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1137-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,25]]}}}