Ryan Hayward
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Artificial Intelligence in Games 26
- Algorithms and Data Compression 8
-
- Advanced Graph Theory Research 18
- Graph Labeling and Dimension Problems 12
- Complexity and Algorithms in Graphs 12
- Co-authors
- Broderick Arneson (9 shared papers)Philip Henderson (11 shared papers)Chı́nh T. Hoàng (2 shared papers)Frédéric Maffray (2 shared papers)Colin McDiarmid (3 shared papers)R. Sritharan (3 shared papers)Jeremy Spinrad (3 shared papers)Martin Müller (6 shared papers)
- Journals
- Journal of Combinatorial Theory Series B (4 papers)Discrete Applied Mathematics (4 papers)Graphs and Combinatorics (4 papers)Discrete Mathematics (3 papers)Discrete & Computational Geometry (3 papers)
- Partner nations
- CanadaUnited StatesPoland
In The Last Decade
Ryan Hayward
66 papers receiving 902 citations
Peers
Comparison fields: 5 of 55
- Discrete Mathematics and Combinatorics 105
- Computational Theory and Mathematics 477
- Computer Graphics and Computer-Aided Design 66
- Artificial Intelligence 421
- Geometry and Topology 77
Countries citing papers authored by Ryan Hayward
This map shows the geographic impact of Ryan Hayward'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 Ryan Hayward with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ryan Hayward more than expected).
Fields of papers citing papers by Ryan Hayward
This network shows the impact of papers produced by Ryan Hayward. 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 Ryan Hayward. The network helps show where Ryan Hayward may publish in the future.
Co-authors
The 25 scholars most cited alongside Ryan Hayward, 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 71 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1985 | 158 | |
| 2 | 2010 | 101 | |
| 3 | 1990 | 72 | |
| 4 | 1989 | 65 | |
| 5 | 2005 | 43 | |
| 6 | 2000 | 33 | |
| 7 | 2015 | 24 | |
| 8 | 2014 | 23 | |
| 9 | 1996 | 23 | |
| 10 | 2007 | 21 | |
| 11 | 2012 | 20 | |
| 12 | 1989 | 15 | |
| 13 | 1996 | 14 | |
| 14 | 1997 | 14 | |
| 15 | 1987 | 14 | |
| 16 | 2004 | 13 | |
| 17 | 2006 | 13 | |
| 18 | 1991 | 13 | |
| 19 | 2011 | 12 | |
| 20 | 2018 | 12 |
About Ryan Hayward
Ryan Hayward is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Sociology and Political Science, Discrete Mathematics and Combinatorics and Economics and Econometrics, having authored 71 papers that have together received 969 indexed citations. Recurring topics across this work include Artificial Intelligence in Games (26 papers), Digital Games and Media (18 papers), Advanced Graph Theory Research (18 papers), Graph Labeling and Dimension Problems (12 papers), Complexity and Algorithms in Graphs (12 papers), Algorithms and Data Compression (8 papers), Sports Analytics and Performance (8 papers) and Limits and Structures in Graph Theory (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (105 citations), Computational Theory and Mathematics (477 citations), Computer Graphics and Computer-Aided Design (66 citations), Artificial Intelligence (421 citations) and Geometry and Topology (77 citations). Ryan Hayward has collaborated with scholars based in Canada, United States and Poland. Frequent co-authors include Broderick Arneson, Philip Henderson, Chı́nh T. Hoàng, Frédéric Maffray, Colin McDiarmid, R. Sritharan, Jeremy Spinrad, Martin Müller, Chia-Chu Chiang and Russell Greiner. Their work appears in journals such as Journal of Combinatorial Theory Series B, Discrete Applied Mathematics, Graphs and Combinatorics, Discrete Mathematics and Discrete & Computational Geometry.
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.