Ben Lund
Impact in
- Communication top 5%
- Wikis in Education and Collaboration
- Information Systems top 2%
- Recommender Systems and Techniques
- Web Data Mining and Analysis
- Information Retrieval and Search Behavior
Papers in
-
- Limits and Structures in Graph Theory 10
-
- Computational Geometry and Mesh Generation 8
- Co-authors
- Timo Hannay (3 shared papers)Tony Hammond (3 shared papers)Richard Bengt Price (1 shared paper)Shubhangi Saraf (2 shared papers)Adam Sheffer (1 shared paper)Alex Iosevich (2 shared papers)Javier Cilleruelo (2 shared papers)Oliver Roche‐Newton (3 shared papers)
- Journals
- D-Lib Magazine (3 papers)SIAM Journal on Discrete Mathematics (3 papers)Discrete & Computational Geometry (2 papers)COMBINATORICA (2 papers)Journal of Graph Theory (1 paper)
- Partner nations
- United StatesSouth KoreaUnited Kingdom
In The Last Decade
Ben Lund
15 papers receiving 524 citations
Peers
Comparison fields: 5 of 70
- Communication 116
- Information Systems 304
- Computer Science Applications 53
- Information Systems and Management 61
- Statistics, Probability and Uncertainty 54
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-authors
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 | 2005 | 339 | |
| 2 | 2016 | 100 | |
| 3 | 2005 | 97 | |
| 4 | 2004 | 22 | |
| 5 | 2016 | 9 | |
| 6 | 2016 | 8 | |
| 7 | 2017 | 6 | |
| 8 | 2016 | 3 | |
| 9 | 2017 | 2 | |
| 10 | 2021 | 2 | |
| 11 | 2018 | 1 | |
| 12 | 2020 | 1 | |
| 13 | 2014 | 1 | |
| 14 | 2023 | 1 | |
| 15 | 2018 | 1 | |
| 16 | 2024 | 0 | |
| 17 | 2023 | 0 | |
| 18 | 2018 | 0 | |
| 19 | 2024 | 0 | |
| 20 | 2024 | 0 |
About Ben Lund
Ben Lund is a scholar working on Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Geometry and Topology and Numerical Analysis, having authored 20 papers that have together received 593 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (10 papers), Computational Geometry and Mesh Generation (8 papers), Advanced Graph Theory Research (7 papers), Graph theory and applications (3 papers), Mathematical Approximation and Integration (3 papers), graph theory and CDMA systems (2 papers), Polynomial and algebraic computation (2 papers) and Complexity and Algorithms in Graphs (2 papers). The work is most often cited by research in Communication (116 citations), Information Systems (304 citations), Computer Science Applications (53 citations), Information Systems and Management (61 citations) and Statistics, Probability and Uncertainty (54 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, Alex Iosevich, Javier Cilleruelo, Oliver Roche‐Newton, Misha Rudnev and Thang Luong Pham. Their work appears in journals such as D-Lib Magazine, SIAM Journal on Discrete Mathematics, Discrete & Computational Geometry, COMBINATORICA and Journal of Graph Theory.
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.