{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:02:12Z","timestamp":1725562932012},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_5","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"38-41","source":"Crossref","is-referenced-by-count":1,"title":["Do We Really Understand the Crossing Numbers?"],"prefix":"10.1007","author":[{"given":"Bojan","family":"Mohar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"S.N. Bhatt","year":"1984","unstructured":"Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. System Sci.\u00a028, 300\u2013343 (1984)","journal-title":"J. Comput. System Sci."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1002\/jgt.3190170308","volume":"17","author":"D. Bienstock","year":"1993","unstructured":"Bienstock, D., Dean, N.: Bounds for rectilinear crossing numbers. J. Graph Theory\u00a017, 333\u2013348 (1993)","journal-title":"J. Graph Theory"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1137\/05062706X","volume":"20","author":"D. Bokal","year":"2006","unstructured":"Bokal, D., Fijav\u017e, G., Mohar, B.: The minor crossing number. SIAM J. Discret. Math.\u00a020(2), 344\u2013356 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-00219-9_5","volume-title":"Graph Drawing","author":"C. Cabello","year":"2009","unstructured":"Cabello, C., Mohar, B.: Crossing and weighted crossing number of near-planar graphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 38\u201349. Springer, Heidelberg (2009)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Cabello, C., Mohar, B.: Adding one edge to planar graphs makes crossing number hard. In: SoCG 2010 (2010)","DOI":"10.1145\/1810959.1810972"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Alg. Discr. Meth.\u00a04, 312\u2013316 (1983)","journal-title":"SIAM J. Alg. Discr. Meth."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Grohe, M.: Computing crossing numbers in quadratic time. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing, Hersonissos, Greece, pp. 231\u2013236 (July 2001), doi:10.1145\/380752.380805","DOI":"10.1145\/380752.380805"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Reed, B.: Computing crossing number in linear time. In: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, San Diego, California, USA, June 11-13 (2007), doi:10.1145\/1250790.1250848.","DOI":"10.1145\/1250790.1250848"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00453-004-1128-8","volume":"41","author":"C. Gutwenger","year":"2005","unstructured":"Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. Algorithmica\u00a041, 289\u2013308 (2005)","journal-title":"Algorithmica"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-70904-6_17","volume-title":"Graph Drawing","author":"P. Hlin\u011bn\u00fd","year":"2007","unstructured":"Hlin\u011bn\u00fd, P., Salazar, G.: On the crossing number of almost planar graphs. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 162\u2013173. Springer, Heidelberg (2007)"},{"key":"5_CR11","volume-title":"Complexity issues in VLSI","author":"F.T. Leighton","year":"1983","unstructured":"Leighton, F.T.: Complexity issues in VLSI. MIT Press, Cambridge (1983)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01744433","volume":"17","author":"F.T. Leighton","year":"1984","unstructured":"Leighton, F.T.: New lower bound techniques for VLSI. Math. Systems Theory\u00a017, 47\u201370 (1984)","journal-title":"Math. Systems Theory"},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"74","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.\u00a05, 74 pages (2001)","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR14","first-page":"301","volume":"30","author":"B. Mohar","year":"2006","unstructured":"Mohar, B.: On the crossing number of almost planar graphs. Informatica\u00a030, 301\u2013303 (2006)","journal-title":"Informatica"},{"key":"5_CR15","unstructured":"Mohar, B., Stephen, T.: The expected crossing number for random edge-weights (in preparation)"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/11618058_35","volume-title":"Graph Drawing","author":"M.J. Pelsmajer","year":"2006","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Odd Crossing Number Is Not Crossing Number. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 386\u2013396. Springer, Heidelberg (2006)"},{"key":"5_CR17","first-page":"405","volume":"31","author":"A. Riskin","year":"1996","unstructured":"Riskin, A.: The crossing number of a cubic plane polyhedral map plus an edge. Studia Sci. Math. Hungar.\u00a031, 405\u2013413 (1996)","journal-title":"Studia Sci. Math. Hungar."},{"key":"5_CR18","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L.A., Vrt\u2019o, I.: Crossing numbers: bounds and applications. In: Barany, I., B\u00f6r\u00f6czky, K. (eds.) Intuitive geometry (Budapest, 1995). Bolyai Society Mathematical Studies, vol.\u00a06, pp. 179\u2013206. Akademia Kiado (1997)"},{"key":"5_CR19","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":"5_CR20","unstructured":"Vrt\u2019o, I.: Crossing number of graphs: A bibliography, \n                  \n                    ftp:\/\/ftp.ifi.savba.sk\/pub\/imrich\/crobib.pdf"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:47Z","timestamp":1606186907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}