William F. Klostermeyer

798 total citations
51 papers, 439 citations indexed

About

William F. Klostermeyer is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, William F. Klostermeyer has authored 51 papers receiving a total of 439 indexed citations (citations by other indexed papers that have themselves been cited), including 40 papers in Computational Theory and Mathematics, 24 papers in Computer Networks and Communications and 7 papers in Artificial Intelligence. Recurrent topics in William F. Klostermeyer's work include Advanced Graph Theory Research (36 papers), Complexity and Algorithms in Graphs (15 papers) and Optimization and Search Problems (12 papers). William F. Klostermeyer is often cited by papers focused on Advanced Graph Theory Research (36 papers), Complexity and Algorithms in Graphs (15 papers) and Optimization and Search Problems (12 papers). William F. Klostermeyer collaborates with scholars based in United States, Canada and South Africa. William F. Klostermeyer's co-authors include Christina M. Mynhardt, Michael A. Henning, Gary MacGillivray, George E. Trapp, Henry Oliver T. Ware, Yair Caro, S. Arumugam, R. Newman-Wolfe, Anders Yeo and Raphael Yuster and has published in prestigious journals such as SHILAP Revista de lepidopterología, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

William F. Klostermeyer

50 papers receiving 416 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
William F. Klostermeyer United States	13	381	113	108	50	42	51	439
Christina M. Mynhardt Canada	14	634 1.7×	160 1.4×	173 1.6×	29 0.6×	136 3.2×	95	679
K. B. Reid United States	10	227 0.6×	38 0.3×	106 1.0×	90 1.8×	81 1.9×	45	310
Lúcia Draque Penso Germany	9	203 0.5×	73 0.6×	58 0.5×	21 0.4×	77 1.8×	32	274
Garry L. Johns United States	7	423 1.1×	71 0.6×	167 1.5×	53 1.1×	146 3.5×	13	456
Csilla Bujtás Hungary	13	408 1.1×	79 0.7×	186 1.7×	127 2.5×	64 1.5×	72	492
Yannis Manoussakis France	14	402 1.1×	108 1.0×	171 1.6×	154 3.1×	99 2.4×	60	475
J. Richard Lundgren United States	11	233 0.6×	77 0.7×	70 0.6×	58 1.2×	79 1.9×	39	312
Joe Ryan Australia	11	338 0.9×	67 0.6×	111 1.0×	145 2.9×	103 2.5×	55	440
Mao-cheng Cai China	10	191 0.5×	54 0.5×	58 0.5×	57 1.1×	60 1.4×	36	263
Ignasi Sau France	9	222 0.6×	87 0.8×	65 0.6×	49 1.0×	20 0.5×	77	294

Countries citing papers authored by William F. Klostermeyer

Since Specialization

Citations

This map shows the geographic impact of William F. Klostermeyer's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by William F. Klostermeyer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites William F. Klostermeyer more than expected).

Fields of papers citing papers by William F. Klostermeyer

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by William F. Klostermeyer. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by William F. Klostermeyer. The network helps show where William F. Klostermeyer may publish in the future.

Co-authorship network of co-authors of William F. Klostermeyer

This figure shows the co-authorship network connecting the top 25 collaborators of William F. Klostermeyer. A scholar is included among the top collaborators of William F. Klostermeyer based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with William F. Klostermeyer. William F. Klostermeyer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Gupta, Vikash, Barbaros S. Erdal, Richard D. White, et al.. (2023). Breast-Density Semantic Segmentation with Probability Scaling for BI-RADS Assessment using DeepLabV3. 1–6. 1 indexed citations

Klostermeyer, William F. & Christina M. Mynhardt. (2016). Protecting a graph with mobile guards. Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia). 18 indexed citations

Klostermeyer, William F. & Christina M. Mynhardt. (2015). Domination, Eternal Domination, and Clique Covering. SHILAP Revista de lepidopterología. 2 indexed citations

Klostermeyer, William F. & Anders Yeo. (2015). Edge domination in grids. Journal of Combinatorial Mathematics and Combinatorial Computing. 95. 99–117. 1 indexed citations

Klostermeyer, William F. & Christina M. Mynhardt. (2015). A dynamic domination problem in trees. SHILAP Revista de lepidopterología. 2 indexed citations

Henning, Michael A., William F. Klostermeyer, & Gary MacGillivray. (2015). Bounds for the $m$-Eternal Domination Number of a Graph. Contributions to Discrete Mathematics. 12(2). 2 indexed citations

Klostermeyer, William F. & Christina M. Mynhardt. (2012). Eternal Total Domination in Graphs.. Ars Combinatoria. 107. 473–492. 4 indexed citations

Klostermeyer, William F. & Gary MacGillivray. (2012). Foolproof eternal domination in the all-guards move model. Mathematica Slovaca. 62(4). 595–610. 2 indexed citations

Klostermeyer, William F. & Christina M. Mynhardt. (2011). Vertex covers and eternal dominating sets. Discrete Applied Mathematics. 160(7-8). 1183–1190. 8 indexed citations

10.

Klostermeyer, William F. & Christina M. Mynhardt. (2011). Graphs with equal eternal vertex cover and eternal domination numbers. Discrete Mathematics. 311(14). 1371–1379. 11 indexed citations

11.

Klostermeyer, William F. & Christina M. Mynhardt. (2009). Edge protection in graphs.. Australas. J Comb.. 45. 235–250. 12 indexed citations

12.

Klostermeyer, William F., et al.. (2007). Odd and Even Dominating Sets with Open Neighborhoods.. Ars Combinatoria. 83. 5 indexed citations

13.

Klostermeyer, William F., et al.. (2007). Tight bounds for eternal dominating sets in graphs. Discrete Mathematics. 308(12). 2589–2593. 19 indexed citations

14.

Klostermeyer, William F., Gary MacGillivray, & S. Arumugam. (2005). Eternally Secure Sets, Independence Sets and Cliques. AKCE International Journal of Graphs and Combinatorics. 119–122. 8 indexed citations

15.

Klostermeyer, William F., et al.. (2003). Predictors for success in a discrete math course. ACM SIGCSE Bulletin. 35(2). 66–69. 5 indexed citations

16.

Klostermeyer, William F.. (2002). Defective circular coloring.. Australas. J Comb.. 26. 21–32. 5 indexed citations

17.

Klostermeyer, William F., et al.. (2000). (2 + ε)-Coloring of planar graphs with large odd-girth. Journal of Graph Theory. 33(2). 109–109. 21 indexed citations

18.

Klostermeyer, William F.. (1999). Pushing Vertices and Orienting Edges.. Ars Combinatoria. 51. 9 indexed citations

19.

Klostermeyer, William F., et al.. (1998). Hamiltonicity and reversing arcs in digraphs. Journal of Graph Theory. 28(1). 13–30. 8 indexed citations

20.

Klostermeyer, William F. & Maria Muslea. (1996). Techniques for Algorithm Design and Analysis: Case Study of a Greedy Algorithm.. Informatica (slovenia). 20. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact