Sándor Szabó
-
- Finite Group Theory Research 15
- Limits and Structures in Graph Theory 8
-
- Advanced Graph Theory Research 12
- Cellular Automata and Applications 11
- Complexity and Algorithms in Graphs 8
- Geometry and Topology top 10%
- Mathematics and Applications 8
-
- graph theory and CDMA systems 32
-
- Coding theory and cryptography 7
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsAlgebra and Number Theory
- Journals
- SHILAP Revista de lepidopterología (3 papers)Mathematics of Computation (2 papers)Theoretical Computer Science (1 paper)
- Partner nations
- HungaryUnited StatesBahrain
In The Last Decade
Sándor Szabó
54 papers receiving 342 citations
Peers
Comparison fields: 5 of 47
- Discrete Mathematics and Combinatorics 108
- Computational Theory and Mathematics 169
- Algebra and Number Theory 31
- Geometry and Topology 57
- Computer Graphics and Computer-Aided Design 22
Countries citing papers authored by Sándor Szabó
This map shows the geographic impact of Sándor Szabó'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 Sándor Szabó with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sándor Szabó more than expected).
Fields of papers citing papers by Sándor Szabó
This network shows the impact of papers produced by Sándor Szabó. 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 Sándor Szabó. The network helps show where Sándor Szabó may publish in the future.
Co-authorship network
The 5 scholars most cited alongside Sándor Szabó, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 1 | |
| 2 | 2021 | 1 | |
| 3 | 2019 | 2 | |
| 4 | 2012 | 1 | |
| 5 | INTEGER t-SHIFT CODES AND FACTORING ABELIAN GROUPS | 2011 | 1 |
| 6 | A Hajós type result on factoring finite abelian groups by subsets. II | 2010 | 0 |
| 7 | 2010 | 1 | |
| 8 | Abelian groups that cannot be factored without periodic factor | 2006 | 0 |
| 9 | 2006 | 3 | |
| 10 | 2006 | 3 | |
| 11 | Factoring groups having periodic maximal subgroups | 1999 | 6 |
| 12 | Groups with the Rédei property | 1998 | 5 |
| 13 | 1998 | 0 | |
| 14 | 1998 | 8 | |
| 15 | 1995 | 1 | |
| 16 | 1992 | 1 | |
| 17 | 1990 | 1 | |
| 18 | 1990 | 6 | |
| 19 | 1985 | 18 | |
| 20 | 1983 | 2 |
About Sándor Szabó
Sándor Szabó is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 71 papers that have together received 398 indexed citations. Recurring topics across this work include graph theory and CDMA systems (32 papers), Finite Group Theory Research (15 papers), Advanced Graph Theory Research (12 papers), Cellular Automata and Applications (11 papers), Mathematics and Applications (8 papers), Complexity and Algorithms in Graphs (8 papers), Limits and Structures in Graph Theory (8 papers) and Coding theory and cryptography (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (108 citations), Computational Theory and Mathematics (169 citations) and Algebra and Number Theory (31 citations). Sándor Szabó has collaborated with scholars based in Hungary, United States and Bahrain. Frequent co-authors include Sherman K. Stein, Keresztély Corrádi, A. D. Sands, Patric R. J. Östergård and N.J. Szabo. Their work appears in journals such as SHILAP Revista de lepidopterología, Mathematics of Computation and Theoretical Computer Science.
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.