{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:31:59Z","timestamp":1766377919766,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T00:00:00Z","timestamp":1545177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T00:00:00Z","timestamp":1545177600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["200021-165977","200020-162884"],"award-info":[{"award-number":["200021-165977","200020-162884"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Leibnitz Center for Informatics"},{"name":"Leibnitz Center for Informatics"},{"name":"NKIFH","award":["K-111827"],"award-info":[{"award-number":["K-111827"]}]},{"name":"TAMOP","award":["T\u00c1MOP-4.2.1\/B-09\/1\/KMR-2010-0002"],"award-info":[{"award-number":["T\u00c1MOP-4.2.1\/B-09\/1\/KMR-2010-0002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00454-018-00052-z","type":"journal-article","created":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T16:54:11Z","timestamp":1545238451000},"page":"918-933","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Crossing Lemma for Multigraphs"],"prefix":"10.1007","volume":"63","author":[{"given":"J\u00e1nos","family":"Pach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1751-6911","authenticated-orcid":false,"given":"G\u00e9za","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,19]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M.N., Szemer\u00e9di, E.: Crossing-free subgraphs. In: Theory and Practice of Combinatorics. North-Holland Mathematics Studies, vol. 60, pp. 9\u201312. North-Holland, Amsterdam (1982)","key":"52_CR1","DOI":"10.1016\/S0304-0208(08)73484-4"},{"issue":"2","key":"52_CR2","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/S0895480191198768","volume":"7","author":"N Alon","year":"1994","unstructured":"Alon, N., Seymour, P., Thomas, R.: Planar separators. SIAM J. Discrete Math. 7(2), 184\u2013193 (1994)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"52_CR3","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/PL00009354","volume":"19","author":"TL Dey","year":"1998","unstructured":"Dey, T.L.: Improved bounds for planar $k$-sets and related problems. Discrete Comput. Geom. 19(3), 373\u2013382 (1998)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"52_CR4","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4(3), 312\u2013316 (1983)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"unstructured":"Kaufmann, M.: Personal communication at the workshop \u201cBeyond-Planar Graphs: Algorithmics and Combinatorics\u201d. Schloss Dagstuhl, Germany, November 6\u201311 (2016)","key":"52_CR5"},{"doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Pach, J., T\u00f3th, G., Ueckerdt, T.: The number of crossings in multigraphs with no empty lens. In: Proceedings of Graph Drawing 2018. Lecture Notes in Computer Science (to appear)","key":"52_CR6","DOI":"10.1007\/978-3-030-04414-5_17"},{"key":"52_CR7","volume-title":"Complexity Issues in VLSI. Foundations of Computing","author":"FT Leighton","year":"1983","unstructured":"Leighton, F.T.: Complexity Issues in VLSI. Foundations of Computing. MIT Press, Cambridge (1983)"},{"key":"52_CR8","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol. 212. Springer, New York (2002)"},{"issue":"1","key":"52_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02086610","volume":"16","author":"J Pach","year":"1996","unstructured":"Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. Algorithmica 16(1), 111\u2013117 (1996)","journal-title":"Algorithmica"},{"unstructured":"Pach, J., Spencer, J., T\u00f3th, G.: New bounds on crossing numbers. In: Proceedings of the 15th Annual ACM Symposium on Computational Geometry, pp. 124\u2013133 (1999) (Also in: Discrete Comput. Geom. 24(4), 623\u2013644 (2000))","key":"52_CR10"},{"issue":"4","key":"52_CR11","first-page":"199","volume":"9","author":"J Pach","year":"2000","unstructured":"Pach, J., T\u00f3th, G.: Thirteen problems on crossing numbers. Geombinatorics 9(4), 199\u2013207 (2000)","journal-title":"Geombinatorics"},{"key":"52_CR12","first-page":"21","volume":"1000","author":"M Schaefer","year":"2013","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Comb. 1000, 21\u201322 (2013)","journal-title":"Electron. J. Comb."},{"key":"52_CR13","volume-title":"Davenport\u2013Schinzel Sequences and Their Geometric Applications","author":"M Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.K.: Davenport\u2013Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1995)"},{"issue":"3","key":"52_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1017\/S0963548397002976","volume":"6","author":"LA Sz\u00e9kely","year":"1997","unstructured":"Sz\u00e9kely, L.A.: Crossing numbers and hard Erd\u0151s problems in discrete geometry. Comb. Probab. Comput. 6(3), 353\u2013358 (1997)","journal-title":"Comb. Probab. Comput."},{"issue":"1\u20133","key":"52_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0012-365X(03)00317-0","volume":"276","author":"LA Sz\u00e9kely","year":"2004","unstructured":"Sz\u00e9kely, L.A.: A successful concept for measuring non-planarity of graphs: the crossing number. Discrete Math. 276(1\u20133), 331\u2013352 (2004)","journal-title":"Discrete Math."},{"issue":"3\u20134","key":"52_CR16","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02579194","volume":"3","author":"E Szemer\u00e9di","year":"1983","unstructured":"Szemer\u00e9di, E., Trotter, W.T.: Extremal problems in discrete geometry. Combinatorica 3(3\u20134), 381\u2013392 (1983)","journal-title":"Combinatorica"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-018-00052-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-018-00052-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-018-00052-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T10:17:29Z","timestamp":1600251449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-018-00052-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,19]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["52"],"URL":"https:\/\/doi.org\/10.1007\/s00454-018-00052-z","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2018,12,19]]},"assertion":[{"value":"25 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}