Alexander Rosa
Impact in
-
- Finite Group Theory Research
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.5%
- Graph Labeling and Dimension Problems
- Advanced Graph Theory Research
Papers in
-
- graph theory and CDMA systems 73
-
- Advanced Graph Theory Research 20
- Graph Labeling and Dimension Problems 16
- Co-authors
- Anton Kotzig (5 shared papers)Charles J. Colbourn (17 shared papers)Eric Mendelsohn (6 shared papers)Charles C. Lindner (12 shared papers)Pavol Hell (3 shared papers)Kevin T. Phelps (6 shared papers)Rudolf Mathon (8 shared papers)Jozef Širáň (4 shared papers)
- Journals
- Discrete Mathematics (19 papers)Journal of Combinatorial Designs (6 papers)Journal of Combinatorial Theory Series A (6 papers)Mathematics of Computation (4 papers)Journal of Graph Theory (3 papers)
- Partner nations
- CanadaUnited StatesPoland
In The Last Decade
Alexander Rosa
84 papers receiving 1.3k citations
Peers
Comparison fields: 5 of 68
- Discrete Mathematics and Combinatorics 611
- Computational Theory and Mathematics 627
- Electrical and Electronic Engineering 1.1k
- Geometry and Topology 154
- Artificial Intelligence 521
Countries citing papers authored by Alexander Rosa
This map shows the geographic impact of Alexander Rosa'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 Alexander Rosa with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alexander Rosa more than expected).
Fields of papers citing papers by Alexander Rosa
This network shows the impact of papers produced by Alexander Rosa. 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 Alexander Rosa. The network helps show where Alexander Rosa may publish in the future.
Co-authors
The 25 scholars most cited alongside Alexander Rosa, 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 90 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1970 | 221 | |
| 2 | 1999 | 123 | |
| 3 | 1985 | 122 | |
| 4 | 1978 | 76 | |
| 5 | 1972 | 55 | |
| 6 | 1981 | 44 | |
| 7 | 1985 | 38 | |
| 8 | 1979 | 35 | |
| 9 | 1975 | 33 | |
| 10 | 1966 | 32 | |
| 11 | 1999 | 31 | |
| 12 | 1975 | 30 | |
| 13 | 1982 | 29 | |
| 14 | 1986 | 29 | |
| 15 | 2006 | 29 | |
| 16 | 2000 | 28 | |
| 17 | 1994 | 27 | |
| 18 | 1972 | 23 | |
| 19 | 1995 | 23 | |
| 20 | 1989 | 21 |
About Alexander Rosa
Alexander Rosa is a scholar working on Electrical and Electronic Engineering, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Artificial Intelligence and Geometry and Topology, having authored 90 papers that have together received 1.4k indexed citations. Recurring topics across this work include graph theory and CDMA systems (73 papers), Coding theory and cryptography (25 papers), Finite Group Theory Research (23 papers), Advanced Graph Theory Research (20 papers), Graph Labeling and Dimension Problems (16 papers), Limits and Structures in Graph Theory (11 papers), Mathematics and Applications (6 papers) and Graph theory and applications (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (611 citations), Computational Theory and Mathematics (627 citations), Electrical and Electronic Engineering (1.1k citations), Geometry and Topology (154 citations) and Artificial Intelligence (521 citations). Alexander Rosa has collaborated with scholars based in Canada, United States and Poland. Frequent co-authors include Anton Kotzig, Charles J. Colbourn, Eric Mendelsohn, Charles C. Lindner, Pavol Hell, Kevin T. Phelps, Rudolf Mathon, Jozef Širáň, Alan Hartman and W. D. Wallis. Their work appears in journals such as Discrete Mathematics, Journal of Combinatorial Designs, Journal of Combinatorial Theory Series A, Mathematics of Computation and Journal of Graph Theory.
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.