E. M. Arkin, A. F. Anta, J. S. Mitchell, and M. A. Mosteiro, Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions, Computational Geometry, vol.48, issue.2, 2011.
DOI : 10.1016/j.comgeo.2014.08.008

M. W. Bern, D. Eppstein, and F. F. Yao, The expected extremes in a Delaunay triangulation, ICALP, pp.674-685, 1991.

N. Broutin, O. Devillers, and R. Hemsley, Efficiently navigating a random Delaunay triangulation. ArXiv e-prints, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00940743

O. Devillers, Vertex removal in two-dimensional Delaunay triangulation: Speed-up by low degrees optimization, Computational Geometry, vol.44, issue.3, pp.169-177, 2011.
DOI : 10.1016/j.comgeo.2010.10.001
URL : https://hal.archives-ouvertes.fr/inria-00560379