Michael D. Plummer
Impact in
- Computational Theory and Mathematics top 0.2%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
- Finite Group Theory Research
Papers in
-
- Advanced Graph Theory Research 102
- Complexity and Algorithms in Graphs 4
-
- Limits and Structures in Graph Theory 16
- Advanced Combinatorial Mathematics 4
- Co-authors
- László Lovász (5 shared papers)Robert E. L. Aldred (14 shared papers)Bjarne Toft (3 shared papers)Akira Saito (13 shared papers)Ken‐ichi Kawarabayashi (8 shared papers)Derek Holton (5 shared papers)Frank Harary (4 shared papers)Lowell W. Beineke (2 shared papers)
- Journals
- Discrete Mathematics (31 papers)Discrete Applied Mathematics (11 papers)Journal of Graph Theory (9 papers)Journal of Combinatorial Theory Series B (6 papers)The Electronic Journal of Combinatorics (3 papers)
- Partner nations
- United StatesJapanNew Zealand
In The Last Decade
Michael D. Plummer
97 papers receiving 1.7k citations
Peers
Comparison fields: 5 of 42
- Computational Theory and Mathematics 1.5k
- Discrete Mathematics and Combinatorics 303
- Geometry and Topology 168
- Algebra and Number Theory 47
- Computer Networks and Communications 59
Countries citing papers authored by Michael D. Plummer
This map shows the geographic impact of Michael D. Plummer'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 Michael D. Plummer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael D. Plummer more than expected).
Fields of papers citing papers by Michael D. Plummer
This network shows the impact of papers produced by Michael D. Plummer. 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 Michael D. Plummer. The network helps show where Michael D. Plummer may publish in the future.
Co-authors
The 25 scholars most cited alongside Michael D. Plummer, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 104 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 172 | |
| 2 | 1970 | 153 | |
| 3 | 1980 | 146 | |
| 4 | 1993 | 102 | |
| 5 | 2006 | 79 | |
| 6 | 1994 | 73 | |
| 7 | 1968 | 70 | |
| 8 | 1978 | 53 | |
| 9 | 1987 | 52 | |
| 10 | 1972 | 48 | |
| 11 | 1982 | 39 | |
| 12 | 1975 | 38 | |
| 13 | 1988 | 35 | |
| 14 | 2003 | 34 | |
| 15 | 1991 | 29 | |
| 16 | 1988 | 28 | |
| 17 | 2005 | 28 | |
| 18 | 1967 | 27 | |
| 19 | 2005 | 27 | |
| 20 | 1967 | 26 |
About Michael D. Plummer
Michael D. Plummer is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Applied Mathematics and Computer Vision and Pattern Recognition, having authored 104 papers that have together received 1.9k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (102 papers), Limits and Structures in Graph Theory (16 papers), Complexity and Algorithms in Graphs (4 papers), Advanced Combinatorial Mathematics (4 papers), Advanced Topology and Set Theory (3 papers), Graph theory and applications (1 paper), Graph Theory and Algorithms (1 paper) and Game Theory and Voting Systems (1 paper). The work is most often cited by research in Computational Theory and Mathematics (1.5k citations), Discrete Mathematics and Combinatorics (303 citations), Geometry and Topology (168 citations), Algebra and Number Theory (47 citations) and Computer Networks and Communications (59 citations). Michael D. Plummer has collaborated with scholars based in United States, Japan and New Zealand. Frequent co-authors include László Lovász, Robert E. L. Aldred, Bjarne Toft, Akira Saito, Ken‐ichi Kawarabayashi, Derek Holton, Frank Harary, Lowell W. Beineke, V. Neumann‐Lara and Michael A. Henning. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, Journal of Graph Theory, Journal of Combinatorial Theory Series B and The Electronic Journal of Combinatorics.
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.