Michael D. Plummer
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.2%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 86
- Graph Labeling and Dimension Problems 32
- Complexity and Algorithms in Graphs 20
-
- Limits and Structures in Graph Theory 30
- Co-authors
- László Lovász (4 shared papers)R. E. L. Aldred (14 shared papers)Bjarne Toft (3 shared papers)Akira Saito (12 shared papers)Ken‐ichi Kawarabayashi (8 shared papers)Frank Harary (4 shared papers)Derek Holton (3 shared papers)V. Neumann‐Lara (1 shared paper)
- Journals
- Discrete Mathematics (31 papers)Discrete Applied Mathematics (12 papers)Journal of Graph Theory (8 papers)Journal of Combinatorial Theory Series B (6 papers)COMBINATORICA (3 papers)
- Partner nations
- United StatesJapanNew Zealand
In The Last Decade
Michael D. Plummer
86 papers receiving 1.4k citations
Peers
Comparison fields: 5 of 75
- Discrete Mathematics and Combinatorics 520
- Computational Theory and Mathematics 1.3k
- Geometry and Topology 447
- Computer Graphics and Computer-Aided Design 138
- Computer Networks and Communications 358
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 92 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1980 | 134 | |
| 2 | 2009 | 132 | |
| 3 | 1970 | 122 | |
| 4 | 1993 | 81 | |
| 5 | 2006 | 68 | |
| 6 | 1994 | 65 | |
| 7 | 1968 | 63 | |
| 8 | 1987 | 49 | |
| 9 | 1978 | 45 | |
| 10 | 1982 | 32 | |
| 11 | 2003 | 31 | |
| 12 | 1975 | 30 | |
| 13 | 2005 | 28 | |
| 14 | 1991 | 26 | |
| 15 | 1967 | 26 | |
| 16 | 1967 | 25 | |
| 17 | 2005 | 25 | |
| 18 | 2003 | 23 | |
| 19 | 1992 | 22 | |
| 20 | 1988 | 19 |
About Michael D. Plummer
Michael D. Plummer is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, Geometry and Topology and Computer Networks and Communications, having authored 92 papers that have together received 1.5k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (86 papers), Graph Labeling and Dimension Problems (32 papers), Limits and Structures in Graph Theory (30 papers), Computational Geometry and Mesh Generation (22 papers), Complexity and Algorithms in Graphs (20 papers), Graph theory and applications (15 papers), graph theory and CDMA systems (12 papers) and Interconnection Networks and Systems (11 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (520 citations), Computational Theory and Mathematics (1.3k citations), Geometry and Topology (447 citations), Computer Graphics and Computer-Aided Design (138 citations) and Computer Networks and Communications (358 citations). Michael D. Plummer has collaborated with scholars based in United States, Japan and New Zealand. Frequent co-authors include László Lovász, R. E. L. Aldred, Bjarne Toft, Akira Saito, Ken‐ichi Kawarabayashi, Frank Harary, Derek Holton, V. Neumann‐Lara, Michael A. Henning and Lowell W. Beineke. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, Journal of Graph Theory, Journal of Combinatorial Theory Series B and COMBINATORICA.
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.