{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:37:41Z","timestamp":1760441861041},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_33","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T02:23:04Z","timestamp":1323915784000},"page":"343-354","source":"Crossref","is-referenced-by-count":0,"title":["Adjacent Crossings Do Matter"],"prefix":"10.1007","author":[{"given":"Radoslav","family":"Fulek","sequence":"first","affiliation":[]},{"given":"Michael J.","family":"Pelsmajer","sequence":"additional","affiliation":[]},{"given":"Marcus","family":"Schaefer","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","volume-title":"Research Problems in Discrete Geometry","author":"P. Brass","year":"2005","unstructured":"Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Fulek, R., Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Hanani-Tutte, monotone drawings, and level-planarity. Accepted for WG (2011)","DOI":"10.1007\/978-3-642-25870-1_26"},{"key":"33_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.4064\/fm-23-1-135-142","volume":"23","author":"C. Chojnacki","year":"1934","unstructured":"Chojnacki, C., Hanani, H.: \u00dcber wesentlich unpl\u00e4ttbare Kurven im drei-dimensionalen Raume. Fundamenta Mathematicae\u00a023, 135\u2013142 (1934)","journal-title":"Fundamenta Mathematicae"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0095-8956(72)90042-1","volume":"12","author":"P.C. Kainen","year":"1972","unstructured":"Kainen, P.C.: A lower bound for crossing numbers of graphs with applications to K n , K p, q , and Q(d). J. Combinatorial Theory Ser. B\u00a012, 287\u2013298 (1972)","journal-title":"J. Combinatorial Theory Ser. B"},{"issue":"4","key":"33_CR5","first-page":"194","volume":"9","author":"J. Pach","year":"2000","unstructured":"Pach, J., T\u00f3th, G.: Thirteen problems on crossing numbers. Geombinatorics\u00a09(4), 194\u2013207 (2000)","journal-title":"Geombinatorics"},{"issue":"2","key":"33_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1006\/jctb.2000.1978","volume":"80","author":"J. Pach","year":"2000","unstructured":"Pach, J., T\u00f3th, G.: Which crossing number is it anyway? J. Combin. Theory Ser. B\u00a080(2), 225\u2013246 (2000)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"33_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/jgt.10168","volume":"46","author":"J. Pach","year":"2004","unstructured":"Pach, J., T\u00f3th, G.: Monotone drawings of planar graphs. J. Graph Theory\u00a046(1), 39\u201347 (2004)","journal-title":"J. Graph Theory"},{"issue":"3","key":"33_CR8","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1137\/08072485X","volume":"23","author":"M.J. Pelsmajer","year":"2009","unstructured":"Pelsmajer, M.J., Schaefer, M., Stasi, D.: Strong Hanani\u2013Tutte on the projective plane. SIAM Journal on Discrete Mathematics\u00a023(3), 1317\u20131323 (2009)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"33_CR9","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.jctb.2006.08.001","volume":"97","author":"M.J. Pelsmajer","year":"2007","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Removing even crossings. J. Combin. Theory Ser. B\u00a097(4), 489\u2013500 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"33_CR10","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s00454-008-9058-x","volume":"39","author":"M.J. Pelsmajer","year":"2008","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Odd crossing number and crossing number are not the same. Discrete Comput. Geom.\u00a039(1), 442\u2013454 (2008)","journal-title":"Discrete Comput. Geom."},{"issue":"7","key":"33_CR11","doi-asserted-by":"publisher","first-page":"1704","DOI":"10.1016\/j.ejc.2009.03.002","volume":"30","author":"M.J. Pelsmajer","year":"2009","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Removing even crossings on surfaces. European Journal of Combinatorics\u00a030(7), 1704\u20131717 (2009)","journal-title":"European Journal of Combinatorics"},{"issue":"2","key":"33_CR12","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1137\/090765729","volume":"24","author":"M.J. Pelsmajer","year":"2010","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Removing independently even crossings. SIAM Journal on Discrete Mathematics\u00a024(2), 379\u2013393 (2010)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s00453-009-9343-y","volume":"60","author":"M.J. Pelsmajer","year":"2011","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Crossing numbers of graphs with rotation systems. Algorithmica\u00a060, 679\u2013702 (2011), doi:10.1007\/s00453-009-9343-y","journal-title":"Algorithmica"},{"issue":"1-3","key":"33_CR14","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(1-3), 331\u2013352 (2004)","journal-title":"Discrete Math."},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-30577-4_8","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"L.A. Sz\u00e9kely","year":"2005","unstructured":"Sz\u00e9kely, L.A.: Progress on Crossing Number Problems. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 53\u201361. Springer, Heidelberg (2005)"},{"issue":"1","key":"33_CR16","doi-asserted-by":"crossref","first-page":"32","DOI":"10.26493\/1855-3974.43.506","volume":"1","author":"L.A. Sz\u00e9kely","year":"2008","unstructured":"Sz\u00e9kely, L.A.: An optimality criterion for the crossing number. Ars Math. Contemp.\u00a01(1), 32\u201337 (2008)","journal-title":"Ars Math. Contemp."},{"issue":"4","key":"33_CR17","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s00454-007-9024-z","volume":"39","author":"G. T\u00f3th","year":"2008","unstructured":"T\u00f3th, G.: Note on the pair-crossing number and the odd-crossing number. Discrete Comput. Geom.\u00a039(4), 791\u2013799 (2008)","journal-title":"Discrete Comput. Geom."},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0021-9800(70)80007-2","volume":"8","author":"W.T. Tutte","year":"1970","unstructured":"Tutte, W.T.: Toward a theory of crossing numbers. J. Combinatorial Theory\u00a08, 45\u201353 (1970)","journal-title":"J. Combinatorial Theory"},{"key":"33_CR19","series-title":"Math. Sci. Res. Inst. Publ.","first-page":"569","volume-title":"Combinatorial and Computational Geometry","author":"P. Valtr","year":"2005","unstructured":"Valtr, P.: On the pair-crossing number. In: Combinatorial and Computational Geometry. Math. Sci. Res. Inst. Publ., vol.\u00a052, pp. 569\u2013575. Cambridge University Press, Cambridge (2005)"},{"key":"33_CR20","unstructured":"West, D.: Open problems - graph theory and combinatorics, http:\/\/www.math.uiuc.edu\/~west\/openp\/ (accessed April 7, 2005)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T23:29:34Z","timestamp":1561073374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}