On the Recognition of Primes by Automata. - Juris Hartmanis; H. Shank (J. ACM, 1968)

Two Memory Bounds for the Recognition of Primes by Automata. - Juris Hartmanis; H. Shank (Math. Syst. Theory, 1969)

Full 4-colorings of 4-regular maps. - Kenneth A. Berman; H. Shank (J. Graph Theory, 1979)

On the edge-coloring problem for a class of 4-regular maps. - François Jaeger; H. Shank (J. Graph Theory, 1981)

Erratum: On the edge-coloring problem for a class of 4-regular maps. - François Jaeger; H. Shank (J. Graph Theory, 1982)

The cycle space of an embedded graph. - B. Richter; H. Shank (J. Graph Theory, 1984)

Edge-disjoint spanning trees: A connectedness theorem. - Martin Farber; B. Richter; H. Shank (J. Graph Theory, 1985)