{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T18:36:33Z","timestamp":1714761393314},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T00:00:00Z","timestamp":1195171200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s00454-007-9041-y","type":"journal-article","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T11:14:44Z","timestamp":1195125284000},"page":"401-413","source":"Crossref","is-referenced-by-count":2,"title":["Distributions of Points in d Dimensions and Large k-Point Simplices"],"prefix":"10.1007","volume":"40","author":[{"given":"Hanno","family":"Lefmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,16]]},"reference":[{"key":"9041_CR1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0097-3165(82)90049-8","volume":"32","author":"M. Ajtai","year":"1982","unstructured":"Ajtai, M., Koml\u00f3s, J., Pintz, J., Spencer, J., Szemer\u00e9di, E.: Extremal uncrowded hypergraphs. J. Comb. Theory Ser. A 32, 321\u2013335 (1982)","journal-title":"J. Comb. Theory Ser. A"},{"key":"9041_CR2","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/S0895480100365859","volume":"14","author":"G. Barequet","year":"2001","unstructured":"Barequet, G.: A lower bound for Heilbronn\u2019s triangle problem in d dimensions. SIAM J. Discrete Math. 14, 230\u2013236 (2001)","journal-title":"SIAM J. Discrete Math."},{"key":"9041_CR3","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.disc.2004.03.001","volume":"283","author":"G. Barequet","year":"2004","unstructured":"Barequet, G.: The on-line Heilbronn\u2019s triangle problem. Discrete Math. 283, 7\u201314 (2004)","journal-title":"Discrete Math."},{"key":"9041_CR4","first-page":"343","volume":"24","author":"G. Barequet","year":"2006","unstructured":"Barequet, G., Naor, J.: Large k\u2212D simplices in the D-dimensional unit cube. Far East J. Appl. Math. 24, 343\u2013354 (2006)","journal-title":"Far East J. Appl. Math."},{"key":"9041_CR5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s00454-007-1323-x","volume":"38","author":"G. Barequet","year":"2007","unstructured":"Barequet, G., Shaikhet, A.: The on-line Heilbronn\u2019s triangle problem in d dimensions. Discrete Comput. Geom. 38, 51\u201360 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"9041_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1137\/S0097539797323716","volume":"29","author":"C. Bertram-Kretzberg","year":"1999","unstructured":"Bertram-Kretzberg, C., Lefmann, H.: The algorithmic aspects of uncrowded hypergraphs. SIAM J. Comput. 29, 201\u2013230 (1999)","journal-title":"SIAM J. Comput."},{"key":"9041_CR7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1137\/S0097539798348870","volume":"30","author":"C. Bertram-Kretzberg","year":"2000","unstructured":"Bertram-Kretzberg, C., Hofmeister, T., Lefmann, H.: An algorithm for Heilbronn\u2019s problem. SIAM J. Comput. 30, 383\u2013390 (2000)","journal-title":"SIAM J. Comput."},{"key":"9041_CR8","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1137\/S0895480103435810","volume":"19","author":"P. Brass","year":"2005","unstructured":"Brass, P.: An upper bound for the d-dimensional Heilbronn triangle problem. SIAM J. Discrete Math. 19, 192\u2013195 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"9041_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/rsa.3240060208","volume":"6","author":"R.A. Duke","year":"1995","unstructured":"Duke, R.A., Lefmann, H., R\u00f6dl, V.: On uncrowded hypergraphs. Random Struct. Algorithms 6, 209\u2013212 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"9041_CR10","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1002\/rsa.10024","volume":"20","author":"T. Jiang","year":"2002","unstructured":"Jiang, T., Li, M., Vitany, P.: The average case area of Heilbronn-type triangles. Random Struct. Algorithms 20, 206\u2013219 (2002)","journal-title":"Random Struct. Algorithms"},{"key":"9041_CR11","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1112\/jlms\/s2-24.3.385","volume":"24","author":"J. Koml\u00f3s","year":"1981","unstructured":"Koml\u00f3s, J., Pintz, J., Szemer\u00e9di, E.: On Heilbronn\u2019s triangle problem. J. Lond. Math. Soc. 24, 385\u2013396 (1981)","journal-title":"J. Lond. Math. Soc."},{"key":"9041_CR12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1112\/jlms\/s2-25.1.13","volume":"25","author":"J. Koml\u00f3s","year":"1982","unstructured":"Koml\u00f3s, J., Pintz, J., Szemer\u00e9di, E.: A lower bound for Heilbronn\u2019s problem. J. Lond. Math. Soc. 25, 13\u201324 (1982)","journal-title":"J. Lond. Math. Soc."},{"key":"9041_CR13","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1007\/s00493-003-0040-1","volume":"23","author":"H. Lefmann","year":"2003","unstructured":"Lefmann, H.: On Heilbronn\u2019s problem in higher dimension. Combinatorica 23, 669\u2013680 (2003)","journal-title":"Combinatorica"},{"key":"9041_CR14","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.tcs.2006.06.010","volume":"363","author":"H. Lefmann","year":"2006","unstructured":"Lefmann, H.: Large triangles in the d-dimensional unit-cube. Theor. Comput. Sci. 363, 85\u201398 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9041_CR15","unstructured":"Lefmann, H.: Distributions of points in the unit-square and large k-gons. In: Proc. 16th Symposium on Discrete Algorithms SODA\u20192005, pp. 241\u2013250. ACM and SIAM, Eur. J. Comb. (to appear)"},{"key":"9041_CR16","doi-asserted-by":"crossref","first-page":"1926","DOI":"10.1137\/S0097539701395115","volume":"31","author":"H. Lefmann","year":"2002","unstructured":"Lefmann, H., Schmitt, N.: A deterministic polynomial time algorithm for Heilbronn\u2019s problem in three dimensions. SIAM J. Comput. 31, 1926\u20131947 (2002)","journal-title":"SIAM J. Comput."},{"key":"9041_CR17","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1112\/jlms\/s1-26.3.198","volume":"26","author":"K.F. Roth","year":"1951","unstructured":"Roth, K.F.: On a problem of Heilbronn. J. Lond. Math. Soc. 26, 198\u2013204 (1951)","journal-title":"J. Lond. Math. Soc."},{"key":"9041_CR18","doi-asserted-by":"crossref","unstructured":"Roth, K.F.: On a problem of Heilbronn, II and III. Proc. Lond. Math. Soc. 25(3), 193\u2013212 and 543\u2013549 (1972)","DOI":"10.1112\/plms\/s3-25.3.543"},{"key":"9041_CR19","first-page":"251","volume-title":"Proc. of Symposia in Pure Mathematics","author":"K.F. Roth","year":"1973","unstructured":"Roth, K.F.: Estimation of the area of the smallest triangle obtained by selecting three out of n points in a disc of unit area. In: Proc. of Symposia in Pure Mathematics, vol. 24, pp. 251\u2013262. Am. Math. Soc., Providence (1973)"},{"key":"9041_CR20","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/0001-8708(76)90100-6","volume":"22","author":"K.F. Roth","year":"1976","unstructured":"Roth, K.F.: Developments in Heilbronn\u2019s triangle problem. Adv. Math. 22, 364\u2013385 (1976)","journal-title":"Adv. Math."},{"key":"9041_CR21","volume-title":"M.Sc. Thesis, Department of Computer Science","author":"A. Shaikhet","year":"2007","unstructured":"Shaikhet, A.: The on-line Heilbronn\u2019s triangle problem in d dimensions. M.Sc. Thesis, Department of Computer Science, The Technion, Haifa, Israel (2007)"},{"issue":"2","key":"9041_CR22","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1112\/jlms\/s2-4.3.545","volume":"4","author":"W.M. Schmidt","year":"1972","unstructured":"Schmidt, W.M.: On a problem of Heilbronn. J. Lond. Math. Soc. 4(2), 545\u2013550 (1972)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-007-9041-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-007-9041-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-007-9041-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:34Z","timestamp":1559072854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-007-9041-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,16]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["9041"],"URL":"https:\/\/doi.org\/10.1007\/s00454-007-9041-y","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,16]]}}}