{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:43:59Z","timestamp":1725515039290},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540728689"},{"type":"electronic","value":"9783540728702"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72870-2_27","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T08:53:10Z","timestamp":1182761590000},"page":"285-295","source":"Crossref","is-referenced-by-count":1,"title":["Convex Hulls of Point-Sets and Non-uniform Hypergraphs"],"prefix":"10.1007","author":[{"given":"Hanno","family":"Lefmann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"27_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":"27_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":"27_CR3","unstructured":"Barequet, G., Naor, J.: Large k\u2009\u2212\u2009D Simplices in the D-Dimensional Unit Cube. In: Proceedings \u201817th Canadian Conference on Computational Geometry\u2019, pp. 30\u201333 (2005)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/11809678_43","volume-title":"Computing and Combinatorics","author":"G. Barequet","year":"2006","unstructured":"Barequet, G., Shaikhet, A.: The On-Line Heilbronn\u2019s Triangle Problem in d Dimensions. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol.\u00a04112, pp. 408\u2013417. Springer, Heidelberg (2006)"},{"key":"27_CR5","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":"27_CR6","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":"27_CR7","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1137\/S0895480103435810","volume":"19","author":"P. Brass","year":"2005","unstructured":"Brass, P.: An Upper Bound for the d-Dimensional Analogue of Heilbronn\u2019s Triangle Problem. SIAM Journal on Discrete Mathematics\u00a019, 192\u2013195 (2005)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"637","DOI":"10.2307\/1990891","volume":"2","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B.: Lower Bounds on the Complexity of Polytope Range Searching. Journal of the American Mathematical Society\u00a02, 637\u2013666 (1989)","journal-title":"Journal of the American Mathematical Society"},{"key":"27_CR9","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":"27_CR10","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":"27_CR11","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":"27_CR12","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":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/11533719_52","volume-title":"Computing and Combinatorics","author":"H. Lefmann","year":"2005","unstructured":"Lefmann, H.: Distributions of Points in d Dimensions and Large k-Point Simplices. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 514\u2013523. Springer, Heidelberg (2005)"},{"key":"27_CR14","first-page":"241","volume-title":"Proceedings \u201816th ACM-SIAM Symposium on Discrete Algorithms SODA\u2019, ACM and SIAM","author":"H. Lefmann","year":"2005","unstructured":"Lefmann, H.: Distributions of Points in the Unit-Square and Large k-Gons. In: Proceedings \u201816th ACM-SIAM Symposium on Discrete Algorithms SODA\u2019, ACM and SIAM, pp. 241\u2013250. ACM, New York (2005)"},{"key":"27_CR15","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"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Roth, K.F.: On a Problem of Heilbronn, II, and III. Proc. of the London Mathematical Society 25(3), 193\u2013212, and 543\u2013549 (1972)","DOI":"10.1112\/plms\/s3-25.3.543"},{"key":"27_CR17","series-title":"24","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. 24, pp. 251\u2013262. AMS, Providence (1973)"},{"key":"27_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":"27_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":"27_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0012-365X(72)90084-2","volume":"2","author":"J. Spencer","year":"1972","unstructured":"Spencer, J.: Tur\u00e1n\u2019s Theorem for k-Graphs. Discrete Mathematics\u00a02, 183\u2013186 (1972)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72870-2_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:49:34Z","timestamp":1619502574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72870-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540728689","9783540728702"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72870-2_27","relation":{},"subject":[]}}