{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T14:58:44Z","timestamp":1649170724273},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,6,3]],"date-time":"2008-06-03T00:00:00Z","timestamp":1212451200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10878-008-9168-7","type":"journal-article","created":{"date-parts":[[2008,6,2]],"date-time":"2008-06-02T15:33:01Z","timestamp":1212420781000},"page":"182-195","source":"Crossref","is-referenced-by-count":0,"title":["Point sets in the unit square and large areas of convex hulls of subsets of points"],"prefix":"10.1007","volume":"16","author":[{"given":"Hanno","family":"Lefmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,6,3]]},"reference":[{"key":"9168_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 (1982) Extremal uncrowded hypergraphs. J Comb Theory Ser A 32:321\u2013335","journal-title":"J Comb Theory Ser A"},{"key":"9168_CR2","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/S0895480100365859","volume":"14","author":"G Barequet","year":"2001","unstructured":"Barequet G (2001) A lower bound for Heilbronn\u2019s triangle problem in d dimensions. SIAM J Discrete Math 14:230\u2013236","journal-title":"SIAM J Discrete Math"},{"key":"9168_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 (2004) The on-line Heilbronn\u2019s triangle problem. Discrete Math 283:7\u201314","journal-title":"Discrete Math"},{"key":"9168_CR4","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 (2007) The on-line Heilbronn\u2019s triangle problem in d dimensions. Discrete Comput Geom 38:51\u201360","journal-title":"Discrete Comput Geom"},{"key":"9168_CR5","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 (1999) The algorithmic aspects of uncrowded hypergraphs. SIAM J Comput 29:201\u2013230","journal-title":"SIAM J Comput"},{"key":"9168_CR6","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 (2000) An algorithm for Heilbronn\u2019s problem. SIAM J Comput 30:383\u2013390","journal-title":"SIAM J Comput"},{"key":"9168_CR7","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1137\/S0895480103435810","volume":"19","author":"P Brass","year":"2005","unstructured":"Brass P (2005) An upper bound for the d-dimensional analogue of Heilbronn\u2019s triangle problem. SIAM J Discrete Math 19, 192\u2013195","journal-title":"SIAM J Discrete Math"},{"key":"9168_CR8","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1090\/S0894-0347-1989-1001852-0","volume":"2","author":"B Chazelle","year":"1989","unstructured":"Chazelle B (1989) Lower bounds on the complexity of polytope range searching. J Am Math Soc 2:637\u2013666","journal-title":"J Am Math Soc"},{"key":"9168_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/rsa.3240060208","volume":"6","author":"RA Duke","year":"1995","unstructured":"Duke RA, Lefmann H, R\u00f6dl V (1995) On uncrowded hypergraphs. Random Struct Algorithms 6:209\u2013212","journal-title":"Random Struct Algorithms"},{"key":"9168_CR10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/(SICI)1098-2418(199603)8:2<131::AID-RSA4>3.0.CO;2-Z","volume":"8","author":"A Fundia","year":"1996","unstructured":"Fundia A (1996) Derandomizing Chebychev\u2019s inequality to find independent sets in uncrowded hypergraphs. Random Struct Algorithms 8:131\u2013147","journal-title":"Random Struct Algorithms"},{"key":"9168_CR11","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 (2002) The average case area of Heilbronn-type triangles. Random Struct Algorithms 20:206\u2013219","journal-title":"Random Struct Algorithms"},{"key":"9168_CR12","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 (1981) On Heilbronn\u2019s triangle problem. J Lond Math Soc 24:385\u2013396","journal-title":"J Lond Math Soc"},{"key":"9168_CR13","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 (1982) A lower bound for Heilbronn\u2019s problem. J Lond Math Soc 25:13\u201324","journal-title":"J Lond Math Soc"},{"key":"9168_CR14","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1007\/s00493-003-0040-1","volume":"23","author":"H Lefmann","year":"2003","unstructured":"Lefmann H (2003) On Heilbronn\u2019s problem in higher dimension. Combinatorica 23:669\u2013680","journal-title":"Combinatorica"},{"key":"9168_CR15","first-page":"241","volume-title":"Proceedings 16th ACM-SIAM symposium on discrete algorithms SODA\u201905","author":"H Lefmann","year":"2005","unstructured":"Lefmann H (2005) Distributions of points in the unit-square and large k-gons. In: Proceedings 16th ACM-SIAM symposium on discrete algorithms SODA\u201905. ACM and SIAM, New York, pp\u00a0241\u2013250; Long version in Eur J Comb, to appear"},{"key":"9168_CR16","series-title":"Lectures notes in computer sciences","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/11775096_17","volume-title":"Proceedings second international conference \u2018Algorithmic aspects in information and management AAIM\u201906","author":"H Lefmann","year":"2006","unstructured":"Lefmann H (2006) Distributions of points and large convex hulls of k points. In: Proceedings second international conference \u2018Algorithmic aspects in information and management AAIM\u201906\u2019. Lectures notes in computer sciences, vol\u00a04041. Springer, Berlin, pp\u00a0173\u2013184"},{"key":"9168_CR17","series-title":"Lectures notes in computer sciences","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-3-540-72870-2_27","volume-title":"Proceedings third international conference \u2018Algorithmic aspects in information and management AAIM\u201907","author":"H Lefmann","year":"2007","unstructured":"Lefmann H (2007) Convex hulls of point sets and non-uniform uncrowded hypergraphs. In: Proceedings third international conference \u2018Algorithmic aspects in information and management AAIM\u201907\u2019. Lectures notes in computer sciences, vol\u00a04508. Springer, Berlin, pp\u00a0285\u2013295"},{"key":"9168_CR18","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1112\/jlms\/s1-26.3.198","volume":"26","author":"KF Roth","year":"1951","unstructured":"Roth KF (1951) On a problem of Heilbronn. J Lond Math Soc 26:198\u2013204","journal-title":"J Lond Math Soc"},{"key":"9168_CR19","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1112\/plms\/s3-25.2.193","volume":"25","author":"KF Roth","year":"1972","unstructured":"Roth KF (1972a) On a problem of Heilbronn, II. Proc Lond Math Soc (3) 25:193\u2013212","journal-title":"Proc Lond Math Soc (3)"},{"key":"9168_CR20","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1112\/plms\/s3-25.3.543","volume":"25","author":"KF Roth","year":"1972","unstructured":"Roth KF (1972b) On a problem of Heilbronn, III. Proc Lond Math Soc (3) 25:543\u2013549","journal-title":"Proc Lond Math Soc (3)"},{"key":"9168_CR21","first-page":"251","volume-title":"Proceedings of the symposia in pure mathematics","author":"KF Roth","year":"1973","unstructured":"Roth KF (1973) Estimation of the area of the smallest triangle obtained by selecting three out of n points in a disc of unit area. In: Proceedings of the symposia in pure mathematics, vol\u00a024. AMS, Providence, pp\u00a0251\u2013262"},{"key":"9168_CR22","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/0001-8708(76)90100-6","volume":"22","author":"KF Roth","year":"1976","unstructured":"Roth KF (1976) Developments in Heilbronn\u2019s triangle problem. Adv Math 22:364\u2013385","journal-title":"Adv Math"},{"key":"9168_CR23","unstructured":"Shaikhet A (2007) The on-line Heilbronn\u2019s triangle problem in d dimensions. MSc thesis, Department of Computer Science, The Technion, Haifa, Israel"},{"key":"9168_CR24","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1112\/jlms\/s2-4.3.545","volume":"4","author":"WM Schmidt","year":"1972","unstructured":"Schmidt WM (1972) On a problem of Heilbronn. J Lond Math Soc (2) 4:545\u2013550","journal-title":"J Lond Math Soc (2)"},{"key":"9168_CR25","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0012-365X(72)90084-2","volume":"2","author":"J Spencer","year":"1972","unstructured":"Spencer J (1972) Tur\u00e1n\u2019s theorem for k-graphs. Discrete Math 2:183\u2013186","journal-title":"Discrete Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9168-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9168-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9168-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:13Z","timestamp":1559276293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9168-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,3]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["9168"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9168-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,3]]}}}