Publications

On the Graphical Containment of Discrete Metric Spaces.Discrete Mathematics, 1994, 131, 51-66. Elsevier Science.

David Dailey and Joseph Thompson. Discussion. In Base 1, Grazer Stadtmuseum, Austria 1992, Ritter Klegenfurt. Published on the occasion of the opening of an art exhibition by Hannes Priesch at the Grazer Stadtmuseum, Vienna.

The Extraction of a Minimum Set of Semantic Primitives from a Monolingual Dictionary is NP-complete. Computational Linguistics Oct.-Dec., 1986, 12: 306-307.

Crossover Graphs and Generalized Input/output Coloring Problems in the Plane. Journal of Combinatorics, Information and Systems Sciences, 1980, 5:271-280.

Uniqueness of Colorability and Colorability of Planar 4-regular Graphs are NP-complete. Discrete Mathematics 1980, 30:289-293. Elsevier Science.

L. Zusne and D. Dailey. History of Psychological Texts As Measuring Instruments of Eminence In Psychology. Rivista de Historia de la Psicologia. 1982, 3:7-42.

An Analysis and Evaluation of the Internal Validity of the Remote Associations Test. Educational and Psychological Measurement. 1978, 38:1031-1039.

Graph Coloring by Humans and Machines: A Polynomial Complete Problem Solving Task. Doctoral thesis, University of Colorado, 1978.