Efficient techniques for deadlock resolution in distributed systems. - Yuan-Chieh Chow; William F. Klostermeyer; Kenneth Luo (COMPSAC, 1991)

Optimal Deadlock Resolutions in Edge-Disjoint Reducible Wait-For Graphs. - Kenneth Luo; William Klostermeyer; Yuan-Chieh Chow; Richard E. Newman-Wolfe (Inf. Process. Lett., 1991)

A Distributed Algorithm for Detecting and Resolving Store-and-Forward Deadlocks in Networks with Minimum Exchange Buffers. - Kenneth Luo; William Klostermeyer; Yuan-Chieh Chow (INFOCOM, 1993)

On the competitiveness of autonomous servers. - William Klostermeyer; Randy Y. C. Chow (ISADS, 1993)

Another way to solve nine-tails. - Franz A. Delahan; William F. Klostermeyer; George Trapp (ACM SIGCSE Bull., 1995)

Reducing Disk Power Consumption in a Portable Computer. - William Klostermeyer; Kankanahalli Srinivas (ACM SIGOPS Oper. Syst. Rev., 1995)

Path problems in dynamically orientable graphs. - William Klostermeyer (Australas. J Comb., 1996)

Scheduling Two Salesmen in a Network. - William Klostermeyer (Int. J. Found. Comput. Sci., 1996)

Techniques for Algorithm Design and Analysis: Case Study of a Greedy Algorithm. - William Klostermeyer; Maria Muslea (Informatica (Slovenia), 1996)

Hamiltonicity and reversing arcs in digraphs. - William Klostermeyer; Lubomír Soltés (J. Graph Theory, 1998)

Pushing Vertices and Orienting Edges. - William Klostermeyer (Ars Comb., 1999)

The density of ones in Pascal's rhombus. - John L. Goldwasser; William Klostermeyer; Michael E. Mays; George Trapp (Discret. Math., 1999)

Maximization versus Minimization in Some Optimization Problems. - William Klostermeyer (Bull. EATCS, 1999)

An extremal connectivity parameter of tournaments. - William Klostermeyer; Lubomír Soltés (Discret. Math., 2000)

(2 + ϵ)-Coloring of planar graphs with large odd-girth. - William Klostermeyer; Cun-Quan Zhang (J. Graph Theory, 2000)

Odd and residue domination numbers of a graph. - Yair Caro; John L. Goldwasser; William Klostermeyer (Discuss. Math. Graph Theory, 2001)

Complete Traversals as General Iteration Patterns. - William Klostermeyer; David R. Musser; Arturo J. Sánchez-Ruíz (Generic Programming, 2002)

Defective circular coloring. - William Klostermeyer (Australas. J Comb., 2002)

Fibonacci Polynomials and Parity Domination in Grid Graphs. - John L. Goldwasser; William Klostermeyer; Henry Ware (Graphs Comb., 2002)

n-Tuple Coloring of Planar Graphs with Large Odd Girth. - William Klostermeyer; Cun-Quan Zhang (Graphs Comb., 2002)

Planar domination graphs. - Elaine M. Eschen; William Klostermeyer; R. Sritharan (Discret. Math., 2003)

Predictors for success in a discrete math course. - Lisa Jamba-Joyner; William Klostermeyer (ACM SIGCSE Bull., 2003)

Homomorphisms and oriented colorings of equivalence classes of oriented graphs. - William Klostermeyer; Gary MacGillivray (Discret. Math., 2004)

Analogues of cliques for oriented coloring. - William Klostermeyer; Gary MacGillivray (Discuss. Math. Graph Theory, 2004)

Connected odd dominating sets in graphs. - Yair Caro; William Klostermeyer; Raphael Yuster (Discuss. Math. Graph Theory, 2005)

Odd and Even Dominating Sets with Open Neighborhoods. - John L. Goldwasser; William Klostermeyer (Ars Comb., 2007)

Tight bounds for eternal dominating sets in graphs. - John L. Goldwasser; William Klostermeyer (Discret. Math., 2008)

Secure domination and secure total domination in graphs. - William Klostermeyer; Christina M. Mynhardt (Discuss. Math. Graph Theory, 2008)

Edge protection in graphs. - William F. Klostermeyer; Christina M. Mynhardt (Australas. J Comb., 2009)

Maximum Orbit Weights in the sigma-game and Lit-only sigma-game on Grids and Graphs. - John L. Goldwasser; William Klostermeyer (Graphs Comb., 2009)

Graphs with equal eternal vertex cover and eternal domination numbers. - William Klostermeyer; Christina M. Mynhardt (Discret. Math., 2011)

Eternal Total Domination in Graphs. - William Klostermeyer; Christina M. Mynhardt (Ars Comb., 2012)

Vertex covers and eternal dominating sets. - William Klostermeyer; Christina M. Mynhardt (Discret. Appl. Math., 2012)

Edge dominating sets and vertex covers. - Ronald D. Dutton; William Klostermeyer (Discuss. Math. Graph Theory, 2013)

Domination, eternal domination and clique covering. - William F. Klostermeyer; Christina M. Mynhardt (Discuss. Math. Graph Theory, 2015)

Trees with large m-eternal domination number. - Michael A. Henning; William F. Klostermeyer (Discret. Appl. Math., 2016)

Bounds for the $m$-Eternal Domination Number of a Graph. - Michael A. Henning; William Klostermeyer; Gary MacGillivray (Contributions Discret. Math., 2017)

Italian domination in trees. - Michael A. Henning; William F. Klostermeyer (Discret. Appl. Math., 2017)

Disjoint dominating sets with a perfect matching. - William F. Klostermeyer; Margaret-Ellen Messinger; Alejandro Angeli Ayello (Discret. Math. Algorithms Appl., 2017)

Eternal domination: criticality and reachability. - William F. Klostermeyer; Gary MacGillivray (Discuss. Math. Graph Theory, 2017)

Perfect Roman domination in trees. - Michael A. Henning; William F. Klostermeyer; Gary MacGillivray (Discret. Appl. Math., 2018)

On eternal domination and Vizing-type inequalities. - Keith Driscoll; William F. Klostermeyer; Elliot Krop; Colton Magnant; Patrick Taylor (AKCE Int. J. Graphs Comb., 2020)

Dominating vertex covers: the vertex-edge domination problem. - William F. Klostermeyer; Margaret-Ellen Messinger; Anders Yeo (Discuss. Math. Graph Theory, 2021)

Impact of Concatenation of Digital Craniocaudal Mammography Images on a Deep-Learning Breast-Density Classifier Using Inception-V3 and ViT. - Conrad Testagrose; Vikash Gupta; Barbaros S. Erdal; Richard D. White; Robert W. Maxwell; Xudong Liu 003; Indika Kahanda; Sherif Elfayoumy; William Klostermeyer; Mutlu Demirer (BIBM, 2022)

Breast-Density Semantic Segmentation with Probability Scaling for BI-RADS Assessment using DeepLabV3. - Conrad T. Testagrose; Vikash Gupta; Barbaros S. Erdal; Richard D. White; Robert W. Maxwell; Xudong Liu 003; Indika Kahanda; Sherif Elfayoumy; William Klostermeyer; Mutlu Demirer (BCB, 2023)

Efficient (j, k)-dominating functions. - William Klostermeyer; Gary MacGillivray; Saeed Semnani; Farzaneh Piri (Discuss. Math. Graph Theory, 2023)