Nathan Lemons
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
- Geometry and Topology top 5%
- Graph theory and applications
- Advanced Topology and Set Theory
Papers in
-
- Advanced Graph Theory Research 12
- Graph Labeling and Dimension Problems 4
-
- Limits and Structures in Graph Theory 15
- Co-authors
- Ervin Győri (6 shared papers)Gyula Y. Katona (2 shared papers)Cory Palmer (9 shared papers)Dömötör Pálvölgyi (6 shared papers)Balázs Patkós (7 shared papers)Balázs Keszegh (5 shared papers)Aric Hagberg (2 shared papers)Dániel Gerbner (6 shared papers)
- Journals
- Graphs and Combinatorics (3 papers)Discrete Mathematics (2 papers)Journal of Graph Theory (1 paper)Journal of Combinatorial Optimization (1 paper)Physical review. A (1 paper)
- Partner nations
- United StatesHungaryAustria
In The Last Decade
Nathan Lemons
23 papers receiving 214 citations
Peers
Comparison fields: 5 of 31
- Discrete Mathematics and Combinatorics 166
- Geometry and Topology 109
- Computational Theory and Mathematics 139
- Computational Mathematics 2
- Computer Graphics and Computer-Aided Design 8
Countries citing papers authored by Nathan Lemons
This map shows the geographic impact of Nathan Lemons'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 Nathan Lemons with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nathan Lemons more than expected).
Fields of papers citing papers by Nathan Lemons
This network shows the impact of papers produced by Nathan Lemons. 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 Nathan Lemons. The network helps show where Nathan Lemons may publish in the future.
Co-authors
The 25 scholars most cited alongside Nathan Lemons, 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 28 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2012 | 34 | |
| 2 | 2016 | 32 | |
| 3 | 2012 | 26 | |
| 4 | 2012 | 21 | |
| 5 | 2014 | 16 | |
| 6 | 2011 | 15 | |
| 7 | 2021 | 15 | |
| 8 | 2010 | 14 | |
| 9 | 2008 | 10 | |
| 10 | 2012 | 8 | |
| 11 | 2015 | 5 | |
| 12 | 2011 | 4 | |
| 13 | 2015 | 4 | |
| 14 | 2009 | 4 | |
| 15 | 2009 | 3 | |
| 16 | 2013 | 3 | |
| 17 | 2012 | 2 | |
| 18 | 2012 | 2 | |
| 19 | 2015 | 2 | |
| 20 | 2021 | 1 |
About Nathan Lemons
Nathan Lemons is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Electrical and Electronic Engineering and Computer Networks and Communications, having authored 28 papers that have together received 224 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (15 papers), Advanced Graph Theory Research (12 papers), graph theory and CDMA systems (7 papers), Graph theory and applications (5 papers), Advanced Topology and Set Theory (4 papers), Graph Labeling and Dimension Problems (4 papers), Computational Geometry and Mesh Generation (3 papers) and Complex Network Analysis Techniques (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (166 citations), Geometry and Topology (109 citations), Computational Theory and Mathematics (139 citations), Computational Mathematics (2 citations) and Computer Graphics and Computer-Aided Design (8 citations). Nathan Lemons has collaborated with scholars based in United States, Hungary and Austria. Frequent co-authors include Ervin Győri, Gyula Y. Katona, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós, Balázs Keszegh, Aric Hagberg, Dániel Gerbner, William S. Hlavacek and Bin Hu. Their work appears in journals such as Graphs and Combinatorics, Discrete Mathematics, Journal of Graph Theory, Journal of Combinatorial Optimization and Physical review. A.
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.