{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:32Z","timestamp":1725548972012},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642118043"},{"type":"electronic","value":"9783642118050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11805-0_20","type":"book-chapter","created":{"date-parts":[[2010,3,5]],"date-time":"2010-03-05T02:45:33Z","timestamp":1267757133000},"page":"201-206","source":"Crossref","is-referenced-by-count":1,"title":["Removing Independently Even Crossings"],"prefix":"10.1007","author":[{"given":"Michael J.","family":"Pelsmajer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Schaefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_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":"20_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.4064\/fm-23-1-135-142","volume":"23","author":"C. Chojnacki","year":"1934","unstructured":"Chojnacki (Haim Hanani), C.: \u00dcber wesentlich unpl\u00e4ttbare Kurven im drei-dimensionalen Raume. Fundamenta Mathematicae\u00a023, 135\u2013142 (1934)","journal-title":"Fundamenta Mathematicae"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s00493-008-2150-2","volume":"28","author":"S. Norine","year":"2008","unstructured":"Norine, S.: Pfaffian graphs, T-joins and crossing numbers. Combinatorica\u00a028(1), 89\u201398 (2008)","journal-title":"Combinatorica"},{"key":"20_CR4","series-title":"Mathematical Surveys and Monographs","volume-title":"Combinatorial geometry and its algorithmic applications: The Alcal\u00e1 lectures","author":"J. Pach","year":"2009","unstructured":"Pach, J., Sharir, M.: Combinatorial geometry and its algorithmic applications: The Alcal\u00e1 lectures. Mathematical Surveys and Monographs, vol.\u00a0152. American Mathematical Society, Providence (2009)"},{"issue":"4","key":"20_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":"20_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":"3","key":"20_CR7","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":"20_CR8","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"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-77537-9_3","volume-title":"Graph Drawing","author":"M.J. Pelsmajer","year":"2008","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Crossing number of graphs with rotation systems. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 3\u201312. Springer, Heidelberg (2008)"},{"issue":"7","key":"20_CR10","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"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-77537-9_6","volume-title":"Graph Drawing","author":"M.J. Pelsmajer","year":"2008","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Crossing numbers and parameterized complexity. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 31\u201336. Springer, Heidelberg (2008)"},{"issue":"1","key":"20_CR12","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":"1-3","key":"20_CR13","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."},{"issue":"1","key":"20_CR14","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."},{"key":"20_CR15","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511755149","volume-title":"Additive combinatorics","author":"T. Tao","year":"2006","unstructured":"Tao, T., Vu, V.: Additive combinatorics. Cambridge Studies in Advanced Mathematics, vol.\u00a0105. Cambridge University Press, Cambridge (2006)"},{"issue":"4","key":"20_CR16","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":"20_CR17","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":"20_CR18","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)"},{"issue":"8","key":"20_CR19","doi-asserted-by":"publisher","first-page":"2156","DOI":"10.1016\/j.ejc.2007.04.005","volume":"28","author":"H. Holst van der","year":"2007","unstructured":"van der Holst, H.: Algebraic characterizations of outerplanar and planar graphs. European J. Combin.\u00a028(8), 2156\u20132166 (2007)","journal-title":"European J. Combin."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11805-0_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:44:00Z","timestamp":1606167840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11805-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642118043","9783642118050"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11805-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}