{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T14:44:19Z","timestamp":1775486659072,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642258770","type":"print"},{"value":"9783642258787","type":"electronic"}],"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_27","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T21:23:04Z","timestamp":1323897784000},"page":"278-289","source":"Crossref","is-referenced-by-count":4,"title":["Monotone Crossing Number"],"prefix":"10.1007","author":[{"given":"J\u00e1nos","family":"Pach","sequence":"first","affiliation":[]},{"given":"G\u00e9za","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","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"},{"key":"27_CR2","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Berlin (2005)","edition":"3"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"52","DOI":"10.2307\/2319261","volume":"80","author":"P. Erd\u0151s","year":"1973","unstructured":"Erd\u0151s, P., Guy, R.K.: Crossing number problems, Amer. Math. Monthly\u00a080, 52\u201358 (1973)","journal-title":"Math. Monthly"},{"key":"27_CR4","first-page":"229","volume":"11","author":"I. F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight line representation of planar graphs. Acta Univ. Szeged. Sect. Sci. Math.\u00a011, 229\u2013233 (1948)","journal-title":"Acta Univ. Szeged. Sect. Sci. Math."},{"key":"27_CR5","unstructured":"Fulek, R., Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Hanani-Tutte, monotone drawings, and level-planarity (to appear)"},{"key":"27_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. Disc. Meth.\u00a04, 312\u2013316 (1983)","journal-title":"Alg. Disc. Meth."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theoretical Computer Science\u00a01, 237\u2013267 (1976)","journal-title":"Theoretical Computer Science"},{"key":"27_CR8","first-page":"63","volume-title":"Proof Techniques in Graph Theory","author":"R.K. Guy","year":"1969","unstructured":"Guy, R.K.: The decline and fall of Zarankiewicz\u2019s theorem. In: Guy, R.K. (ed.) Proof Techniques in Graph Theory, pp. 63\u201369. Academic Press, New York (1969)"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"544","DOI":"10.4169\/amer.math.monthly.118.06.544","volume":"118","author":"J. Pach","year":"2011","unstructured":"Pach, J., Sterling, E.: Conways conjecture for monotone thrackles. Amer. Math. Monthly\u00a0118, 544\u2013548 (2011)","journal-title":"Amer. Math. Monthly"},{"key":"27_CR10","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, 225\u2013246 (2000)","journal-title":"J. Combin. Theory Ser. B"},{"key":"27_CR11","first-page":"194","volume":"9","author":"J. Pach","year":"2000","unstructured":"Pach, J., T\u00f3th, G.: Thirteen problems on crossing numbers. Geombinatorics\u00a09, 194\u2013207 (2000)","journal-title":"Geombinatorics"},{"key":"27_CR12","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, 39\u201347 (2004)","journal-title":"J. Graph Theory"},{"key":"27_CR13","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, 442\u2013454 (2008)","journal-title":"Discrete Comput. Geom."},{"key":"27_CR14","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.: Removin independently even crossings. SIAM J. Discrete Math.\u00a024, 379\u2013393 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"27_CR15","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, 791\u2013799 (2008)","journal-title":"Discrete Comput. Geom."},{"key":"27_CR16","unstructured":"T\u00f3th, G.: A better bound for the pair-crossing number (manuscript)"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1002\/jgt.3190010105","volume":"1","author":"P. Tur\u00e1n","year":"1977","unstructured":"Tur\u00e1n, P.: A note of welcome. J. Graph Theory\u00a01, 7\u20139 (1977)","journal-title":"J. Graph Theory"},{"key":"27_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":"27_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 Univ. Press, Cambridge (2005)"},{"key":"27_CR20","unstructured":"Woodall, D.R.: Thrackles and deadlock. In: Welsh, D.J.A. (ed.) Combinatorial Mathematics and Its Applications, pp. 335\u2013348. Academic Press (1969)"}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T20:36:36Z","timestamp":1555878996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}