{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:34Z","timestamp":1750307374416,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,13]]},"DOI":"10.1145\/1810959.1810972","type":"proceedings-article","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T13:11:04Z","timestamp":1276607464000},"page":"68-76","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Adding one edge to planar graphs makes crossing number hard"],"prefix":"10.1145","author":[{"given":"Sergio","family":"Cabello","sequence":"first","affiliation":[{"name":"University of Ljubljana, Ljubljana, Slovenia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054106004236"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9357-5"},{"volume-title":"Proc. SODA","year":"2010","author":"Chimani M.","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","unstructured":"M. Chimani P. Hlinen\u00fd and P. Mutzel. Vertex insertion approximates the crossing number for apex graphs. Manuscript available at http:\/\/www.fi.muni.cz\/~hlineny\/Research\/papers\/. Preliminary version in Graph Drawing 2008.  M. Chimani P. Hlinen\u00fd and P. Mutzel. Vertex insertion approximates the crossing number for apex graphs. Manuscript available at http:\/\/www.fi.muni.cz\/~hlineny\/Research\/papers\/. Preliminary version in Graph Drawing 2008."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_37"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0604033"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380805"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1128-8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.09.009"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"P.\n       \n      Hlinen\u00fd\n     and \n      \n      \n      G.\n       \n      Salazar\n      \n  \n  . \n  On the crossing number of almost planar graphs. In M. Kaufmann and D. Wagner editors GD\n   \n  2006 volume \n  4372\n   of \n  LNCS pages \n  162\n  --\n  173\n  . \n  Springer 2007.   P. Hlinen\u00fd and G. Salazar. On the crossing number of almost planar graphs. In M. Kaufmann and D. Wagner editors GD 2006 volume 4372 of LNCS pages 162--173. Springer 2007.","DOI":"10.1007\/978-3-540-70904-6_17"},{"key":"e_1_3_2_1_11_1","first-page":"148","volume-title":"ISAAC 2007","volume":"4835","author":"Hlinen\u00fd P.","year":"2007"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250848"},{"key":"e_1_3_2_1_13_1","first-page":"301","article-title":"On the crossing number of almost planar graphs","volume":"30","author":"Mohar B.","year":"2006","journal-title":"Informatica"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"M. J. Pelsmajer M. Schaefer and D. \u0160tefankovic. Crossing number of graphs with rotation systems. Algorithmica accepted. Available at http:\/\/dx.doi.org\/10.1007\/s00453-009-9343-y.  M. J. Pelsmajer M. Schaefer and D. \u0160tefankovic. Crossing number of graphs with rotation systems. Algorithmica accepted. Available at http:\/\/dx.doi.org\/10.1007\/s00453-009-9343-y.","DOI":"10.1007\/s00453-009-9343-y"},{"key":"e_1_3_2_1_15_1","first-page":"405","article-title":"The crossing number of a cubic plane polyhedral map plus an edge","volume":"31","author":"Riskin A.","year":"1996","journal-title":"Studia Sci. Math. Hungar."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-009-2407-4"}],"event":{"name":"SoCG '10: Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Snowbird Utah USA","acronym":"SoCG '10"},"container-title":["Proceedings of the twenty-sixth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810959.1810972","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810959.1810972","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:23:01Z","timestamp":1750245781000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810959.1810972"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":16,"alternative-id":["10.1145\/1810959.1810972","10.1145\/1810959"],"URL":"https:\/\/doi.org\/10.1145\/1810959.1810972","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}