Wagner's theorem for Torus graphs. - A. K. Dewdney (Discret. Math., 1973)

Tours in Machines and Digraphs. - Alexander Keewatin Dewdney; Andrew L. Szilard (IEEE Trans. Computers, 1973)

Analysis of a steepest-descent image-matching algorithm. - Alexander Keewatin Dewdney (Pattern Recognit., 1978)

Logic circuits in the plane: minimal crossovers. - A. K. Dewdney (SIGACT News, 1979)

Diagonal Tree Codes - A. K. Dewdney (Inf. Control., 1979)

Oriented two-dimensional circuits. - A. K. Dewdney; Frank Harary (Discret. Math., 1981)

The bandwidth problem for graphs and matrices - a survey. - Phyllis Z. Chinn; J. Chvatalova; A. K. Dewdney; Norman E. Gibbs (J. Graph Theory, 1982)

Experiments with a generic reduction computer. - A. K. Dewdney (SIGACT News, 1986)

Efficient Simulation of Finite Automata by Neural Nets. - Noga Alon; A. K. Dewdney; Teunis J. Ott (J. ACM, 1991)

A Run-Length Slice Line Drawing Algorithm without Division Operations. - Khun Yee Fung; Tina M. Nicholl; A. K. Dewdney (Comput. Graph. Forum, 1992)

Der Turing Omnibus - eine Reise durch die Informatik mit 66 Stationen. - Alexander Keewatin Dewdney (Springer, 1995)