Joe Ryan
Impact in
-
- Finite Group Theory Research
-
- Graph Labeling and Dimension Problems
- Advanced Graph Theory Research
- semigroups and automata theory
- Complexity and Algorithms in Graphs
Papers in
-
- Graph Labeling and Dimension Problems 38
- Advanced Graph Theory Research 8
- Complexity and Algorithms in Graphs 5
-
- Finite Group Theory Research 4
- Co-authors
- Andrei V. Kelarev (5 shared papers)John L. Yearwood (1 shared paper)Mirka Miller (33 shared papers)Martin Bača (13 shared papers)Andrea Semaničová–Feňovčíková (10 shared papers)Dafik Dafik (5 shared papers)Kiki Ariyanti Sugeng (7 shared papers)Florent Foucaud (2 shared papers)
- Journals
- Discrete Mathematics (4 papers)Discrete Applied Mathematics (3 papers)Journal of Graph Theory (1 paper)Distributed and Parallel Databases (1 paper)Informatics (1 paper)
- Partner nations
- AustraliaCzechiaUnited Kingdom
In The Last Decade
Joe Ryan
55 papers receiving 491 citations
Peers
Comparison fields: 5 of 23
- Discrete Mathematics and Combinatorics 140
- Computational Theory and Mathematics 367
- Algebra and Number Theory 29
- Geometry and Topology 55
- Computer Networks and Communications 23
Countries citing papers authored by Joe Ryan
This map shows the geographic impact of Joe Ryan'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 Joe Ryan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joe Ryan more than expected).
Fields of papers citing papers by Joe Ryan
This network shows the impact of papers produced by Joe Ryan. 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 Joe Ryan. The network helps show where Joe Ryan may publish in the future.
Co-authors
The 25 scholars most cited alongside Joe Ryan, 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 63 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 160 | |
| 2 | 2021 | 30 | |
| 3 | 2017 | 19 | |
| 4 | 1997 | 18 | |
| 5 | 2018 | 18 | |
| 6 | On distance magic labeling of graphs | 2009 | 17 |
| 7 | On H-supermagic labelings for certain shackles and amalgamations of a connected graph | 2010 | 16 |
| 8 | 2008 | 15 | |
| 9 | Labelling wheels for minimum sum number | 1998 | 13 |
| 10 | 2007 | 12 | |
| 11 | 2012 | 12 | |
| 12 | 2015 | 12 | |
| 13 | 2020 | 12 | |
| 14 | Super edge-antimagic total labelings of mK n, n, n . | 2011 | 11 |
| 15 | 2014 | 11 | |
| 16 | 2014 | 10 | |
| 17 | Large graphs with small degree and diameter: a voltage assignment approach. | 1998 | 9 |
| 18 | 2014 | 9 | |
| 19 | 2015 | 9 | |
| 20 | Exclusive sum labeling of graphs | 2005 | 7 |
About Joe Ryan
Joe Ryan is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Computer Networks and Communications and Artificial Intelligence, having authored 63 papers that have together received 528 indexed citations. Recurring topics across this work include Graph Labeling and Dimension Problems (38 papers), Advanced Graph Theory Research (8 papers), Interconnection Networks and Systems (6 papers), Graph theory and applications (6 papers), Complexity and Algorithms in Graphs (5 papers), Privacy-Preserving Technologies in Data (4 papers), Finite Group Theory Research (4 papers) and Graph Theory and Algorithms (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (140 citations), Computational Theory and Mathematics (367 citations), Algebra and Number Theory (29 citations), Geometry and Topology (55 citations) and Computer Networks and Communications (23 citations). Joe Ryan has collaborated with scholars based in Australia, Czechia and United Kingdom. Frequent co-authors include Andrei V. Kelarev, John L. Yearwood, Mirka Miller, Martin Bača, Andrea Semaničová–Feňovčíková, Dafik Dafik, Kiki Ariyanti Sugeng, Florent Foucaud, Ralf Klasing and Slamin Slamin. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, Journal of Graph Theory, Distributed and Parallel Databases and Informatics.
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.