Ben Lund
Impact in
- Communication top 5%
- Wikis in Education and Collaboration
- Information Systems top 5%
- Recommender Systems and Techniques
- Web Data Mining and Analysis
- Web and Library Services
Papers in
-
- Limits and Structures in Graph Theory 10
-
- Advanced Graph Theory Research 6
- Graph Labeling and Dimension Problems 2
- Complexity and Algorithms in Graphs 2
- Co-authors
- Tony Hammond (3 shared papers)Timo Hannay (3 shared papers)Richard Bengt Price (1 shared paper)Shubhangi Saraf (2 shared papers)Adam Sheffer (1 shared paper)Oliver Roche‐Newton (2 shared papers)George Purdy (1 shared paper)Alex Iosevich (1 shared paper)
- Journals
- D-Lib Magazine (3 papers)SIAM Journal on Discrete Mathematics (3 papers)Discrete & Computational Geometry (2 papers)COMBINATORICA (2 papers)Advances in Mathematics (1 paper)
- Partner nations
- United StatesSouth KoreaHungary
In The Last Decade
Ben Lund
14 papers receiving 440 citations
Peers
Comparison fields: 5 of 69
- Communication 110
- Information Systems 256
- Computer Science Applications 47
- Information Systems and Management 54
- Statistics, Probability and Uncertainty 48
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 | 293 | |
| 2 | 2016 | 89 | |
| 3 | 2005 | 85 | |
| 4 | 2004 | 19 | |
| 5 | 2016 | 9 | |
| 6 | 2016 | 6 | |
| 7 | 2017 | 5 | |
| 8 | Some Results Related to a Conjecture of Dirac's | 2012 | 2 |
| 9 | 2021 | 2 | |
| 10 | 2017 | 2 | |
| 11 | 2023 | 1 | |
| 12 | 2018 | 1 | |
| 13 | 2018 | 1 | |
| 14 | 2020 | 1 | |
| 15 | 2024 | 0 | |
| 16 | 2023 | 0 | |
| 17 | 2024 | 0 | |
| 18 | 2024 | 0 | |
| 19 | 2018 | 0 |
About Ben Lund
Ben Lund is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Geometry and Topology and Applied Mathematics, having authored 19 papers that have together received 516 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 Labeling and Dimension Problems (2 papers) and Complexity and Algorithms in Graphs (2 papers). The work is most often cited by research in Communication (110 citations), Information Systems (256 citations), Computer Science Applications (47 citations), Information Systems and Management (54 citations) and Statistics, Probability and Uncertainty (48 citations). Ben Lund has collaborated with scholars based in United States, South Korea and Hungary. Frequent co-authors include Tony Hammond, Timo Hannay, Richard Bengt Price, Shubhangi Saraf, Adam Sheffer, Oliver Roche‐Newton, George Purdy, Alex Iosevich, Misha Rudnev and Javier Cilleruelo. Their work appears in journals such as D-Lib Magazine, SIAM Journal on Discrete Mathematics, Discrete & Computational Geometry, COMBINATORICA and Advances in Mathematics.
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.