William Klostermeyer

35 papers A* 1C 1Journal 30Unranked 3
YearRankTypeTitle / Venue / Authors
2023 — conf
Breast-Density Semantic Segmentation with Probability Scaling for BI-RADS Assessment using DeepLabV3.
BCB
Conrad T. Testagrose, Vikash Gupta, Barbaros S. Erdal, Richard D. White, Robert W. Maxwell, Xudong Liu, Indika Kahanda, Sherif Elfayoumy, William Klostermeyer, Mutlu Demirer
2023 J jnl
Efficient (j, k)-dominating functions.
Discuss. Math. Graph Theory
William Klostermeyer, Gary MacGillivray, Saeed Semnani, Farzaneh Piri
2022 — conf
Impact of Concatenation of Digital Craniocaudal Mammography Images on a Deep-Learning Breast-Density Classifier Using Inception-V3 and ViT.
BIBM
Conrad Testagrose, Vikash Gupta, Barbaros S. Erdal, Richard D. White, Robert W. Maxwell, Xudong Liu, Indika Kahanda, Sherif Elfayoumy, William Klostermeyer, Mutlu Demirer
2017 J jnl
Bounds for the $m$-Eternal Domination Number of a Graph.
Contributions Discret. Math.
Michael A. Henning, William Klostermeyer, Gary MacGillivray
2013 J jnl
Edge dominating sets and vertex covers.
Discuss. Math. Graph Theory
Ronald D. Dutton, William Klostermeyer
2012 J jnl
Eternal Total Domination in Graphs.
Ars Comb.
William Klostermeyer, Christina M. Mynhardt
2012 J jnl
Vertex covers and eternal dominating sets.
Discret. Appl. Math.
William Klostermeyer, Christina M. Mynhardt
2011 J jnl
Graphs with equal eternal vertex cover and eternal domination numbers.
Discret. Math.
William Klostermeyer, Christina M. Mynhardt
2009 J jnl
Maximum Orbit Weights in the sigma-game and Lit-only sigma-game on Grids and Graphs.
Graphs Comb.
John L. Goldwasser, William Klostermeyer
2008 J jnl
Secure domination and secure total domination in graphs.
Discuss. Math. Graph Theory
William Klostermeyer, Christina M. Mynhardt
2008 J jnl
Tight bounds for eternal dominating sets in graphs.
Discret. Math.
John L. Goldwasser, William Klostermeyer
2007 J jnl
Odd and Even Dominating Sets with Open Neighborhoods.
Ars Comb.
John L. Goldwasser, William Klostermeyer
2005 J jnl
Connected odd dominating sets in graphs.
Discuss. Math. Graph Theory
Yair Caro, William Klostermeyer, Raphael Yuster
2004 J jnl
Analogues of cliques for oriented coloring.
Discuss. Math. Graph Theory
William Klostermeyer, Gary MacGillivray
2004 J jnl
Homomorphisms and oriented colorings of equivalence classes of oriented graphs.
Discret. Math.
William Klostermeyer, Gary MacGillivray
2003 J jnl
Planar domination graphs.
Discret. Math.
Elaine M. Eschen, William Klostermeyer, R. Sritharan
2003 J jnl
Predictors for success in a discrete math course.
ACM SIGCSE Bull.
Lisa Jamba-Joyner, William Klostermeyer
2002 — conf
Complete Traversals as General Iteration Patterns.
Generic Programming
William Klostermeyer, David R. Musser, Arturo J. Sánchez-Ruíz
2002 J jnl
Defective circular coloring.
Australas. J Comb.
William Klostermeyer
2002 J jnl
Fibonacci Polynomials and Parity Domination in Grid Graphs.
Graphs Comb.
John L. Goldwasser, William Klostermeyer, Henry Ware
2002 J jnl
n-Tuple Coloring of Planar Graphs with Large Odd Girth.
Graphs Comb.
William Klostermeyer, Cun-Quan Zhang
2001 J jnl
Odd and residue domination numbers of a graph.
Discuss. Math. Graph Theory
Yair Caro, John L. Goldwasser, William Klostermeyer
2000 J jnl
(2 + ϵ)-Coloring of planar graphs with large odd-girth.
J. Graph Theory
William Klostermeyer, Cun-Quan Zhang
2000 J jnl
An extremal connectivity parameter of tournaments.
Discret. Math.
William Klostermeyer, Lubomír Soltés
1999 J jnl
Maximization versus Minimization in Some Optimization Problems.
Bull. EATCS
William Klostermeyer
1999 J jnl
Pushing Vertices and Orienting Edges.
Ars Comb.
William Klostermeyer
1999 J jnl
The density of ones in Pascal's rhombus.
Discret. Math.
John L. Goldwasser, William Klostermeyer, Michael E. Mays, George Trapp
1998 J jnl
Hamiltonicity and reversing arcs in digraphs.
J. Graph Theory
William Klostermeyer, Lubomír Soltés
1996 J jnl
Path problems in dynamically orientable graphs.
Australas. J Comb.
William Klostermeyer
1996 J jnl
Scheduling Two Salesmen in a Network.
Int. J. Found. Comput. Sci.
William Klostermeyer
1996 J jnl
Techniques for Algorithm Design and Analysis: Case Study of a Greedy Algorithm.
Informatica (Slovenia)
William Klostermeyer, Maria Muslea
1995 J jnl
Reducing Disk Power Consumption in a Portable Computer.
ACM SIGOPS Oper. Syst. Rev.
William Klostermeyer, Kankanahalli Srinivas
1993 A* conf
A Distributed Algorithm for Detecting and Resolving Store-and-Forward Deadlocks in Networks with Minimum Exchange Buffers.
INFOCOM
Kenneth Luo, William Klostermeyer, Yuan-Chieh Chow
1993 C conf
On the competitiveness of autonomous servers.
ISADS
William Klostermeyer, Randy Y. C. Chow
1991 J jnl
Optimal Deadlock Resolutions in Edge-Disjoint Reducible Wait-For Graphs.
Inf. Process. Lett.
Kenneth Luo, William Klostermeyer, Yuan-Chieh Chow, Richard E. Newman-Wolfe