My publications

Articles

D. Chen, and P. Morin. Approximating majority depth. Computational Geometry: Theory and Applications, 46(9), 2013. Special issue for CCCG 2012.

D. Chen, P. Morin, and U. Wagner. Absolute approximation of Tukey depth: Theory and experiments. Computational Geometry: Theory and Applications, 46(5), 2013. Special issue on geometry and optimization.

D. Chen, O. Devillers, J. Iacono, S. Langerman, and P. Morin. Oja centers and centers of gravity. Computational Geometry: Theory and Applications, 46(2), 2013. Special issue for CCCG 2010.

D. Chen, V. Dujmovic, L. Devroye, and P. Morin. Memoryless routing in convex subdivisions: Random walks are optimal. Computational Geometry: Theory and Applications, 45(4), 2012. Extended abstract appeared in Proceedings of the 26th European Workshop on Computational Geometry (EuroCG 2010).

D. Chen, and P. Morin. Algorithms for bivariate majority depth. In Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011), 2011.

D. Bremner, D. Chen. A Branch and Cut Algorithm for the Halfspace Depth Problem. arXiv:0910.1923, 2009.

D. Bremner, D. Chen, J. Iacono, S. Langerman, and P. Morin. Output-sensitive algorithms for Tukey depth and related problems. Statistics and Computing, 18(3), 2008.

Presentations

D. Chen, and P. Morin. Approximating majority depth. The 24nd Canadian Conference on Computational Geometry (CCCG 2012), Charlottetown, Canada. August, 2012.

D. Chen, and P. Morin. Algorithms for bivariate majority depth. The 23nd Canadian Conference on Computational Geometry (CCCG 2011), Toronto, Canada. August, 2011.

D. Chen, O. Devillers, J. Iacono, S. Langerman, and P. Morin. Oja centers and centers of gravity. The 22nd Canadian Conference on Computational Geometry (CCCG 2010), Winnipeg, Manitoba, Canada. August, 2010.

D. Chen, P. Morin, and U. Wagner. Absolute approximation of Tukey depth: Theory and experiments. 2010 CMS summer meeting, Fredericton, Canada. June 2010.

D. Chen, V. Dujmovic, L. Devroye, and P. Morin. Memoryless routing in convex subdivisions: Random walks are optimal. The 26th European Workshop on Computational Geometry (EuroCG'10), Dortmund, Germany. March, 2010.

D. Bremner and D. Chen. A branch and cut algorithm for the halfspace depth problem. Optimization Days 2007, Montreal, Canada. May, 2007.

D. Bremner and D. Chen. A branch and cut algorithm for the halfspace depth problem. Radcliffe Institute Seminar on Computational Aspects of Statistical Data Depth Analysis, Cambridge, MA, USA. July, 2006.

D. Bremner and D. Chen. A branch and cut algorithm for the halfspace depth problem. Poster presentation, CAIMS-MITACS Annual Conference, Toronto, Canada. June 2006.