S. E. Goodman

On Hamiltonian Walks in Graphs

Stephen T. Hedetniemi, S. E. Goodman, 1974, SIAM J. Comput..

An experiment in software engineering

S. E. Goodman, 1981, SOEN.

A Linear Algorithm for the Domination Number of a Tree

Stephen T. Hedetniemi, S. E. Goodman, Ernest J. Cockayne, 1975, Inf. Process. Lett..

An algorithm for the longest cycle problem

S. E. Goodman, E. T. Dixon, S. Goodman, 1976, Networks.

b-Matchings in Trees

Robert E. Tarjan, Stephen T. Hedetniemi, S. E. Goodman, 1976, SIAM J. Comput..

Advances on the Hamiltonian Completion Problem

Peter J. Slater, Stephen T. Hedetniemi, S. E. Goodman, 1975, JACM.