{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:23:17Z","timestamp":1761805397289},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946665"},{"type":"electronic","value":"9783319946672"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94667-2_23","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T07:56:24Z","timestamp":1530604584000},"page":"273-284","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Crossing Number of Seq-Shellable Drawings of Complete Graphs"],"prefix":"10.1007","author":[{"given":"Petra","family":"Mutzel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lutz","family":"Oettershagen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"key":"23_CR1","first-page":"68","volume":"7","author":"RK Guy","year":"1960","unstructured":"Guy, R.K.: A combinatorial problem. Nabla Bull. Malay. Math. Soc. 7, 68\u201372 (1960)","journal-title":"Nabla Bull. Malay. Math. Soc."},{"issue":"4","key":"23_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1017\/S0013091500025645","volume":"13","author":"F Harary","year":"1963","unstructured":"Harary, F., Hill, A.: On the number of crossings in a complete graph. Proc. Edinb. Math. Soc. 13(4), 333\u2013338 (1963)","journal-title":"Proc. Edinb. Math. Soc."},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1002\/jgt.20249","volume":"56","author":"S Pan","year":"2007","unstructured":"Pan, S., Richter, R.B.: The crossing number of $$K_{11}$$ is 100. J. Graph Theory 56(2), 128\u2013134 (2007)","journal-title":"J. Graph Theory"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.jctb.2015.06.002","volume":"115","author":"D McQuillan","year":"2015","unstructured":"McQuillan, D., Pan, S., Richter, R.B.: On the crossing number of $$K_{13}$$. J. Comb. Theory Ser. B 115, 224\u2013235 (2015)","journal-title":"J. Comb. Theory Ser. B"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"\u00c1brego, B., Aichholzer, O., Fern\u00e1ndez-Merchant, S., Hackl, T., Pammer, J., Pilz, A., Ramos, P., Salazar, G., Vogtenhuber, B.: All good drawings of small complete graphs. In: Proceedings of 31st European Workshop on Computational Geometry (EuroCG), pp. 57\u201360 (2015)","DOI":"10.1007\/s00373-015-1550-5"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"\u00c1brego, B., Aichholzer, O., Fern\u00e1ndez-Merchant, S., Ramos, P., Salazar, G.: The 2-page crossing number of $$K_n$$. In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry. SoCG 2012, pp. 397\u2013404. ACM, New York (2012)","DOI":"10.1145\/2261250.2261310"},{"issue":"4","key":"23_CR7","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/s00454-014-9635-0","volume":"52","author":"BM \u00c1brego","year":"2014","unstructured":"\u00c1brego, B.M., Aichholzer, O., Fern\u00e1ndez-Merchant, S., Ramos, P., Salazar, G.: Shellable drawings and the cylindrical crossing number of $$K_n$$. Discrete Computa. Geom. 52(4), 743\u2013753 (2014)","journal-title":"Discrete Computa. Geom."},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s00454-014-9644-z","volume":"53","author":"M Balko","year":"2015","unstructured":"Balko, M., Fulek, R., Kyncl, J.: Crossing numbers and combinatorial characterization of monotone drawings of $$K_n$$. Discrete Computa. Geom. 53(1), 107\u2013143 (2015)","journal-title":"Discrete Computa. Geom."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.endm.2013.10.064","volume":"44","author":"BM \u00c1brego","year":"2013","unstructured":"\u00c1brego, B.M., Aichholzer, O., Fern\u00e1ndez-Merchant, S., Ramos, P., Salazar, G.: More on the crossing number of $$K_n$$: monotone drawings. Electron Notes Discrete Math. 44, 411\u2013414 (2013)","journal-title":"Electron Notes Discrete Math."},{"key":"23_CR10","unstructured":"\u00c1brego, B., Aichholzer, O., Fern\u00e1ndez-Merchant, S., McQuillan, D., Mohar, B., Mutzel, P., Ramos, P., Richter, R., Vogtenhuber, B.: Bishellable drawings of $$K_n$$. In: Proceedings of XVII Encuentros de Geometr\u00eda Computacional (EGC), Alicante, Spain, pp. 17\u201320 (2017)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/S1571-0653(05)80187-8","volume":"5","author":"LA Sz\u00e9kely","year":"2000","unstructured":"Sz\u00e9kely, L.A.: A successful concept for measuring non-planarity of graphs: the crossing number. Electron. Notes Discrete Math. 5, 284\u2013287 (2000)","journal-title":"Electron. Notes Discrete Math."},{"key":"23_CR12","first-page":"DS21","volume":"1000","author":"M Schaefer","year":"2013","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Comb. 1000, DS21 (2013)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/s00454-012-9403-y","volume":"48","author":"BM \u00c1brego","year":"2012","unstructured":"\u00c1brego, B.M., Cetina, M., Fern\u00e1ndez-Merchant, S., Lea\u00f1os, J., Salazar, G.: On $${\\le } k$$-edges, crossings, and halving lines of geometric drawings of $$K_n$$. Discrete Comput. Geom. 48(1), 192\u2013215 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/B978-0-7204-2262-7.50018-1","volume-title":"A Survey of Combinatorial Theory","author":"P Erd\u00f6s","year":"1973","unstructured":"Erd\u00f6s, P., Lov\u00e1sz, L., Simmons, A., Straus, E.G.: Dissection graphs of planar point sets. In: Srivastava, J.N. (ed.) A Survey of Combinatorial Theory, pp. 139\u2013149. Elsevier, Amsterdam (1973)"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1090\/conm\/342\/06138","volume":"342","author":"L Lov\u00e1sz","year":"2004","unstructured":"Lov\u00e1sz, L., Vesztergombi, K., Wagner, U., Welzl, E.: Convex quadrilaterals and k-sets. Contemp. Math. 342, 139\u2013148 (2004)","journal-title":"Contemp. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94667-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T08:09:01Z","timestamp":1571558941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94667-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946665","9783319946672"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94667-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}