Syracuse University, Syracuse, New York 13244
Ph.D. in Mathematics, July 1999
M.S. in Mathematics, May 1994
University of New Hampshire, Durham, New Hampshire 03824
B.S. with Honors in Mathematics Interdisciplinary with Computer Science, Summa Cum Laude, May 1991
Areas of Research / Professional Expertise
K. K. Ferland and Robert W. Pratt, Maximal Crossword Grids, Journal of Combinatorial Mathematics and Combinatorial Computing, accepted February 2017.
K. K. Ferland, Extending Two Classic Proofs of the Pythagorean Theorem to the Law of Cosines, MAA Mathematics Magazine, Volume 90, No. 3, June 2017, To Appear.
K. K. Ferland, Record Crosswords, Amer. Math. Monthly 121 (2014), No. 6, pp. 534–536.
K. K. Ferland, Mathematician’s Crossword, MAA Focus, Volume 32, No. 6, p. 9, December 2012/January 2013.
K. K. Ferland, Toughness of Infinite Graphs, ARS Combinatoria, Volume 97A, pp. 319-326, 2010.
L. L. Doty and K. K. Ferland, Constructing a Large Class of Supertough Graphs, Australasian Journal of Combinatorics Volume 43, pp. 191-196, 2009.
L. L. Doty and K. K. Ferland, Supertough 5-Regular Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 64, pp. 97-108, 2008.
L. L. Doty and K. K. Ferland, Some Maximally Tough Circulants, ARS Combinatoria, Volume 87, pp. 193-203, 2008.
K. K. Ferland, Sweet Tangent Line, The Journal of Irreproducible Results, Volume 50, Number 4, p.7, 2007.
Bill Calhoun, Kevin Ferland, Lisa Lister, and John Polhill, Minimal Distinct Distance Trees, Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 61, pp. 33-57, 2007.
K. K. Ferland and M. L. Holben, The Tough Sets for the Generalized Petersen Graphs G(n,2), Australasian Journal of Combinatorics, Volume 34, pp. 211-228, 2006.