{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:11:49Z","timestamp":1725869509743},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_28","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T08:16:59Z","timestamp":1477815419000},"page":"378-392","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for Colourful Simplicial Depth and Medians in the Plane"],"prefix":"10.1007","author":[{"given":"Olga","family":"Zasenko","sequence":"first","affiliation":[]},{"given":"Tamon","family":"Stephen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"key":"28_CR1","unstructured":"Adiprasito, K., Brinkmann, P., Padrol, A., Pat\u00e1k, P., Pat\u00e1kov\u00e1, Z., Sanyal, R.: Colorful simplicial depth, Minkowski sums, and generalized Gale transforms (2016). preprint arXiv:1607.00347"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Aloupis, G.: Geometric measures of data depth. In: Data Depth: Robust MultivariateAnalysis, Computational Geometry and Applications (2006). DIMACS Ser. Discret. Math. Theoret. Comput. Sci. 72, 147\u2013158. Amer. Math. Soc., Providence","DOI":"10.1090\/dimacs\/072\/10"},{"issue":"1","key":"28_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0925-7721(02)00173-6","volume":"26","author":"G Aloupis","year":"2003","unstructured":"Aloupis, G., Langerman, S., Soss, M., Toussaint, G.: Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. Comput. Geom. 26(1), 69\u201379 (2003)","journal-title":"Comput. Geom."},{"issue":"3","key":"28_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."},{"key":"28_CR5","unstructured":"Cheng, A.Y., Ouyang, M.: On algorithms for simplicial depth. In: Proceedings of the 13th Canadian Conference on Computational Geometry, pp. 53\u201356 (2001)"},{"key":"28_CR6","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"1989","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press and McGraw-Hill Book Company, Cambridge and New York (1989)"},{"issue":"4","key":"28_CR7","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. Discret. Comput. Geom. 35(4), 597\u2013615 (2006)","journal-title":"Discret. Comput. Geom."},{"issue":"11","key":"28_CR8","doi-asserted-by":"crossref","first-page":"2166","DOI":"10.1016\/j.dam.2008.01.016","volume":"156","author":"A Deza","year":"2008","unstructured":"Deza, A., Huang, S., Stephen, T., Terlaky, T.: The colourful feasibility problem. Discret. Appl. Math. 156(11), 2166\u20132177 (2008)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"28_CR9","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","volume":"38","author":"H Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., Guibas, L.J.: Topologically sweeping an arrangement. J. Comput. System Sci. 38(1), 165\u2013194 (1989). 18th Annual ACM Symposium on Theory of Computing (Berkeley, CA, 1986)","journal-title":"J. Comput. System Sci."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H., M\u00fccke, E.P.: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. In: Proceedings of the Fourth Annual Symposium on Computational Geometry (Urbana, IL, 1988), pp. 118\u2013133. ACM, New York (1988)","DOI":"10.1145\/73393.73406"},{"key":"28_CR11","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 maximum feasible subsystems. In: Avis, D., Hertz, A., Marcotte, O. (eds.) Graph Theory and Combinatorial Optimization, vol. 8, pp. 37\u201367. Springer, New York (2005)"},{"issue":"16\u201318","key":"28_CR12","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.1016\/j.tcs.2010.01.034","volume":"411","author":"V Geffert","year":"2010","unstructured":"Geffert, V., Gajdo\u0161, J.: Multiway in-place merging. Theoret. Comput. Sci. 411(16\u201318), 1793\u20131808 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"28_CR13","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0012-365X(92)90658-3","volume":"108","author":"J Gil","year":"1992","unstructured":"Gil, J., Steiger, W., Wigderson, A.: Geometric medians. Discret. Math. 108(1\u20133), 37\u201351 (1992)","journal-title":"Discret. Math."},{"issue":"6","key":"28_CR14","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0020-0190(90)90217-L","volume":"33","author":"S Khuller","year":"1990","unstructured":"Khuller, S., Mitchell, J.S.B.: On a triangle counting problem. Inform. Process. Lett. 33(6), 319\u2013321 (1990)","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"28_CR15","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0020-0190(85)90015-8","volume":"21","author":"DT Lee","year":"1985","unstructured":"Lee, D.T., Ching, Y.T.: The power of geometric duality revisited. Inform. Process. Lett. 21(3), 117\u2013122 (1985)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"28_CR16","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1214\/aos\/1176347507","volume":"18","author":"RY 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":"1","key":"28_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00454-014-9584-7","volume":"52","author":"J Matousek","year":"2014","unstructured":"Matousek, J., Wagner, U.: On Gromov\u2019s method of selecting heavily covered points. Discret. Comput. Geom. 52(1), 1\u201333 (2014)","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"28_CR18","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s00454-006-1264-9","volume":"36","author":"J Pach","year":"2006","unstructured":"Pach, J., Radoi\u010di\u0107, R., Tardos, G., T\u00f3th, G.: Improving the crossing lemma by finding more crossings in sparse graphs. Discret. Comput. Geom. 36(4), 527\u2013552 (2006)","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"28_CR19","doi-asserted-by":"crossref","first-page":"516","DOI":"10.2307\/2986073","volume":"45","author":"PJ Rousseeuw","year":"1996","unstructured":"Rousseeuw, P.J., Ruts, I.: Bivariate location depth. Appl. Stat.: J. Roy. Stat. Soc. Ser. C 45(4), 516\u2013526 (1996)","journal-title":"Appl. Stat.: J. Roy. Stat. Soc. Ser. C"},{"key":"28_CR20","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.jcta.2014.11.002","volume":"130","author":"P Sarrabezolles","year":"2015","unstructured":"Sarrabezolles, P.: The colourful simplicial depth conjecture. J. Combin. Theor. Ser. A 130, 119\u2013128 (2015)","journal-title":"J. Combin. Theor. Ser. A"},{"key":"28_CR21","unstructured":"Tukey, J.W.: Mathematics and the picturing of data. In: Proceedings of the International Congress of Mathematicians (Vancouver, B. C., 1974), vol. 2, pp. 523\u2013531. Canad. Math. Congress, Montreal, Que. (1975)"},{"key":"28_CR22","unstructured":"Zasenko, O.: Colourful simplicial depth in the plane (2016). https:\/\/github.com\/olgazasenko\/ColourfulSimplicialDepthInThePlane . Accessed 13 July 2016"},{"issue":"2","key":"28_CR23","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1214\/aos\/1016218226","volume":"28","author":"Y Zuo","year":"2000","unstructured":"Zuo, Y., Serfling, R.: General notions of statistical depth function. Ann. Stat. 28(2), 461\u2013482 (2000)","journal-title":"Ann. Stat."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T02:24:37Z","timestamp":1498357477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}