Nathan Lemons
Impact in
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
- Artificial Intelligence top 10%
- Quantum Computing Algorithms and Architecture
- Quantum Information and Cryptography
Papers in
-
- Limits and Structures in Graph Theory 12
- Advanced Combinatorial Mathematics 7
-
- Complex Network Analysis Techniques 3
- Co-authors
- Ervin Győri (7 shared papers)Gyula Y. Katona (2 shared papers)Cory Palmer (10 shared papers)Balázs Patkós (7 shared papers)Balázs Keszegh (5 shared papers)Dömötör Pálvölgyi (6 shared papers)Aric A. Hagberg (4 shared papers)Dániel Gerbner (6 shared papers)
- Journals
- Graphs and Combinatorics (3 papers)SIAM Journal on Discrete Mathematics (2 papers)Discrete Mathematics (2 papers)The Journal of Physical Chemistry B (1 paper)BMC Bioinformatics (1 paper)
- Partner nations
- United StatesHungaryAustria
In The Last Decade
Nathan Lemons
31 papers receiving 397 citations
Peers
Comparison fields: 5 of 30
- Discrete Mathematics and Combinatorics 239
- Artificial Intelligence 103
- Computational Mathematics 1
- Computational Theory and Mathematics 25
- Computer Graphics and Computer-Aided Design 6
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 33 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2022 | 98 | |
| 2 | 2012 | 46 | |
| 3 | 2016 | 41 | |
| 4 | 2012 | 36 | |
| 5 | 2012 | 23 | |
| 6 | 2014 | 19 | |
| 7 | 2021 | 18 | |
| 8 | 2010 | 16 | |
| 9 | 2011 | 15 | |
| 10 | 2008 | 14 | |
| 11 | 2020 | 12 | |
| 12 | 2012 | 10 | |
| 13 | 2021 | 8 | |
| 14 | 2011 | 6 | |
| 15 | 2015 | 6 | |
| 16 | 2016 | 6 | |
| 17 | 2023 | 5 | |
| 18 | 2009 | 4 | |
| 19 | 2015 | 4 | |
| 20 | 2009 | 3 |
About Nathan Lemons
Nathan Lemons is a scholar working on Discrete Mathematics and Combinatorics, Statistical and Nonlinear Physics, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Statistics and Probability, having authored 33 papers that have together received 412 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (12 papers), Advanced Combinatorial Mathematics (7 papers), Advanced Graph Theory Research (4 papers), Complex Network Analysis Techniques (3 papers), Computational Geometry and Mesh Generation (2 papers), Gene Regulatory Network Analysis (2 papers), Optimization and Search Problems (2 papers) and Quantum Computing Algorithms and Architecture (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (239 citations), Artificial Intelligence (103 citations), Computational Mathematics (1 citation), Computational Theory and Mathematics (25 citations) and Computer Graphics and Computer-Aided Design (6 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, Balázs Patkós, Balázs Keszegh, Dömötör Pálvölgyi, Aric A. Hagberg, Dániel Gerbner, Bin Hu and Joshua Neil. Their work appears in journals such as Graphs and Combinatorics, SIAM Journal on Discrete Mathematics, Discrete Mathematics, The Journal of Physical Chemistry B and BMC Bioinformatics.
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.