default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Klostermeyer
Person information
- affiliation: University of North Florida, Jacksonville, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j40]William Klostermeyer, Gary MacGillivray, Saeed Semnani, Farzaneh Piri:
Efficient (j, k)-dominating functions. Discuss. Math. Graph Theory 43(1): 115-135 (2023)- [c6]Conrad T. Testagrose
, Vikash Gupta, Barbaros S. Erdal, Richard D. White, Robert W. Maxwell, Xudong Liu, Indika Kahanda, Sherif Elfayoumy, William Klostermeyer, Mutlu Demirer:
Breast-Density Semantic Segmentation with Probability Scaling for BI-RADS Assessment using DeepLabV3. BCB 2023: 25:1-25:6 - 2022
- [c5]Conrad Testagrose, Vikash Gupta, Barbaros S. Erdal, Richard D. White, Robert W. Maxwell, Xudong Liu, Indika Kahanda, Sherif Elfayoumy, William Klostermeyer, Mutlu Demirer:
Impact of Concatenation of Digital Craniocaudal Mammography Images on a Deep-Learning Breast-Density Classifier Using Inception-V3 and ViT. BIBM 2022: 3399-3406 - 2021
- [j39]William F. Klostermeyer, Margaret-Ellen Messinger, Anders Yeo:
Dominating vertex covers: the vertex-edge domination problem. Discuss. Math. Graph Theory 41(1): 123-132 (2021) - 2020
- [j38]Keith Driscoll, William F. Klostermeyer, Elliot Krop, Colton Magnant, Patrick Taylor:
On eternal domination and Vizing-type inequalities. AKCE Int. J. Graphs Comb. 17(3): 708-712 (2020)
2010 – 2019
- 2018
- [j37]Michael A. Henning, William F. Klostermeyer, Gary MacGillivray:
Perfect Roman domination in trees. Discret. Appl. Math. 236: 235-245 (2018) - 2017
- [j36]Michael A. Henning, William Klostermeyer, Gary MacGillivray:
Bounds for the $m$-Eternal Domination Number of a Graph. Contributions Discret. Math. 12(2) (2017) - [j35]Michael A. Henning, William F. Klostermeyer:
Italian domination in trees. Discret. Appl. Math. 217: 557-564 (2017) - [j34]William F. Klostermeyer, Margaret-Ellen Messinger, Alejandro Angeli Ayello:
Disjoint dominating sets with a perfect matching. Discret. Math. Algorithms Appl. 9(5): 1750065:1-1750065:20 (2017) - [j33]William F. Klostermeyer, Gary MacGillivray:
Eternal domination: criticality and reachability. Discuss. Math. Graph Theory 37(1): 63-77 (2017) - 2016
- [j32]Michael A. Henning, William F. Klostermeyer:
Trees with large m-eternal domination number. Discret. Appl. Math. 211: 79-85 (2016) - 2015
- [j31]William F. Klostermeyer, Christina M. Mynhardt:
Domination, eternal domination and clique covering. Discuss. Math. Graph Theory 35(2): 283-300 (2015) - 2013
- [j30]Ronald D. Dutton, William Klostermeyer:
Edge dominating sets and vertex covers. Discuss. Math. Graph Theory 33(2): 437-456 (2013) - 2012
- [j29]William Klostermeyer, Christina M. Mynhardt:
Eternal Total Domination in Graphs. Ars Comb. 107: 473-492 (2012) - [j28]William Klostermeyer, Christina M. Mynhardt:
Vertex covers and eternal dominating sets. Discret. Appl. Math. 160(7-8): 1183-1190 (2012) - 2011
- [j27]William Klostermeyer, Christina M. Mynhardt:
Graphs with equal eternal vertex cover and eternal domination numbers. Discret. Math. 311(14): 1371-1379 (2011)
2000 – 2009
- 2009
- [j26]William F. Klostermeyer, Christina M. Mynhardt:
Edge protection in graphs. Australas. J Comb. 45: 235-250 (2009) - [j25]John L. Goldwasser, William Klostermeyer:
Maximum Orbit Weights in the sigma-game and Lit-only sigma-game on Grids and Graphs. Graphs Comb. 25(3): 309-326 (2009) - 2008
- [j24]John L. Goldwasser, William Klostermeyer:
Tight bounds for eternal dominating sets in graphs. Discret. Math. 308(12): 2589-2593 (2008) - [j23]William Klostermeyer, Christina M. Mynhardt:
Secure domination and secure total domination in graphs. Discuss. Math. Graph Theory 28(2): 267-282 (2008) - 2007
- [j22]John L. Goldwasser, William Klostermeyer:
Odd and Even Dominating Sets with Open Neighborhoods. Ars Comb. 83 (2007) - 2005
- [j21]Yair Caro, William Klostermeyer, Raphael Yuster:
Connected odd dominating sets in graphs. Discuss. Math. Graph Theory 25(3): 225-239 (2005) - 2004
- [j20]William Klostermeyer, Gary MacGillivray:
Homomorphisms and oriented colorings of equivalence classes of oriented graphs. Discret. Math. 274(1-3): 161-172 (2004) - [j19]William Klostermeyer, Gary MacGillivray:
Analogues of cliques for oriented coloring. Discuss. Math. Graph Theory 24(3): 373-387 (2004) - 2003
- [j18]Elaine M. Eschen, William Klostermeyer, R. Sritharan:
Planar domination graphs. Discret. Math. 268(1-3): 129-137 (2003) - [j17]Lisa Jamba-Joyner, William Klostermeyer:
Predictors for success in a discrete math course. ACM SIGCSE Bull. 35(2): 66-69 (2003) - 2002
- [j16]William Klostermeyer:
Defective circular coloring. Australas. J Comb. 26: 21-32 (2002) - [j15]William Klostermeyer, Cun-Quan Zhang:
n-Tuple Coloring of Planar Graphs with Large Odd Girth. Graphs Comb. 18(1): 119-132 (2002) - [j14]John L. Goldwasser, William Klostermeyer, Henry Ware:
Fibonacci Polynomials and Parity Domination in Grid Graphs. Graphs Comb. 18(2): 271-283 (2002) - [c4]William Klostermeyer, David R. Musser, Arturo J. Sánchez-Ruíz:
Complete Traversals as General Iteration Patterns. Generic Programming 2002: 187-206 - 2001
- [j13]Yair Caro, John L. Goldwasser, William Klostermeyer:
Odd and residue domination numbers of a graph. Discuss. Math. Graph Theory 21(1): 119-136 (2001) - 2000
- [j12]William Klostermeyer, Lubomír Soltés:
An extremal connectivity parameter of tournaments. Discret. Math. 223(1-3): 157-173 (2000) - [j11]William Klostermeyer, Cun-Quan Zhang:
(2 + ϵ)-Coloring of planar graphs with large odd-girth. J. Graph Theory 33(2): 109-119 (2000)
1990 – 1999
- 1999
- [j10]William Klostermeyer:
Pushing Vertices and Orienting Edges. Ars Comb. 51 (1999) - [j9]John L. Goldwasser, William Klostermeyer, Michael E. Mays, George Trapp:
The density of ones in Pascal's rhombus. Discret. Math. 204(1-3): 231-236 (1999) - [j8]William Klostermeyer:
Maximization versus Minimization in Some Optimization Problems. Bull. EATCS 69: 137-140 (1999) - 1998
- [j7]William Klostermeyer, Lubomír Soltés:
Hamiltonicity and reversing arcs in digraphs. J. Graph Theory 28(1): 13-30 (1998) - 1996
- [j6]William Klostermeyer:
Path problems in dynamically orientable graphs. Australas. J Comb. 14: 21-30 (1996) - [j5]William Klostermeyer:
Scheduling Two Salesmen in a Network. Int. J. Found. Comput. Sci. 7(4): 353-358 (1996) - [j4]William Klostermeyer, Maria Muslea:
Techniques for Algorithm Design and Analysis: Case Study of a Greedy Algorithm. Informatica (Slovenia) 20(2) (1996) - 1995
- [j3]Franz A. Delahan, William F. Klostermeyer, George Trapp:
Another way to solve nine-tails. ACM SIGCSE Bull. 27(4): 27-28 (1995) - [j2]William Klostermeyer, Kankanahalli Srinivas:
Reducing Disk Power Consumption in a Portable Computer. ACM SIGOPS Oper. Syst. Rev. 29(2): 27-32 (1995) - 1993
- [c3]Kenneth Luo, William Klostermeyer, Yuan-Chieh Chow:
A Distributed Algorithm for Detecting and Resolving Store-and-Forward Deadlocks in Networks with Minimum Exchange Buffers. INFOCOM 1993: 994-1003 - [c2]William Klostermeyer, Randy Y. C. Chow:
On the competitiveness of autonomous servers. ISADS 1993: 158-164 - 1991
- [j1]Kenneth Luo, William Klostermeyer, Yuan-Chieh Chow, Richard E. Newman-Wolfe:
Optimal Deadlock Resolutions in Edge-Disjoint Reducible Wait-For Graphs. Inf. Process. Lett. 38(6): 307-313 (1991) - [c1]Yuan-Chieh Chow, William F. Klostermeyer, Kenneth Luo:
Efficient techniques for deadlock resolution in distributed systems. COMPSAC 1991: 64-69
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
