{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:20:23Z","timestamp":1761805223094},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2005,8,25]],"date-time":"2005-08-25T00:00:00Z","timestamp":1124928000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2006,1]]},"DOI":"10.1007\/s00607-005-0133-3","type":"journal-article","created":{"date-parts":[[2005,8,25]],"date-time":"2005-08-25T09:53:15Z","timestamp":1124963595000},"page":"165-176","source":"Crossref","is-referenced-by-count":12,"title":["On the Crossing Number of Complete Graphs"],"prefix":"10.1007","volume":"76","author":[{"given":"O.","family":"Aichholzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Aurenhammer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Krasser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,8,25]]},"reference":[{"key":"133_CR1","doi-asserted-by":"crossref","unstructured":"\u00c1brego, B., Fern\u00e1ndez-Merchant, S.: A lower bound for the rectilinear crossing number. Graphs and Combinatorics (to appear).","DOI":"10.1007\/s00373-005-0612-5"},{"key":"133_CR2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1023\/A:1021231927255","volume":"19","author":"O. Aichholzer","year":"2002","journal-title":"Order"},{"key":"133_CR3","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H.: On the crossing number of complete graphs. Proc. 18th Ann. ACM Symp. Comput. Geometry, Barcelona, Spain, 2002, pp. 19\u201324.","DOI":"10.1145\/513400.513403"},{"key":"133_CR4","unstructured":"Aichholzer, O., Krasser, H.: The point set order type data base: a collection of applications and results. Proc. 13th Ann. Canadian Conf. Comput. Geometry CCCG 2001, Waterloo, Canada, 2001, pp. 17\u201320."},{"key":"133_CR5","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Krasser, H.: Abstract order type extension and new results on the rectilinear crossing number. Proc. 21th Ann. ACM Symp. Computational Geometry 2005, Pise, Italy, pp. 91\u201398.","DOI":"10.1145\/1064092.1064108"},{"key":"133_CR6","unstructured":"Balogh, J., Salazar, G.: On k-sets, convex quadrilaterals, and the rectilinear crossing number of Kn (submitted)."},{"key":"133_CR7","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/BF02574701","volume":"6","author":"D. Bienstock","year":"1991","journal-title":"Discrete Comput. Geometry"},{"key":"133_CR8","doi-asserted-by":"crossref","unstructured":"Brodsky, A., Durocher, S., Gether, E.: The rectilinear crossing number of K10 is 62. The Electronic J. Combinatorics 8, Research Paper 23 (2001).","DOI":"10.37236\/1567"},{"key":"133_CR9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0012-365X(02)00491-0","volume":"262","author":"A. Brodsky","year":"2003","journal-title":"Discrete Math."},{"key":"133_CR10","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1080\/00029890.1973.11993230","volume":"88","author":"P. Erd\u00f6s","year":"1973","journal-title":"Am. Math. Month."},{"key":"133_CR11","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"R. K. Garey","year":"1983","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"133_CR12","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1137\/0212032","volume":"12","author":"J. E. Goodman","year":"1983","journal-title":"SIAM J. Comput."},{"key":"133_CR13","first-page":"68","volume":"7","author":"R. K. Guy","year":"1960","journal-title":"Nabla (Bull. Malayan Math. Soc.)"},{"issue":"2","key":"133_CR14","first-page":"333","volume":"13","author":"F. Harary","year":"1962","journal-title":"Proc. Edinburgh Math. Soc."},{"key":"133_CR15","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02187887","volume":"2","author":"R. B. Hayward","year":"1987","journal-title":"Discrete Comput. Geometry"},{"key":"133_CR16","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0095-8956(71)90045-1","volume":"29","author":"H. F. Jensen","year":"1971","journal-title":"J. Combinatorial Theory B"},{"key":"133_CR17","volume-title":"Complexity issues in VLSI","author":"F. T. Leighton","year":"1983"},{"key":"133_CR18","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Vesztergombi, K., Welzl, E., Wagner, U.: Convex quadrilaterals and k-sets. In: Towards a theory of geometric graphs (Pach J. ed.). AMS Contemporary Mathematics Ser. 342, 139\u2013148 (2004).","DOI":"10.1090\/conm\/342\/06138"},{"key":"133_CR19","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1006\/jctb.2000.1978","volume":"80","author":"J. Pach","year":"2000","journal-title":"J. Combinatorial Theory B"},{"key":"133_CR20","first-page":"195","volume":"9","author":"J. Pach","year":"2000","journal-title":"Geombinatorics"},{"key":"133_CR21","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1080\/00029890.1997.11990611","volume":"104","author":"R. B. Richter","year":"1997","journal-title":"Am. Math. Month."},{"key":"133_CR22","first-page":"939","volume":"101","author":"E. R. Scheinerman","year":"1994","journal-title":"Am. Math. Month."},{"key":"133_CR23","unstructured":"Singer, D.: The rectilinear crossing number of certain graphs. Manuscript, 1971. Available at: http:\/\/www.cwru.edu\/artsci\/math\/singer\/."},{"key":"133_CR24","first-page":"135","volume":"43","author":"J. T. Thorpe","year":"1996","journal-title":"Ars Combinatorica"},{"key":"133_CR25","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0021-9800(70)80007-2","volume":"8","author":"W. T. Tutte","year":"1970","journal-title":"J. Combinatorial Theory"},{"key":"133_CR26","unstructured":"Wagner, U.: On the rectilinear crossing number of complete craphs. Proc. 14th Ann. Symp. on Discrete Algorithms (SODA), 2003, pp. 583\u2013588."},{"key":"133_CR27","doi-asserted-by":"crossref","unstructured":"Wilf, H. S.: On crossing numbers, and some unsolved problems. In: Combinatorics, geometry, and probability. Cambridge: Cambridge University Press 1997, pp. 557\u2013562","DOI":"10.1017\/CBO9780511662034.049"},{"key":"133_CR28","unstructured":"http:\/\/www.ist.tugraz.at\/aichholzer\/crossings.html."},{"key":"133_CR29","unstructured":"http:\/\/www.igi.tugraz.at\/hkrasser\/data\/d36.nb."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-005-0133-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-005-0133-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-005-0133-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T06:13:38Z","timestamp":1586412818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-005-0133-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8,25]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2006,1]]}},"alternative-id":["133"],"URL":"https:\/\/doi.org\/10.1007\/s00607-005-0133-3","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,8,25]]}}}