David E. Roberson
Impact in
-
- Finite Group Theory Research
- Mathematical Physics top 5%
- Advanced Operator Algebra Research
Papers in
-
- Advanced Graph Theory Research 20
- Complexity and Algorithms in Graphs 6
-
- Finite Group Theory Research 8
- Co-authors
- Laura Mančinska (10 shared papers)Simone Severini (8 shared papers)Martino Lupini (1 shared paper)Robert Šámal (6 shared papers)Chris D. Godsil (5 shared papers)Andreas J. Winter (4 shared papers)Antonios Varvitsiotis (7 shared papers)Leslie Hogben (3 shared papers)
- Journals
- Journal of Combinatorial Theory Series B (3 papers)Journal of the London Mathematical Society (2 papers)Mathematical Programming (2 papers)Discrete Applied Mathematics (2 papers)Algebraic Combinatorics (1 paper)
- Partner nations
- DenmarkUnited KingdomSingapore
In The Last Decade
David E. Roberson
29 papers receiving 283 citations
Peers
Comparison fields: 5 of 17
- Discrete Mathematics and Combinatorics 69
- Mathematical Physics 93
- Computational Theory and Mathematics 111
- Geometry and Topology 54
- Numerical Analysis 20
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 19 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
Showing the 20 most-cited of 35 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2020 | 38 | |
| 2 | 2016 | 34 | |
| 3 | 2020 | 33 | |
| 4 | 2012 | 32 | |
| 5 | Variations on a Theme: Graph Homomorphisms | 2013 | 28 |
| 6 | 2014 | 13 | |
| 7 | 2015 | 13 | |
| 8 | 2020 | 13 | |
| 9 | 2016 | 11 | |
| 10 | 2017 | 9 | |
| 11 | 2017 | 9 | |
| 12 | 2016 | 8 | |
| 13 | 2016 | 8 | |
| 14 | 2018 | 8 | |
| 15 | 2016 | 7 | |
| 16 | 2017 | 5 | |
| 17 | 2019 | 4 | |
| 18 | 2019 | 4 | |
| 19 | 2022 | 4 | |
| 20 | 2013 | 3 |
About David E. Roberson
David E. Roberson is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Artificial Intelligence, Geometry and Topology and Mathematical Physics, having authored 35 papers that have together received 298 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (20 papers), Quantum Computing Algorithms and Architecture (11 papers), Quantum Information and Cryptography (11 papers), Finite Group Theory Research (8 papers), Graph theory and applications (6 papers), Complexity and Algorithms in Graphs (6 papers), Advanced Operator Algebra Research (6 papers) and Quantum Mechanics and Applications (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (69 citations), Mathematical Physics (93 citations), Computational Theory and Mathematics (111 citations), Geometry and Topology (54 citations) and Numerical Analysis (20 citations). David E. Roberson has collaborated with scholars based in Denmark, United Kingdom and Singapore. Frequent co-authors include Laura Mančinska, Simone Severini, Martino Lupini, Robert Šámal, Chris D. Godsil, Andreas J. Winter, Antonios Varvitsiotis, Leslie Hogben, Toby S. Cubitt and Runyao Duan. Their work appears in journals such as Journal of Combinatorial Theory Series B, Journal of the London Mathematical Society, Mathematical Programming, Discrete Applied Mathematics and Algebraic Combinatorics.
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.