William F. “Chip” Klostermeyer is a Professor in the School of Computing. He is a graph theorist, interested in problems in domination theory and graph coloring. Recent work has centered on proving theorems describing the number of mobile guards needed within a network to defend it against an infinite series of attacks. His other papers include ones on problems related to the famous “four-color” map-coloring problem and a long series of papers with John Goldwasser on the parity domination problem. He has published 69 refereed papers in these areas in journals such as Journal of Graph Theory, Discrete Mathematics, and Graphs and Combinatorics. His work has been extensively cited in the literature and two of his papers have been ranked among the most-downloaded papers of the year for the journal Discrete Mathematics. He won the UNF Outstanding Faculty Scholarship Award in 2008 and is a "Fellow" of the Institute for Combinatorics and its Applications.
Dr. Klostermeyer was President of the UNF Faculty Association and a member of the UNF Board of Trustees from 2006 to 2008. He has served as chair of the Academic Standards Committee (2003-2004), chair of the Faculty Affairs Committee (2008-2009), and chair of the Intercollegiate Athletic Committee (2004-2006).
Dr. Klostermeyer is a native of Charleston, West Virginia and received his Ph.D. from the University of Florida in 1992.