Some Photos

  • CanaDAM 2007: small (700KB), medium (2MB), large (7MB)

  • Tutte Symposium 1997 ( numbers, names )

  • The 20th Southeastern Conference on Combinatorics, Graph Theory, and Computing (1989): small (1MB), medium (1.3MB), large (2MB)

  • My Erdős number is 2 through:
    • B.N. Clark, C.J. Colbourn, and P. Erdős, A conjecture on dominating cycles, Proceedings of the Sixteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, February 1985, pp. 189-198.
    Can you find Paul Erdős in the pictures above?

  • My Dijkstra number is (almost) 2 through:
    • M.G. Gouda, Serializable Programs, Parallelizable Assertions: A Basis for Interleaving, Beauty is our Business: A Birthday Salute to Edsger W. Dijkstra, (eds. W. J. H. Feijen, A. J. M. van Gasteren, D. Gries, and J. Misra), Springer-Verlag, pp. 135-140, 1990.