Computing a Rectilinear Steiner Minimal Tree in nO(sqrt(n)) Time. - Clark D. Thomborson; Linda L. Deneen; Gary M. Shute (Parallel Algorithms and Architectures, 1987)

The contour model as an instructional tool in elementary computer science courses. - Linda L. Deneen (SIGCSE, 1987)

Development and documentation of computer programs in undergraduate computer science programs. - Linda L. Deneen; Keith R. Pierce (SIGCSE, 1988)

Polygonizations of Point Sets in the Plane. - Linda L. Deneen; Gary M. Shute (Discret. Comput. Geom., 1988)

Teaching Software Design in the Freshman Year. - Keith R. Pierce; Linda L. Deneen; Gary M. Shute (CSEE, 1991)

An O(n log n) Plane-Sweep Algorithm for L_1 and L_ infty Delaunay Triangulations. - Gary M. Shute; Linda L. Deneen; Clark D. Thomborson (Algorithmica, 1991)

A Probaby Fast, Provably Optimal Algorithm for Rectilinear Steiner Trees. - Linda L. Deneen; Gary M. Shute; Clark D. Thomborson (Random Struct. Algorithms, 1994)