David E. Roberson
Impact in
- Geometry and Topology top 10%
- Graph theory and applications
- Algebraic structures and combinatorial models
Papers in ⓘ
-
- Advanced Graph Theory Research 6
- Computability, Logic, AI Algorithms 4
-
- Graph theory and applications 5
- Algebraic structures and combinatorial models 4
- Co-authors
- Laura Mančinska (7 shared papers)Martino Lupini (2 shared papers)Simone Severini (4 shared papers)Antonios Varvitsiotis (4 shared papers)Robert Šámal (2 shared papers)Andreas Winter (3 shared papers)Leslie Hogben (2 shared papers)Chris Godsil (2 shared papers)
In The Last Decade
David E. Roberson
15 papers receiving 95 citations
Peers
Comparison fields: 5 of 24
- Geometry and Topology 45
- Discrete Mathematics and Combinatorics 14
- Algebra and Number Theory 18
- Mathematical Physics 25
- Computational Theory and Mathematics 38
Countries citing papers authored by David E. Roberson
This map shows the geographic impact of David E. Roberson'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 David E. Roberson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David E. Roberson more than expected).
Fields of papers citing papers by David E. Roberson
This network shows the impact of papers produced by David E. Roberson. 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 David E. Roberson. The network helps show where David E. Roberson may publish in the future.
Co-authors
The 22 scholars most cited alongside David E. Roberson, 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 | 2016 | 30 | |
| 2 | 2020 | 21 | |
| 3 | Perfect Strategies for Non-Local Games | 2020 | 10 |
| 4 | 2016 | 8 | |
| 5 | 2015 | 8 | |
| 6 | 2016 | 6 | |
| 7 | 2022 | 4 | |
| 8 | 2017 | 4 | |
| 9 | 2016 | 3 | |
| 10 | 2015 | 3 | |
| 11 | 2022 | 2 | |
| 12 | 2013 | 2 | |
| 13 | 2023 | 1 | |
| 14 | 2016 | 1 | |
| 15 | 2015 | 1 | |
| 16 | 2025 | 0 | |
| 17 | 2025 | 0 | |
| 18 | 2014 | 0 | |
| 19 | 2021 | 0 |
About David E. Roberson
David E. Roberson is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Artificial Intelligence, Discrete Mathematics and Combinatorics and Numerical Analysis, having authored 19 papers that have together received 104 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (6 papers), Graph theory and applications (5 papers), Computability, Logic, AI Algorithms (4 papers), Algebraic structures and combinatorial models (4 papers), Quantum Computing Algorithms and Architecture (3 papers), Advanced Optimization Algorithms Research (3 papers), Limits and Structures in Graph Theory (3 papers) and Game Theory and Applications (2 papers). The work is most often cited by research in Geometry and Topology (45 citations), Discrete Mathematics and Combinatorics (14 citations), Algebra and Number Theory (18 citations), Mathematical Physics (25 citations) and Computational Theory and Mathematics (38 citations). David E. Roberson has collaborated with scholars based in Denmark, Singapore and Canada. Frequent co-authors include Laura Mančinska, Martino Lupini, Simone Severini, Antonios Varvitsiotis, Robert Šámal, Andreas Winter, Leslie Hogben, Chris Godsil, Ruth Haas and Michael E. Young. Their work appears in journals such as Discrete Applied Mathematics, Journal of Combinatorial Theory Series B, Journal of the London Mathematical Society, Journal of Noncommutative Geometry and Electronic Journal of Linear Algebra.
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.