David J. Haglin's Erdös Number

My currently best (lowest) known Erdös Number is three (3) as can be seen by the following citations:
  • Paul Erdös, Michael Saks, and Vera T Sós, "Maximum induced trees in graphs", Journal of Combinatorial Theory, Series B 41:1 (1986), 61-79.

  • Afek, Yehuda, Baruch Awerbuch, Serge Plotkin and Michael Saks, "Local management of a global resource in a communication network", Journal of the ACM 43 (1996), no. 1, 1-19.

  • Fischer, T., A.V. Goldberg, D.J. Haglin, and S. Plotkin, "Approximating Matchings in Parallel", Information Processing Letters 46 (1993), 115-118.
  • P. Erdös, R. L. Hemminger, D. A. Holton and B. D. McKay, "On the chessmaster problem", in Progress in Graph Theory, (Academic Press, 1984) 532-536.
  • Wolf, M.J., Easteal, S., Kahn, M., McKay, B.D., and Jermiin, L.S., "TrExML: A maximum likelihood program for extensive tree-space exploration", Bioinformatics 16:383-394, 2000.
  • D.J. Haglin, and M.J. Wolf, "On Convex Subsets in Tournaments", SIAM Journal on Discrete Mathematics vol. 9 no. 1, pp. 63-70, February, 1996.