## Areas of Expertise

Graph theory, algorithms.

## Education

Ph.D. Computer and Information Sciences

University of Florida

1992

M.S. Computer and Information Sciences

University of Florida

1989

## Biography

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 (see Wikipedia page on Eternal Dominating Sets). 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 more than 100 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.

Dr. Klostermeyer was President of the UNF Faculty Association and a member of the UNF Board of Trustees from 2006 to 2008 and again from 2014 to 2016 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 Virgina and received his Ph.D from the University of Florida in 1992. He was on the faculty of West Virginia University from 1992-2000, a tenured Associate Professor at the end of his time there.

## Awards

Distinguished Professor Runner-up, UNF. 2019.

Distinguished Professor Runner-up, UNF. 2012

Distinguished Professor Runner-up, UNF. 2009

Outstanding Faculty Scholarship Award, UNF. 2008

President, UNF Faculty Association, 2006-2008, 2014-2016

Knight of the Golden Horseshoe, 1978

## Affiliations

Fellow of the Institute of Combinatorics and its Applications

## Grants and Contracts Awarded

NSF STEM + Computing Grant. 2019-2021 ($291,579).

## Publications & Presentations

A sample of some of my favorite publications:

- Bounds on the m-Eternal Domination Number of a Graph, M. Henning, W. Klostermeyer, and G. MacGillivray, Contributions to Discrete Mathematics 12(2) (2017), 91--103.
- Protecting a Graph with Mobile Guards, W. Klostermeyer and C. M. Mynhardt, Applicable Analysis and Discrete Mathematics 10 (2016), pp. 1-29.
- Edge Dominating Sets in Grids, W. Klostermeyer and A. Yeo, Journal of Combinatorial Mathematics and Combinatorial Computing, 95 (2015), pp. 99-117.
- Eternal Graph Coloring, W. Klostermeyer, Bulletin of the Inst. for Combinatorics and its Applications 70 (2014), pp. 69-76.
- Tight Bounds for Eternal Dominating Sets in Graphs, J. Goldwasser and W. Klostermeyer, Discrete Mathematics vol 308 (2008), pp. 2589--2593.
- Analogues of Cliques for Oriented Coloring, W. Klostermeyer and G. MacGillivray, Discussiones Mathematicae Graph Theory, vol. 24 (2004), pp. 373--388
- Fibonacci Polynomials and Parity Domination in Grid Graphs, J. Goldwasser, W. Klostermeyer, and H. Ware, Graphs and Combinatorics vol. 18 (2002), pp. 271--283.
- 2+epsilon Coloring of Planar Graphs with Large Odd Girth, W. Klostermeyer and C.-Q. Zhang, Journal of Graph Theory, vol. 33 (2000) pp. 109--119.