{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T10:29:23Z","timestamp":1717151363489},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T00:00:00Z","timestamp":1284163200000},"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":[[2011,3]]},"DOI":"10.1007\/s00454-010-9291-y","type":"journal-article","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T16:05:57Z","timestamp":1284134757000},"page":"272-278","source":"Crossref","is-referenced-by-count":7,"title":["More Colourful Simplices"],"prefix":"10.1007","volume":"45","author":[{"given":"Antoine","family":"Deza","sequence":"first","affiliation":[]},{"given":"Tamon","family":"Stephen","sequence":"additional","affiliation":[]},{"given":"Feng","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,11]]},"reference":[{"issue":"2","key":"9291_CR1","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/s00454-009-9180-4","volume":"42","author":"J.L. Arocha","year":"2009","unstructured":"Arocha, J.L., B\u00e1r\u00e1ny, I., Bracho, J., Fabila, R., Montejano, L.: Very colorful theorems. Discrete Comput. Geom. 42(2), 142\u2013154 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"2\u20133","key":"9291_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0012-365X(82)90115-7","volume":"40","author":"I. B\u00e1r\u00e1ny","year":"1982","unstructured":"B\u00e1r\u00e1ny, I.: A generalization of Carath\u00e9odory\u2019s theorem. Discrete Math. 40(2\u20133), 141\u2013152 (1982)","journal-title":"Discrete Math."},{"issue":"1","key":"9291_CR3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/050643039","volume":"21","author":"I. B\u00e1r\u00e1ny","year":"2007","unstructured":"B\u00e1r\u00e1ny, I., Matou\u0161ek, J.: Quadratically many colorful simplices. SIAM J. Discrete Math. 21(1), 191\u2013198 (2007)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"9291_CR4","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/moor.22.3.550","volume":"22","author":"I. B\u00e1r\u00e1ny","year":"1997","unstructured":"B\u00e1r\u00e1ny, I., Onn, S.: Colourful linear programming and its relatives. Math. Oper. Res. 22(3), 550\u2013567 (1997)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"9291_CR5","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s00454-006-1233-3","volume":"35","author":"A. Deza","year":"2006","unstructured":"Deza, A., Huang, S., Stephen, T., Terlaky, T.: Colourful simplicial depth. Discrete Comput. Geom. 35(4), 597\u2013604 (2006)","journal-title":"Discrete Comput. Geom."},{"key":"9291_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/0-387-25592-3_3","volume-title":"Graph Theory and Combinatorial Optimization","author":"K. Fukuda","year":"2005","unstructured":"Fukuda, K., Rosta, V., Data depth and maximal feasible subsystems. In: Avis, D., Hertz, A., Marcotte,\u00a0O. (eds.) Graph Theory and Combinatorial Optimization, pp. 37\u201367. Springer, New York (2005)"},{"issue":"6","key":"9291_CR7","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1007\/s00493-008-2427-5","volume":"28","author":"A.F. Holmsen","year":"2008","unstructured":"Holmsen, A.F., Pach, J., Tverberg, H.: Points surrounding the origin. Combinatorica 28(6), 633\u2013644 (2008)","journal-title":"Combinatorica"},{"issue":"1","key":"9291_CR8","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1214\/aos\/1176347507","volume":"18","author":"R.Y. Liu","year":"1990","unstructured":"Liu, R.Y.: On a notion of data depth based on random simplices. Ann. Stat. 18(1), 405\u2013414 (1990)","journal-title":"Ann. Stat."},{"issue":"4","key":"9291_CR9","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/s10878-008-9149-x","volume":"16","author":"T. Stephen","year":"2008","unstructured":"Stephen, T., Thomas, H.: A quadratic lower bound for colourful simplicial depth. J. Comb. Optim. 16(4), 324\u2013327 (2008)","journal-title":"J. Comb. Optim."}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-010-9291-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-010-9291-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-010-9291-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:50:33Z","timestamp":1559087433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-010-9291-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,11]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9291"],"URL":"https:\/\/doi.org\/10.1007\/s00454-010-9291-y","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,11]]}}}