Ben Lund
- Communication top 5%
- Information Systems top 5%
- Computer Science Applications top 10%
-
- Limits and Structures in Graph Theory 10
-
- Computational Geometry and Mesh Generation 7
-
- Advanced Graph Theory Research 6
- Graph Labeling and Dimension Problems 2
-
- Point processes and geometric inequalities 3
-
- Mathematical Approximation and Integration 3
-
- Graph theory and applications 3
-
- graph theory and CDMA systems 2
- Co-authors
- Timo HannayTony HammondRichard Bengt PriceShubhangi SarafAdam ShefferOliver Roche‐NewtonAlex IosevichMisha Rudnev
- Journals
- D-Lib Magazine (3 papers)SIAM Journal on Discrete Mathematics (3 papers)Discrete & Computational Geometry (2 papers)
- Partner nations
- United StatesSouth KoreaUnited Kingdom
In The Last Decade
Ben Lund
14 papers receiving 441 citations
Peers
Comparison fields: 5 of 71
- Communication 112
- Information Systems 258
- Computer Science Applications 47
- Information Systems and Management 57
- Statistics, Probability and Uncertainty 51
Countries citing papers authored by Ben Lund
This map shows the geographic impact of Ben Lund'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 Ben Lund with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ben Lund more than expected).
Fields of papers citing papers by Ben Lund
This network shows the impact of papers produced by Ben Lund. 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 Ben Lund. The network helps show where Ben Lund may publish in the future.
Co-authorship network
The 16 scholars most cited alongside Ben Lund, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 0 | |
| 2 | 2024 | 0 | |
| 3 | 2024 | 0 | |
| 4 | 2023 | 0 | |
| 5 | 2023 | 1 | |
| 6 | 2021 | 2 | |
| 7 | 2020 | 1 | |
| 8 | 2018 | 1 | |
| 9 | 2018 | 1 | |
| 10 | 2018 | 0 | |
| 11 | 2017 | 5 | |
| 12 | 2017 | 2 | |
| 13 | 2016 | 89 | |
| 14 | 2016 | 6 | |
| 15 | 2016 | 9 | |
| 16 | Some Results Related to a Conjecture of Dirac's | 2012 | 2 |
| 17 | 2005 | 85 | |
| 18 | 2005 | 294 | |
| 19 | 2004 | 19 |
About Ben Lund
Ben Lund is a scholar working on Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, Numerical Analysis, Computational Theory and Mathematics and Geometry and Topology, having authored 19 papers that have together received 517 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (10 papers), Computational Geometry and Mesh Generation (7 papers), Advanced Graph Theory Research (6 papers), Point processes and geometric inequalities (3 papers), Mathematical Approximation and Integration (3 papers), Graph theory and applications (3 papers), graph theory and CDMA systems (2 papers) and Graph Labeling and Dimension Problems (2 papers). The work is most often cited by research in Communication (112 citations), Information Systems (258 citations), Computer Science Applications (47 citations), Information Systems and Management (57 citations) and Statistics, Probability and Uncertainty (51 citations). Ben Lund has collaborated with scholars based in United States, South Korea and United Kingdom. Frequent co-authors include Timo Hannay, Tony Hammond, Richard Bengt Price, Shubhangi Saraf, Adam Sheffer, Oliver Roche‐Newton, Alex Iosevich, Misha Rudnev, Javier Cilleruelo and George Purdy. Their work appears in journals such as D-Lib Magazine, SIAM Journal on Discrete Mathematics, Discrete & Computational Geometry, COMBINATORICA and Mathematika.
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.