Output-sensitive algorithms for Tukey depth and related problems. - David Bremner; Dan Chen 003; John Iacono; Stefan Langerman; Pat Morin (Stat. Comput., 2008)

A Branch and Cut Algorithm for the Halfspace Depth Problem - David Bremner; Dan Chen 003 (CoRR, 2009)

Oja medians and centers of gravity. - Dan Chen 003; Olivier Devillers; John Iacono; Stefan Langerman; Pat Morin (CCCG, 2010)

Algorithms for Bivariate Majority Depth. - Dan Chen 003; Pat Morin (CCCG, 2011)

Memoryless routing in convex subdivisions: Random walks are optimal. - Dan Chen 003; Luc Devroye; Vida Dujmovic; Pat Morin (Comput. Geom., 2012)

Oja centers and centers of gravity. - Dan Chen 003; Olivier Devillers; John Iacono; Stefan Langerman; Pat Morin (Comput. Geom., 2013)

Approximating majority depth. - Dan Chen 003; Pat Morin (Comput. Geom., 2013)

Absolute approximation of Tukey depth: Theory and experiments. - Dan Chen 003; Pat Morin; Uli Wagner 001 (Comput. Geom., 2013)

Reprint of: Approximating majority depth. - Dan Chen 003; Pat Morin (Comput. Geom., 2015)