Y. Roditty

978 total citations
45 papers, 528 citations indexed

About

Y. Roditty is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Y. Roditty has authored 45 papers receiving a total of 528 indexed citations (citations by other indexed papers that have themselves been cited), including 35 papers in Computational Theory and Mathematics, 20 papers in Discrete Mathematics and Combinatorics and 13 papers in Electrical and Electronic Engineering. Recurrent topics in Y. Roditty's work include Advanced Graph Theory Research (22 papers), Graph Labeling and Dimension Problems (19 papers) and Limits and Structures in Graph Theory (18 papers). Y. Roditty is often cited by papers focused on Advanced Graph Theory Research (22 papers), Graph Labeling and Dimension Problems (19 papers) and Limits and Structures in Graph Theory (18 papers). Y. Roditty collaborates with scholars based in Israel, Canada and Hungary. Y. Roditty's co-authors include Yair Caro, Ilia Krasikov, Raphael Yuster, Arieh Lev, Gil Kaplan, Źsolt Tuza, Noga Alon, Arie Bialostocki, Omer Berkman and Michal Parnas and has published in prestigious journals such as Applied Mathematics Letters, Networks and Discrete Applied Mathematics.

In The Last Decade

Y. Roditty

42 papers receiving 496 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Y. Roditty Israel 10 446 203 115 84 59 45 528
Geňa Hahn Canada 12 324 0.7× 189 0.9× 104 0.9× 109 1.3× 59 1.0× 26 425
Levon H. Khachatrian Germany 10 303 0.7× 372 1.8× 185 1.6× 154 1.8× 56 0.9× 22 523
Gábor Simonyi Hungary 12 294 0.7× 213 1.0× 94 0.8× 111 1.3× 84 1.4× 40 423
Kristina Vušković United Kingdom 15 577 1.3× 246 1.2× 98 0.9× 91 1.1× 96 1.6× 48 632
Herbert Fleischner Austria 14 498 1.1× 183 0.9× 153 1.3× 183 2.2× 133 2.3× 64 616
Glenn Hurlbert United States 11 233 0.5× 161 0.8× 87 0.8× 98 1.2× 15 0.3× 45 322
Dwight Duffus United States 14 430 1.0× 172 0.8× 69 0.6× 160 1.9× 54 0.9× 51 566
Geoffrey Exoo United States 12 424 1.0× 267 1.3× 191 1.7× 238 2.8× 171 2.9× 61 609
Jean‐Sébastien Sereni France 14 351 0.8× 155 0.8× 142 1.2× 73 0.9× 97 1.6× 57 478
Joe Ryan Australia 11 338 0.8× 111 0.5× 145 1.3× 103 1.2× 67 1.1× 55 440

Countries citing papers authored by Y. Roditty

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Y. Roditty

This figure shows the co-authorship network connecting the top 25 collaborators of Y. Roditty. A scholar is included among the top collaborators of Y. Roditty based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Y. Roditty. Y. Roditty is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Dror, Gideon, et al.. (2017). On the rainbow connection number of graphs.. Ars Combinatoria. 133. 51–67. 1 indexed citations
2.
Averbuch, Amir, et al.. (2014). Efficient construction of broadcast graphs. Discrete Applied Mathematics. 171. 9–14. 9 indexed citations
3.
Kaplan, Gil, Arieh Lev, & Y. Roditty. (2008). On zero-sum partitions and anti-magic trees. Discrete Mathematics. 309(8). 2010–2014. 44 indexed citations
4.
Roditty, Y., et al.. (2008). The depression of a graph and the diameter of its line graph. Discrete Mathematics. 309(6). 1774–1778. 4 indexed citations
5.
Caro, Yair & Y. Roditty. (2004). Connected colorings of graphs.. Ars Combinatoria. 70.
6.
Caro, Yair, Arieh Lev, & Y. Roditty. (2003). Some results in step domination of graphs.. Ars Combinatoria. 68. 3 indexed citations
7.
Caro, Yair, et al.. (2002). On colored designs-III: on λ-colored H-designs, H having λ edges. Discrete Mathematics. 247(1-3). 51–64.
8.
Kaplan, Gil, Arieh Lev, & Y. Roditty. (2001). Regular Oberwolfach Problems and Group Sequencings. Journal of Combinatorial Theory Series A. 96(1). 1–19. 7 indexed citations
9.
Roditty, Y., et al.. (2001). Monotone paths in edge-ordered sparse graphs. Discrete Mathematics. 226(1-3). 411–417. 14 indexed citations
10.
Caro, Yair & Y. Roditty. (2000). Improved bounds for the product of the domination and chromatic numbers of a graph.. Ars Combinatoria. 56(3). 9–9. 2 indexed citations
11.
Krasikov, Ilia & Y. Roditty. (1997). On a Reconstruction Problem for Sequences. Journal of Combinatorial Theory Series A. 77(2). 344–348. 32 indexed citations
12.
Caro, Yair, et al.. (1997). On colored designs — I. Discrete Mathematics. 164(1-3). 47–65. 1 indexed citations
13.
Roditty, Y., et al.. (1997). On broadcasting multiple messages in a d-dimensional grid. Discrete Applied Mathematics. 75(3). 277–284. 4 indexed citations
14.
Caro, Yair & Y. Roditty. (1995). A zero-sum conjecture for trees.. Ars Combinatoria. 40. 2 indexed citations
15.
Caro, Yair, et al.. (1995). On colored designs — II. Discrete Mathematics. 138(1-3). 177–186. 3 indexed citations
16.
Krasikov, Ilia & Y. Roditty. (1994). More on Vertex-Switching Reconstruction. Journal of Combinatorial Theory Series B. 60(1). 40–55. 5 indexed citations
17.
Caro, Yair, Ilia Krasikov, & Y. Roditty. (1994). On induced subgraphs of trees, with restricted degrees. Discrete Mathematics. 125(1-3). 101–106. 8 indexed citations
18.
Krasikov, Ilia & Y. Roditty. (1992). Switching reconstruction and diophantine equations. Journal of Combinatorial Theory Series B. 54(2). 189–195. 7 indexed citations
19.
Caro, Yair, et al.. (1989). Combinatorial reconstruction problems. Journal of Combinatorial Theory Series B. 47(2). 153–161. 24 indexed citations
20.
Godsil, Chris, Ilia Krasikov, & Y. Roditty. (1986). Reconstructing graphs from their k -edge deleted subgraphs. Journal of Combinatorial Theory Series A. 43(3). 360–363. 2 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Geňa Hahn Breakdown of academic impact, for papers by Levon H. Khachatrian Breakdown of academic impact, for papers by Gábor Simonyi Breakdown of academic impact, for papers by Kristina Vušković Breakdown of academic impact, for papers by Herbert Fleischner Breakdown of academic impact, for papers by Glenn Hurlbert Breakdown of academic impact, for papers by Dwight Duffus Breakdown of academic impact, for papers by Geoffrey Exoo Breakdown of academic impact, for papers by Jean‐Sébastien Sereni Breakdown of academic impact, for papers by Joe Ryan
Rankless by CCL
2026