Alex Scott
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 68
- Graph Labeling and Dimension Problems 28
-
- Limits and Structures in Graph Theory 72
- Co-authors
- Paul Seymour (35 shared papers)M. G. Reed (4 shared papers)I. P. McTaggart (2 shared papers)J. J. Hanway (7 shared papers)B Bollobás (4 shared papers)B. Bollobás (2 shared papers)B.C. Ball (3 shared papers)David A. Laird (4 shared papers)
- Journals
- Soil Science Society of America Journal (27 papers)Journal of Combinatorial Theory Series B (19 papers)Journal of Graph Theory (14 papers)European Journal of Combinatorics (7 papers)Discrete Mathematics (6 papers)
- Partner nations
- United StatesUnited KingdomCanada
In The Last Decade
Alex Scott
161 papers receiving 1.9k citations
Peers
Comparison fields: 5 of 114
- Discrete Mathematics and Combinatorics 551
- Computational Theory and Mathematics 746
- Soil Science 339
- Biomaterials 413
- Geometry and Topology 234
Countries citing papers authored by Alex Scott
This map shows the geographic impact of Alex Scott'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 Alex Scott with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alex Scott more than expected).
Fields of papers citing papers by Alex Scott
This network shows the impact of papers produced by Alex Scott. 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 Alex Scott. The network helps show where Alex Scott may publish in the future.
Co-authors
The 25 scholars most cited alongside Alex Scott, 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 182 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1966 | 91 | |
| 2 | 1995 | 85 | |
| 3 | 2004 | 82 | |
| 4 | 2002 | 77 | |
| 5 | 2020 | 71 | |
| 6 | Approximation Hardness of Short Symmetric Instances of MAX-3SAT. | 2003 | 66 |
| 7 | 1996 | 65 | |
| 8 | 1989 | 51 | |
| 9 | 1960 | 51 | |
| 10 | 1962 | 51 | |
| 11 | 1962 | 50 | |
| 12 | 1997 | 41 | |
| 13 | 2000 | 40 | |
| 14 | 2015 | 38 | |
| 15 | 2002 | 35 | |
| 16 | 1988 | 34 | |
| 17 | 1987 | 32 | |
| 18 | 1997 | 32 | |
| 19 | 1956 | 29 | |
| 20 | 2011 | 29 |
About Alex Scott
Alex Scott is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Biomaterials and Civil and Structural Engineering, having authored 182 papers that have together received 2.1k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (72 papers), Advanced Graph Theory Research (68 papers), Graph Labeling and Dimension Problems (28 papers), Clay minerals and soil interactions (25 papers), Graph theory and applications (21 papers), Soil and Unsaturated Flow (18 papers), graph theory and CDMA systems (17 papers) and Advanced Topology and Set Theory (12 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (551 citations), Computational Theory and Mathematics (746 citations), Soil Science (339 citations), Biomaterials (413 citations) and Geometry and Topology (234 citations). Alex Scott has collaborated with scholars based in United States, United Kingdom and Canada. Frequent co-authors include Paul Seymour, M. G. Reed, I. P. McTaggart, J. J. Hanway, B Bollobás, B. Bollobás, B.C. Ball, David A. Laird, Béla Bollobás and T. E. Fenton. Their work appears in journals such as Soil Science Society of America Journal, Journal of Combinatorial Theory Series B, Journal of Graph Theory, European Journal of Combinatorics and Discrete 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.