{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:03Z","timestamp":1740107103856,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871206"],"award-info":[{"award-number":["11871206"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["2020JJ5095"],"award-info":[{"award-number":["2020JJ5095"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014472","name":"Scientific Research Foundation of Hunan Provincial Education Department","doi-asserted-by":"publisher","award":["19B116"],"award-info":[{"award-number":["19B116"]}],"id":[{"id":"10.13039\/100014472","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00373-021-02361-2","type":"journal-article","created":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T16:02:41Z","timestamp":1624723361000},"page":"2351-2363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Note on the Crossing Number of the Cone of a Graph"],"prefix":"10.1007","volume":"37","author":[{"given":"Zongpeng","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanqiu","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,26]]},"reference":[{"key":"2361_CR1","doi-asserted-by":"publisher","first-page":"2080","DOI":"10.1137\/17M1115320","volume":"32","author":"CA Alfaro","year":"2018","unstructured":"Alfaro, C.A., Arroyo, A., Der\u0148\u00e1r, M., Mohar, B.: The crossing number of the cone of a graph. SIAM J. Discrete Math. 32, 2080\u20132093 (2018)","journal-title":"SIAM J. Discrete Math."},{"key":"2361_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory, GTM 244","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, GTM 244. Springer, Berlin (2008)"},{"key":"2361_CR3","first-page":"210","volume-title":"Graph Drawing","author":"MJ Bannister","year":"2014","unstructured":"Bannister, M.J., Eppstein, D.: Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth. In: Duncan, C., Symvonis, A. (eds.) Graph Drawing, pp. 210\u2013221. Springer, Berlin (2014)"},{"key":"2361_CR4","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"SN Bhatt","year":"1984","unstructured":"Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28, 300\u2013343 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"2361_CR5","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1016\/j.disc.2007.12.078","volume":"309","author":"M Chimani","year":"2009","unstructured":"Chimani, M., Gutwenger, C.: Non-planar core reduction of graphs. Discrete Math. 309, 1838\u20131855 (2009)","journal-title":"Discrete Math."},{"issue":"1","key":"2361_CR6","first-page":"37","volume":"52","author":"W Didimo","year":"2019","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. ACM Comput. Sur. 52(1), 37 (2019). (Article 4)","journal-title":"ACM Comput. Sur."},{"key":"2361_CR7","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1137\/120886777","volume":"27","author":"E de Klerk","year":"2013","unstructured":"de Klerk, E., Pasechnik, D.V., Salazar, G.: Improved lower bounds on book crossing numbers of complete graphs. SIAM J. Discrete Math. 27, 619\u2013633 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"2361_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00032","volume":"5","author":"A Liebers","year":"2001","unstructured":"Liebers, A.: Planarizing graphs\u2014a survey and annotated bibliography. J. Graph Algorithms Appl. 5, 1\u201374 (2001)","journal-title":"J. Graph Algorithms Appl."},{"key":"2361_CR9","volume-title":"Crossing Numbers of Graphs","author":"M Schaefer","year":"2017","unstructured":"Schaefer, M.: Crossing Numbers of Graphs. CRC Press, Boca Roton (2017)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02361-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02361-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02361-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T21:28:24Z","timestamp":1636838904000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02361-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,26]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["2361"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02361-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,6,26]]},"assertion":[{"value":"25 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}