Y. Roditty
Impact in
-
- Limits and Structures in Graph Theory
-
- Graph Labeling and Dimension Problems
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 23
- Graph Labeling and Dimension Problems 20
-
- Limits and Structures in Graph Theory 19
- Co-authors
- Yair Caro (15 shared papers)Ilia Krasikov (12 shared papers)Raphael Yuster (3 shared papers)Arieh Lev (8 shared papers)Gil Kaplan (4 shared papers)Źsolt Tuza (1 shared paper)Noga Alon (1 shared paper)Arie Bialostocki (3 shared papers)
In The Last Decade
Y. Roditty
43 papers receiving 557 citations
Peers
Comparison fields: 5 of 40
- Discrete Mathematics and Combinatorics 218
- Computational Theory and Mathematics 493
- Geometry and Topology 95
- Computer Graphics and Computer-Aided Design 11
- Computer Networks and Communications 68
Countries citing papers authored by Y. Roditty
This map shows the geographic impact of Y. Roditty'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 Y. Roditty with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Y. Roditty more than expected).
Fields of papers citing papers by Y. Roditty
This network shows the impact of papers produced by Y. Roditty. 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 Y. Roditty. The network helps show where Y. Roditty may publish in the future.
Co-authors
The 14 scholars most cited alongside Y. Roditty, 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 46 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2008 | 108 | |
| 2 | 2004 | 80 | |
| 3 | 1989 | 52 | |
| 4 | 2008 | 48 | |
| 5 | 1997 | 38 | |
| 6 | All Cycles are Edge-Magic. | 2001 | 28 |
| 7 | 1989 | 27 | |
| 8 | 1987 | 17 | |
| 9 | 2001 | 17 | |
| 10 | 1982 | 17 | |
| 11 | 2014 | 13 | |
| 12 | 1991 | 10 | |
| 13 | 2013 | 10 | |
| 14 | 1992 | 9 | |
| 15 | 1986 | 8 | |
| 16 | 2001 | 8 | |
| 17 | 1994 | 8 | |
| 18 | 1987 | 8 | |
| 19 | 1994 | 7 | |
| 20 | 1983 | 7 |
About Y. Roditty
Y. Roditty is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Geometry and Topology and Artificial Intelligence, having authored 46 papers that have together received 590 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (23 papers), Graph Labeling and Dimension Problems (20 papers), Limits and Structures in Graph Theory (19 papers), graph theory and CDMA systems (13 papers), Graph theory and applications (7 papers), Interconnection Networks and Systems (5 papers), Coding theory and cryptography (5 papers) and Cooperative Communication and Network Coding (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (218 citations), Computational Theory and Mathematics (493 citations), Geometry and Topology (95 citations), Computer Graphics and Computer-Aided Design (11 citations) and Computer Networks and Communications (68 citations). Y. Roditty has collaborated with scholars based in Israel, Canada and Hungary. Frequent co-authors include Yair Caro, Ilia Krasikov, Raphael Yuster, Arieh Lev, Gil Kaplan, Źsolt Tuza, Noga Alon, Arie Bialostocki, Michal Parnas and Omer Berkman. Their work appears in journals such as Discrete Mathematics, Journal of Combinatorial Theory Series B, Journal of Combinatorial Theory Series A, Journal of Graph Theory and Discrete Applied 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.