Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. - David P. Dailey (Discret. Math., 1980)

On the graphical containment of discrete metric spaces. - David P. Dailey (Discret. Math., 1994)

A methodology for evaluation of web-based scholarship. - David P. Dailey (SIGITE Conference, 2008)

Constructing random polygons. - David P. Dailey; Deborah Whitfield (SIGITE Conference, 2008)

Aesthetic and Practical Concerns in the Drawing of Euler and Venn Diagrams: Case Studies using SVG. - David P. Dailey (ED@Diagrams, 2012)