{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:44Z","timestamp":1725524624622},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_5","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"38-49","source":"Crossref","is-referenced-by-count":5,"title":["Crossing and Weighted Crossing Number of Near-Planar Graphs"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Cabello","sequence":"first","affiliation":[]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","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(2), 300\u2013343 (1984)","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"5_CR2","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_CR3","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_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"5_CR5","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_CR6","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_CR7","first-page":"85","volume":"47","author":"M. Juvan","year":"1997","unstructured":"Juvan, M., Marin\u010dek, J., Mohar, B.: Elimination of local bridges. Math. Slovaca\u00a047, 85\u201392 (1997)","journal-title":"Math. Slovaca"},{"key":"5_CR8","volume-title":"Complexity issues in VLSI","author":"F.T. Leighton","year":"1983","unstructured":"Leighton, F.T.: Complexity issues in VLSI. MIT Press, MA (1983)"},{"key":"5_CR9","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_CR10","doi-asserted-by":"publisher","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, 74pp. (2001)","journal-title":"J. Graph Algorithms Appl."},{"issue":"5&6","key":"5_CR11","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/BF01758776","volume":"7","author":"B. Mishra","year":"1992","unstructured":"Mishra, B., Tarjan, R.E.: A linear-time algorithm for finding an ambitus. Algorithmica\u00a07(5&6), 521\u2013554 (1992)","journal-title":"Algorithmica"},{"key":"5_CR12","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B. Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins University Press, Baltimore (2001)"},{"key":"5_CR13","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_CR14","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_CR15","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_CR16","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_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(75)90032-1","volume":"12","author":"W.T. Tutte","year":"1975","unstructured":"Tutte, W.T.: Separation of vertices by a circuit. Discrete Math.\u00a012, 173\u2013184 (1975)","journal-title":"Discrete Math."},{"key":"5_CR18","unstructured":"Vrt\u2019o, I.: Crossing number of graphs: A bibliography, ftp:\/\/ftp.ifi.savba.sk\/pub\/imrich\/crobib.pdf"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T17:28:21Z","timestamp":1684862901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}