Refereed Publications

Eleanor Hare

• Tiling with Cuisenaire Rods
• Domination in Graphs
  • Chessboard Domination by Knights
  • Fractional Domination
  • Domination of Complete Grid Graphs (i.e., P_mx P_n)
  • Packing and Related Parameters
  • Other
• Unique Identifiers for Graphs
• Bandwidth of Graphs
• Other Refereed Publications

Hare, E. O. and Chinn, P. Z. "Tiling with Cuisenaire Rods." Applications of Fibonacci Numbers, Volume 6, Kluwer Academic Publishers. Edited by G. E. Bergum, A. N. Philippou and A. F. Horadam, 1996, pp. 165-171.

Hare, E. O. "Tiling a 3xn area with Cuisenaire rods of length less than or equal to k." Cong. Num. Vol. 105 (1994): 33-45.

Hare, E. O. and Fisher, D. C. "An application of beatable dominating sets to algorithms for complete grid graphs." Graph Theory, Combinatorics, and Applications Volume 1, J. Wiley. Edited by Y. Alavi and A. Schwenk, 1995, pp. 497-506.

Chang, T. Y., Clark, W. E. and Hare, E. O. "Domination numbers of grid graphs, I." Ars Comb. Vol. 338 (1994) : pp. 97-111.

Hare, E. O. "Fibonacci numbers and fractional domination of P_m x P_n." The Fibonacci Quarterly, Vol. 32 No. 1 (1994) : pp. 69-73.

Hare, E. O. and Hare, W. R. "Domination in graphs similar to grid graphs." Cong. Num. Vol. 97 (1993): pp. 143-154.

Stewart, L. S. and Hare, E. O. "Fractional domination of P_m x P_n." Cong. Num. Vol. 91 (1992): pp. 35-42.

Hare, E. O. and Hare, W. R. "k-Packing of P_m x P_n." Cong. Num. Vol. 84 (1991): pp. 33-39.

Hare, E. O. "k-Weight domination and fractional domination of P_m x P_n." Cong. Num. Vol. 78 (1990): pp. 71-80.

Fricke, G. H., Hare, E. O., Jacobs, D. P. and Majumdar, A. "On integral and fractional total domination." Cong. Num. Vol 77 (1990): pp. 87-95.

Hare, E. O., Hedetniemi, S. T., and Hare, W. R. "Algorithms for computing the domination number of kxn complete grid graphs." Cong. Num. Vol 55 (1986): pp. 81-92.

Hare, E. O. and Hedetniemi, S. T. "A linear algorithm for computing the knight's domination number of a kxn chessboard." Cong. Num. Vol 59 (1987): pp. 115-130.

Hare, E. O., Hedetniemi, S. T., Laskar, R., Peters, K., and Wimer, T. "Linear-time computability of combinatorial problems on generalized- series-parallel graphs." Discrete Algorithms and Complexity: Proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan; Perspectives in Computing 15, Academic Press (1987): pp. 437-457.

Cockayne, E. J., Hare, E. O., Hedetniemi, S. T., and Wimer, T. V. "Bounds for the domination number of grid graphs." Cong. Num. Vol. 47 (1985): pp. 217-228.

Hare, E. O. "Utilization of Cut Vertices in Finding the Domination Number of a Graph." The Journal of Combinatorial Mathematics and Combinatorial Computing (to appear)

Hare, E. O. and Hedetniemi, S. T. "The (parent) certificate: a canonical data structure for trees." Cong. Num. Vol. 48 (1985): pp. 153-170.

Hare, E. O., Hedetniemi, S. T., and Hare, W. R. "Another upper bound for the bandwidth of trees." Proceedings of the Sundance Conference, Sundance, Utah, August 1-3 (1985): pp. 77-83.

Hare, W. R., Hare, E. O., and Hedetniemi, S. T. "Bandwidth of grid graphs." Proceedings of the Sundance Conference, Sundance, Utah, August 1-3 (1985): pp. 67-76.

Cheston, G. A., Hare, E. O., Hedetniemi, S. T., and Laskar, R. C. "Simplicial graphs." Cong. Num. Vol. 67 (1988): pp. 105-113.

Nowaczyk, R., Connor, A. C., Stevenson, D. E., and Hare, E. O. "Developing a prediction equation for success in introductory level computer science courses: a first attempt." Proceedings 7th National Educational Computing Conference (1986): pp. 271-278.

Fulton, J. D., Hare, W. R., Laskar, R., and Hare, E. O. "On symmetric cyclic and transitive BIB designs." Proceedings of the 12th Southeastern Conference on Combinatorics, Graph Theory and Computing, Cong. Num. Vol. 32 (1981): pp. 347-352.

Return to Eleanor Hare's vita.

Return to Eleanor Hare's home page