{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T03:54:49Z","timestamp":1648785289601},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,1,8]],"date-time":"2013-01-08T00:00:00Z","timestamp":1357603200000},"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":[[2014,11]]},"DOI":"10.1007\/s10878-012-9585-5","type":"journal-article","created":{"date-parts":[[2013,1,7]],"date-time":"2013-01-07T07:29:34Z","timestamp":1357543774000},"page":"854-874","source":"Crossref","is-referenced-by-count":3,"title":["An upper bound of Heilbronn number for eight points in triangles"],"prefix":"10.1007","volume":"28","author":[{"given":"Liangyu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Zhenbing","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,8]]},"reference":[{"key":"9585_CR1","unstructured":"Cantrell D (2011) The Heilbronn problem for triangles. http:\/\/www2.stetson.edu\/~efriedma\/heiltri\/ . Accessed 7 Sept 2011"},{"key":"9585_CR2","unstructured":"De Comit\u00e9 F, Delahaye J-P (2009) Automated proofs in geometry: computing upper bounds for the Heilbronn problem for triangles. http:\/\/arxiv.org\/abs\/0911.4375v3 . Accessed 7 Sept 2011"},{"key":"9585_CR3","unstructured":"De Comit\u00e9 F, Delahaye J-P (2009b) A counterexample to Kahle-conjecture, new conjectures and automated proofs in geometry. http:\/\/www.lifl.fr\/~decomite\/triangle\/triangles.html . Accessed 7 Sept 2011"},{"key":"9585_CR4","unstructured":"Kahle M (2008) Points in a triangle forcing small triangles. Geombinatorics XVIII:114\u2013128. http:\/\/arxiv.org\/abs\/0811.2449v1 . Accessed 7 Sept 2011"},{"key":"9585_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-74652-4","volume-title":"How does one cut a triangle?","author":"A Soifer","year":"2009","unstructured":"Soifer A (2009) How does one cut a triangle?, 2nd edn. Springer, New York","edition":"2"},{"key":"9585_CR6","unstructured":"Tal A (2009) Algorithms for Heilbronn\u2019s triangle problem. MSc thesis. Israel Institute of Technology, Haifa, May 2009. ftp:\/\/ftp.cs.technion.ac.il\/pub\/barequet\/theses\/tal-a-msc-thesis.pdf.gz . Accessed 7 Sept 2011"},{"key":"9585_CR7","unstructured":"Weisstein EW (2011) Heilbronn triangle problem. From MathWorld-A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/HeilbronnTriangleProblem.html . Accessed 7 Sept 2011"},{"key":"9585_CR8","unstructured":"Yang L, Zhang JZ, Zeng ZB (1994) On the Heilbronn numbers of triangular regions. Acta Math Sinica 37:678\u2013689"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9585-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9585-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9585-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:20Z","timestamp":1559276600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9585-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,8]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["9585"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9585-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,8]]}}}