{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:33Z","timestamp":1720640853041},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80187-8","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T07:08:52Z","timestamp":1114931332000},"page":"284-287","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A successful concept for measuring non-planarity of graphs: the crossing number"],"prefix":"10.1016","volume":"5","author":[{"given":"L\u00e1szl\u00f3 A.","family":"Sz\u00e9kely","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80187-8_BIB1","first-page":"9","article-title":"Crossing-free subgraphs","volume":"12","author":"Ajtai","year":"1982","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S1571-0653(05)80187-8_BIB2","first-page":"312","article-title":"Crossing number is NP-complete, SIAM J. Alg.","volume":"4","author":"Garey","year":"1983","journal-title":"Discrete Methods"},{"key":"10.1016\/S1571-0653(05)80187-8_BIB3","series-title":"Proof Techniques in Graph Theory","first-page":"63","article-title":"The decline and fall of Zarankiewicz's theorem","author":"Guy","year":"1969"},{"key":"10.1016\/S1571-0653(05)80187-8_BIB4","unstructured":"R. K. Guy, Mathematical Reviews 58 # 21749"},{"key":"10.1016\/S1571-0653(05)80187-8_BIB5","first-page":"58","article-title":"Toroidal graphs with arbitrary high crossing numbers","volume":"6","author":"Harary","year":"1973","journal-title":"Nanta Math."},{"key":"10.1016\/S1571-0653(05)80187-8_BIB6","series-title":"The logic of mathematical discovery","article-title":"Proofs and Refutations","author":"Lakatos","year":"1976"},{"key":"10.1016\/S1571-0653(05)80187-8_BIB7","author":"Leighton","year":"1983","journal-title":"Complexity Issues in VLSI, MIT Press, Cambridge"},{"key":"10.1016\/S1571-0653(05)80187-8_BIB8","series-title":"Proc. 39th Annual Symposium on Foundation of Computer Science","first-page":"617","article-title":"Which crossing number is it anyway?","author":"Pach","year":"1998"},{"key":"10.1016\/S1571-0653(05)80187-8_BIB9","first-page":"179","article-title":"Crossing numbers: bounds and applications","volume":"6","author":"Shahrokhi","year":"1997"},{"key":"10.1016\/S1571-0653(05)80187-8_BIB10","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02579194","article-title":"Extremal problems in discrete geometry","volume":"3","author":"Szemeredi","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/S1571-0653(05)80187-8_BIB11","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1017\/S0963548397002976","article-title":"Crossing numbers and hard Erdos problems in discrete geometry","volume":"6","author":"Szekely","year":"1997","journal-title":"Combinatorics, Probability, and Computing"},{"key":"10.1016\/S1571-0653(05)80187-8_BIB12","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1002\/jgt.3190010105","article-title":"A note of welcome","volume":"1","author":"Turan","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(05)80187-8_BIB13","series-title":"Selected Topics in Graph Theory","first-page":"15","article-title":"Topological graph theory","author":"White","year":"1978"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801878?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801878?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T14:57:46Z","timestamp":1548514666000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801878"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":13,"alternative-id":["S1571065305801878"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80187-8","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}