{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:13Z","timestamp":1725564973000},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_7","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:01:28Z","timestamp":1283713288000},"page":"43-52","source":"Crossref","is-referenced-by-count":3,"title":["Large Triangles in the d-Dimensional Unit-Cube"],"prefix":"10.1007","author":[{"given":"Hanno","family":"Lefmann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","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. Journal of Combinatorial Theory Ser. A\u00a032, 321\u2013335 (1982)","journal-title":"Journal of Combinatorial Theory Ser. A"},{"key":"7_CR2","doi-asserted-by":"publisher","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 Journal on Discrete Mathematics\u00a014, 230\u2013236 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-45655-4_39","volume-title":"Computing and Combinatorics","author":"G. Barequet","year":"2002","unstructured":"Barequet, G.: The On-Line Heilbronn\u2019s Triangle Problem in Three and Four Dimensions. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 360\u2013369. Springer, Heidelberg (2002)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1137\/S0097539797323716","volume":"29","author":"C. Bertram\u2013Kretzberg","year":"1999","unstructured":"Bertram\u2013Kretzberg, C., Lefmann, H.: The Algorithmic Aspects of Uncrowded Hypergraphs. SIAM Journal on Computing\u00a029, 201\u2013230 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR5","doi-asserted-by":"publisher","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 Journal on Computing\u00a030, 383\u2013390 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR6","unstructured":"Brass, P.: An Upper Bound for the d-Dimensional Heilbronn Triangle Problem (2003) (preprint)"},{"key":"7_CR7","doi-asserted-by":"publisher","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 Structures & Algorithms\u00a06, 209\u2013212 (1995)","journal-title":"Random Structures & Algorithms"},{"key":"7_CR8","doi-asserted-by":"publisher","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.: Derandomizing Chebychev\u2019s Inequality to find Independent Sets in Uncrowded Hypergraphs. Random Structures & Algorithms\u00a08, 131\u2013147 (1996)","journal-title":"Random Structures & Algorithms"},{"key":"7_CR9","doi-asserted-by":"publisher","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 Structures & Algorithms\u00a020, 206\u2013219 (2002)","journal-title":"Random Structures & Algorithms"},{"key":"7_CR10","doi-asserted-by":"publisher","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. Journal of the London Mathematical Society\u00a024, 385\u2013396 (1981)","journal-title":"Journal of the London Mathematical Society"},{"key":"7_CR11","doi-asserted-by":"publisher","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. Journal of the London Mathematical Society\u00a025, 13\u201324 (1982)","journal-title":"Journal of the London Mathematical Society"},{"key":"7_CR12","doi-asserted-by":"publisher","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\u00a023, 669\u2013680 (2003)","journal-title":"Combinatorica"},{"key":"7_CR13","doi-asserted-by":"publisher","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 Journal on Computing\u00a031, 1926\u20131947 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR14","doi-asserted-by":"publisher","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. Journal of the London Mathematical Society\u00a026, 198\u2013204 (1951)","journal-title":"Journal of the London Mathematical Society"},{"issue":"3","key":"7_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1112\/plms\/s3-25.2.193","volume":"25","author":"K.F. Roth","year":"1972","unstructured":"Roth, K.F.: On a Problem of Heilbronn, II. Proc. of the London Mathematical Society\u00a025(3), 193\u2013212 (1972)","journal-title":"Proc. of the London Mathematical Society"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1112\/plms\/s3-25.3.543","volume":"25","author":"K.F. Roth","year":"1972","unstructured":"Roth, K.F.: On a Problem of Heilbronn, III. Proc. of the London Mathematical Society\u00a025(3), 543\u2013549 (1972)","journal-title":"Proc. of the London Mathematical Society"},{"key":"7_CR17","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.\u00a024, pp. 251\u2013262. AMS, Providence (1973)"},{"key":"7_CR18","doi-asserted-by":"publisher","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. Advances in Mathematics\u00a022, 364\u2013385 (1976)","journal-title":"Advances in Mathematics"},{"issue":"2","key":"7_CR19","doi-asserted-by":"publisher","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. Journal of the London Mathematical Society\u00a04(2), 545\u2013550 (1972)","journal-title":"Journal of the London Mathematical Society"},{"key":"7_CR20","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an Extremal Problem in Graph Theory. Mat. Fiz. Lapok\u00a048, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:26:42Z","timestamp":1619998002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}