1. L. Addario-Berry, N. Broutin, and B. Reed, The diameter of the minimum spanning tree of a complete graph, Proceedings of the Fourth Colloquium on Mathematics and Computer Science, P. Chassaing, ed., 2006, pp. 237–248. Discrete Mathematics and Theoretical Computer Science.
2. Local depth
3. Breakdown and groups
4. Breakdown Properties of Location Estimates Based on Halfspace Depth and Projected Outlyingness
5. C. Ducruet and J.P. Rodrigue, Graph theory: Measures and indices, in The Graph Theory of Transportation System, 3rd ed., J.P. Rodrigue, ed., Routledge, New York, 2013, pp. 312–316.