#
Selected Publication List for William F. Klostermeyer

``Roman, Italian, and 2-Domination," W. Klostermeyer and G. MacGillivray, to appear in Journal of Combinatorial Mathematics and Combinatorial Computing
``Eternal Domination in Trees,'' W. Klostermeyer and G. MacGillivray, to appear in Journal of Combinatorial Mathematics and Combinatorial Computing
``Total Vertex Covers and Edge Domination in Graphs," W. Klostermeyer and A. Yeo, to appear in Utilitas Mathematica 105 (2017)
``An Eternal Domination Problem in Grids," W. Klostermeyer, M.E.Messinger, and A. Ayello, Theory and Applications of Graphs Issue 1 of Volume 4 (2017) (23 pages)
``Italian Domination in Trees,'' M. Henning and W. Klostermeyer, Discrete Applied Mathematics 217 (2017), pp. 557-564
``Eternal Domination: Criticality and Reachability," W. Klostermeyer and G. MacGillivray, Discussiones Mathematicae Graph Theory 37 (2017), pp. 63-77
``Bounds on the $m$-Eternal Domination Number of a Graph," M. Henning, W. Klostermeyer, and G. MacGillivray, to appear in Contributions to Discrete Mathematics
``Trees with large $m$-Eternal Domination Number," M. Henning and W. Klostermeyer, Discrete Applied Mathematics 211 (2016), pp. 79-85
``A Dynamic Domination Problem: the Eviction Model for Eternal Domination," W. Klostermeyer, M. Lawrence, and G. MacGillivray,Journal of Combinatorial Mathematics and Combinatorial Computing 97 (2016), pp. 247-269
``Protecting a Graph with Mobile Guards," W. Klostermeyer and C. M. Mynhardt, Applicable Analysis and Discrete Mathematics} 10 (2016), pp. 1-29
``Eternal Independent Sets in Graphs", Y. Caro and W.Klostermeyer, Theory and Applications of Graphs 3 (2016), Article 3 in Issue 1 of volume 3 (12 pages)
`Edge Dominating Sets in Grids," W. Klostermeyer and A. Yeo, Journal of Combinatorial Mathematics and Combinatorial Computing, 95 (2015), pp. 99-117
``A Dynamic Domination Problem in Trees," W. Klostermeyer and C. M. Mynhardt, Transactions on Combinatorics 4 (2015), pp.15-31
``Domination, Eternal Domination, and Clique Covering,'' W. Klostermeyer and C. M. Mynhardt, Discussiones Mathematicae Graph Theory 35 (2015), pp. 283-300
`Eternal Graph Coloring,'' W. Klostermeyer, {\it Bulletin of the ICA} 70 (2014), pp. 69-76.
A Taxonomy of Perfect Domination, W. Klostermeyer, {\it Journal of Discrete Mathematics and Cryptography} 18 (2015), pp. 105-116
An Eternal Vertex Cover Problem, W. Klostermeyer, JCMCC 85 (2013),
pp. 79-95
Eternal Domination in Trees, W. Klostermeyer and G. MacGillivray, to
appear in JCMCC
Edge Dominating Sets and Vertex Covers, R. Dutton and W.
Klostermeyer, DMGT 33 (2013), pp. 437-456
Vertex Covers and Eternal Dominating Sets, W. Klostermeyer and C.
Mynhardt, Disc. Appl. Math 160 (2012), pp. 1183-1190
Graphs with Equal Eternal Domination and Eternal Vertex Cover
Numbers, W. Klostermeyer and C. Mynhardt, Discrete Math., vol. 311 (2011),
pp. 1371-1379
Foolproof Eternal Domination in the All-guards move model, W.
Klostermeyer and G. MacGillivray, Math Slovaka 62 (2012), pp. 595-610
Eternal Protection in Grid Graphs, J. Goldwasser, W. Klostermeyer,
and C. Mynhardt, to appear in Utilitas Mathematica
Edge Protection in Graphs, W. Klostermeyer and C. Mynhardt,
Australasian Journal of Combinatorics, 45 (2009), pp. 235-250
Maximum orbit weight in the sigma-game and lit-only sigma-game on
grids and graphs, J. Goldwasser and W. Klostermeyer, Graphs
and Combinatorics, 25 (2009), pp. 309-326
Eternal Total Domination in Graphs, W. Klostermeyer
and C. M. Mynhardt, Ars Combinatoria 68 (2012), pp, 473-492
Secure Domination and Secure Total Domination, W. Klostermeyer and
C.M. Mynhardt, Discuss. Math. Graph Theory, vol. 28 (2008), pp. 267-284
Tight Bounds on Eternal Dominating Sets, J. Goldwasser and W.
Klostermeyer, Discrete Mathematics, vol. 308 (2008), pp.2589-2593
Eternal Dominating Sets in Graphs,
W. Klostermeyer and G. MacGillivray, JCMCC, vol. 68 (2009), pp.97-111
Eternal Security in Graphs of Fixed Independence Number, W.
Klostermeyer and G. MacGillivray, JCMCC, vol. 63 (2007), pp. 97-101
Odd and Even Dominating Sets with Open Neighborhoods, J. Goldwasser
and W. Klostermeyer, Ars Combinatoria (2007), vol. 83, pp. 229-247
Total Odd Dominating Sets, W. Klostermeyer, Proceedings UNF CCEC
Symposium (2006)
Total Perfect Codes in Grid Graphs, W. Klostermeyer and J.
Goldwasser, Bulletin of ICA, vol. 46 (2006), pp. 61-68
Eternally Secure Sets, Independent Sets, and Cliques, W. Klostermeyer
and G. MacGillivray, AKCE Int'l. J. Graphs and Combinatorics, vol. 2
(2005), pp. 119-122
Parity Dominating Sets in Grid Graphs, J. Goldwasser and W.
Klostermeyer, Congressus Numerantium, vol. 172 (2005), pp. 79-96
Connected Odd Dominating Sets, Y. Caro, W. Klostermeyer, and
R. Yuster, Discussiones Mathematicae Graph Theory, 25 (2005), pp. 225-240
Program from paper
Analogs of Cliques for Oriented Coloring, W. Klostermeyer
and G. MacGillivray, Discussiones Mathematicae Graph Theory, vol 24
(2004), pp. 373-388
Parity Domination: Results and Problems, W. Klostermeyer,
Graph Theory Notes, vol 44 (2003), pp. 35-40
Homomorphisms and oriented colorings of equivalence classes of
oriented graphs, W. Klostermeyer and G. MacGillivray, Discrete
Mathematics, vol. 274 (2004), pp. 161-172
Predictors for Success in a Discrete Math Class, L. Jamba-Joyner and
W. Klostermeyer, Inroads (SIGCSE Bulletin), vol 35 (2003), pp. 66-69
Pushing Vertices and Oriented Coloring, W. Klostermeyer
and G. MacGillivray, Bulletin of ICA, vol. 40 (2004), pp. 49-58
Circular Coloring with Defects, W. Klostermeyer,
Congressus Numerantium, vol 155 (2002), pp. 15-24
Planar Domination Graphs, E. Eschen, W. Klostermeyer, and R.
Sritharan, Discrete Mathematics, vol. 268 (2003), pp. 129-137
Defective Circular Coloring, W. Klostermeyer, Austr. J.
Combinatorics, vol. 26 (2002), pp. 21-32
Nullspace Primes and Fibonacci Polynomials, W. Klostermeyer
and J. Goldwasser, Fibonacci Quarterly, vol. 40 (2002). pp. 323-327
The Odd Domination Number of a Graph; Y. Caro and W. Klostermeyer;
Journal Comb. Math. and Comb. Comput., vol. 44 (2003), pp. 65-84
Fibonacci Polynomials and Parity Domination in Grids;
J. Goldwasser, W. Klostermeyer, and H. Ware, Graphs and Combinatorics,
vol. 18 (2002), pp. 271-283
n-tuple coloring of planar graphs with large odd girth; W. Klostermeyer and
C.-Q. Zhang; Graphs and Combinatorics, vol. 18 (2002), pp. 119-132
List MultiColoring Problems, W. Klostermeyer and J. Goldwasser,
Bulletin of the Inst. of Combinatorics and its Applications, vol. 34
(2002), pp. 71-76
Complete Traversals as Generalized Iteration Patterns, W.
Klostermeyer, D. Musser, A. Sanchez-Ruiz, Proc. IFIP Conference on Generic
Programming (2002), also appears in "Generic Programming" (2003)
The Switch Chromatic Number of a Graph, W. Klostermeyer,
Graph Theory Notes, vol. 41 (2001), pp. 24-27
Odd and Residue Domination Numbers of a Graph, Y. Caro, W.
Klostermeyer and J. Goldwasser,
Discussiones Mathematicae Graph Theory, vol. 21 (2001), pp. 119-136
Tighter Bounds on a Tournament Parameter, W. Klostermeyer,
Graph Theory Notes, vol. 40 (2001), pp. 15-17
Perfect Codes and Independent Dominating Sets, W. Klostermeyer
and E. Eschen, Congressus Numerantium, vol. 142 (2000), pp. 7-28
2 + \epsilon coloring of planar graphs with large odd girth; W.
Klostermeyer and
C.-Q. Zhang; Journal of Graph Theory, vol. 33, (Feb 2000), pp.109-119
Extremal Connectivity Properties of Tournaments; W. Klostermeyer and L. Soltes,
Discrete Mathematics, vol. 223, pp, 157-173 (2000)
Dynamic Connectivity in Directed Graphs with Stack Ordered Operations, W. Klostermeyer;
Bulletin of the
Institute of Combinatorics and it Applications, vol. 29 (2000), pp. 61-66
On k-dominating, q-independent Sets; W. Klostermeyer, Bulletin of the
Institute of Combinatorics and it Applications, vol. 27 (1999), pp. 26-36
The Density of Ones in Pascal's Rhombus; J. Goldwasser, W. Klostermeyer, M. Mays,
and G. Trapp, Discrete Mathematics, vol. 204 (1999), pp. 231-236
Pushing Vertices and Orienting Edges; W. Klostermeyer; Ars Combinatoria, vol. 51 (1999), pp. 65-75
A Faster Algorithm for Least Deviant Path; R. Dutton and W. Klostermeyer,
Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 29 (1999), pp 33-40
Minimization versus Maximization in Some Optimization Problems, William
Klostermeyer, Bulletin European Assoc. for Theoretical Computer Science, vol. 69,
(1999), pp. 137-140
Hamiltonicity and Reversing Arcs in Digraphs; W. Klostermeyer and L. Soltes,
Journal of Graph Theory, vol. 28 (1998), pp. 13-30
An Analog of Camion's Theorem in Squares of Cycles; W. Klostermeyer, Congressus Numerantium,
vol. 132, 1998, pp. 205-218
On the Number of Weak-Heaps; W. Klostermeyer and M. Bugaj, JCISS, 1997
Maximization Versions of 'Lights Out' Games in Grids and Graphs; J. Goldwasser and
W. Klostermeyer, Congressus Numerantium, vol. 126, 1997, pp. 99-111
Characterizing Switch Setting Problems; J. Goldwasser, W. Klostermeyer,
and G. Trapp, Linear and Multilinear Algebra, vol. 43, no. 1-3, 1997, pp. 121-136
A Pascal Rhombus; W. Klostermeyer, M. Mays, L. Soltes, and G.
Trapp, Fibonacci Quarterly. vol. 35, no. 4, Nov. 1997, pp. 318-328
On the Least Deviant Path in a Graph; W. Klostermeyer,
Journal of Combinatorial Mathematics and Combinatorial Computing,
vol. 24, 1997, pp. 147-154
Scheduling Two Salesmen in a Network; W. Klostermeyer,
International Journal of Foundations of Computer Science, vol. 7, no. 4,
1996, pp. 353-358
Path Problems in Dynamically Orientable Graphs; W. Klostermeyer,
Australasian Journal of Combinatorics, vol. 14, 1996, pp. 21-30
Techniques for Algorithm Design and Analysis: Case Study of a Greedy Algorithm;
W. Klostermeyer and M. Muslea; Informatica, vol. 20, 1996, pp. 185-190
Setting Switches on a Grid; J. Goldwasser, W. Klostermeyer, G. Trapp,
and C.Q. Zhang, Technical Report #95-20, Department of
Statistics and Computer Science, WVU, 1995
Another Way to Solve Nine Tails; F. Delahan, W. Klostermeyer, and
G. Trapp; SIGCSE Bulletin, vol. 27, 1995, no. 4, pp. 27-28, 34
On-line Scheduling with Optimal Worst-Case Response Time; W. Klostermeyer,
Journal of Information and Optimization Sciences, vol. 16, 1995,
no. 3, pp. 449-460
On the Complexity of Scheduling to Optimize Average Response Time; W.
Klostermeyer, Journal of Information and Optimization Sci.,
vol. 14 1993, pp. 21-32
On the Competitiveness of Autonomous Servers; W. Klostermeyer and
Y.-C. Chow, Proceedings IEEE International Symposium on Autonomous
Decentralized Systems; Tokyo, Japan; March 1993, pp. 168-174
A Distributed Algorithm for Detecting and Resolving Store-and-Forward Deadlocks
in Networks with Minimum Exchange Buffers," K. Luo, W. Klostermeyer,
and Y.-C. Chow, Proceedings IEEE INFOCOM, 1993, pp. 994-1003
DAG Compression for Improving Response Time After Deadlock Resolution;
W. Klostermeyer, R. Newman-Wolfe, K. Luo; and
Y.-C. Chow; Congressus Numerantium; vol. 81, 1991, pp. 209-218
Optimal Deadlock Resolution in Edge-Disjoint Reducible Graphs; K. Luo,
W. Klostermeyer, Y.-C. Chow, and R. Newman-Wolfe,
Information Processing Letters; vol. 38, 1991, pp.307-313