Wayne D Goddard

Position:
Associate Professor of Computer Science

Education:
PhD, Mathematics, Massachusetts Institute of Technology and University of Natal, 1992
BS, Mathematics and Applied Mathematics, University of Natal, 1985
BA, Economics and African Politics, University of South Africa, 2002

Professional Interests:
Graph theory, combinatorics and discrete mathematics; Graph algorithms and distributed algorithms; games.

Professional Activities:
Managing Editor, Discrete Mathematics. Member editorial board of Utilitas Mathematica, and AKCE International Journal of Graph Theory and Combinatorics. Author of: Introducing the Theory of Computation, and Research Methodology: An Introduction. Member SIAM.

Selected Publications:

• S. Brandt, R. Faudree, and W. Goddard. Weakly pancyclic graphs. J. Graph Theory, 27:141--176, 1998.
• W. Goddard and M.A. Henning. Multiple vertex coverings by cliques. J. Graph Theory, 48(2):157--167, 2005.
• W. Goddard, S.T. Hedetniemi, D.P. Jacobs, and V. Trevisan. Distance-k knowledge in self-stabilizing algorithms. Theor. Comput. Sci., 399(1-2):118--127, 2008.

Related Web Sites:
Home page.
Department of Mathematical Sciences.