William F. Klostermeyer
- Computational Theory and Mathematics top 1%
- Computer Networks and Communications top 10%
- Discrete Mathematics and Combinatorics top 5%
- Electrical and Electronic Engineering
- Geometry and Topology top 10%
- Co-authors
- Christina M. MynhardtMichael A. HenningGary MacGillivrayGeorge E. TrappHenry Oliver T. WareYair CaroS. ArumugamAnders Yeo
- Topics
- Advanced Graph Theory Research (36 papers)Complexity and Algorithms in Graphs (15 papers)Optimization and Search Problems (12 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsComputer Networks and Communications
- Journals
- SHILAP Revista de lepidopterologíaDiscrete Applied MathematicsDiscrete Mathematics
- Partner nations
- United StatesCanadaSouth Africa
In The Last Decade
William F. Klostermeyer
50 papers receiving 416 citations
Peers
Comparison fields: 5 of 39
- Computational Theory and Mathematics 381
- Computer Networks and Communications 113
- Discrete Mathematics and Combinatorics 108
- Electrical and Electronic Engineering 50
- Geometry and Topology 42
Countries citing papers authored by William F. Klostermeyer
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 18 | |
| 3 | 1 | |
| 4 | 2 | |
| 5 | Edge domination in grids | 1 |
| 6 | A dynamic domination problem in trees | 2 |
| 7 | Eternal Total Domination in Graphs. | 4 |
| 8 | 2 | |
| 9 | 8 | |
| 10 | 11 | |
| 11 | Edge protection in graphs. | 12 |
| 12 | Odd and Even Dominating Sets with Open Neighborhoods. | 5 |
| 13 | 19 | |
| 14 | 8 | |
| 15 | 5 | |
| 16 | 24 | |
| 17 | Defective circular coloring. | 5 |
| 18 | Pushing Vertices and Orienting Edges. | 9 |
| 19 | 8 | |
| 20 | Techniques for Algorithm Design and Analysis: Case Study of a Greedy Algorithm. | 1 |
About William F. Klostermeyer
William F. Klostermeyer is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design, having authored 51 papers that have together received 439 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (36 papers), Complexity and Algorithms in Graphs (15 papers) and Optimization and Search Problems (12 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (108 citations), Computational Theory and Mathematics (381 citations) and Computer Networks and Communications (113 citations). William F. Klostermeyer has collaborated with scholars based in United States, Canada and South Africa. Frequent co-authors include Christina M. Mynhardt, Michael A. Henning, Gary MacGillivray, George E. Trapp, Henry Oliver T. Ware, Yair Caro, S. Arumugam, Anders Yeo, R. Newman-Wolfe and Ronald D. Dutton. Their work appears in journals such as SHILAP Revista de lepidopterología, Discrete Applied Mathematics and Discrete Mathematics.
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.