David P. Dailey

Aesthetic and Practical Concerns in the Drawing of Euler and Venn Diagrams: Case Studies using SVG

David P. Dailey, 2012, ED@Diagrams.

Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete

David P. Dailey, 1980, Discret. Math..

A methodology for evaluation of web-based scholarship

David P. Dailey, 2008, SIGITE '08.

The Extraction of a Minimum Set of Semantic Primitives from a Monolingual Dictionary is NP-Complete

David P. Dailey, 1986, CL.

Constructing random polygons

Deborah Whitfield, David P. Dailey, D. Whitfield, 2008, SIGITE '08.

On the graphical containment of discrete metric spaces

David P. Dailey, 1994, Discret. Math..

An Analysis and Evaluation of the Internal Validity of the Remote Associates Test: What Does it Measure?

David P. Dailey, 1978 .