Yehuda Roditty

Publication Activity (10 Years)

Years Active: 1983-2017
Publications (10 Years): 6

Top Topics

Digital Television

Disseminating Information

Top Venues

Discret. Appl. Math.

Publications

Gideon Dror, Arieh Lev, Yehuda Roditty, Romina Zigdon
On the rainbow connection number of graphs. Ars Comb. 133 (2017)
Amir Averbuch, Irete Peeri, Yehuda Roditty
-broadcast graphs. Networks 70 (2) (2017)
Revital Hollander Shabtai, Yehuda Roditty
-ary trees. Networks 67 (2) (2016)
Shoni Gilboa, Yehuda Roditty
Anti-Ramsey Numbers of Graphs with Small Connected Components. Graphs Comb. 32 (2) (2016)
Arie Bialostocki, Shoni Gilboa, Yehuda Roditty
Anti-Ramsey numbers of small graphs. Ars Comb. 123 (2015)
Revital Hollander Shabtai, Yehuda Roditty
Line-Broadcasting in Complete k-Trees. CoRR (2015)
Avi Averbuch, R. Hollander Shabtai, Yehuda Roditty
Efficient construction of broadcast graphs. Discret. Appl. Math. 171 (2014)
Avi Averbuch, R. Hollander Shabtai, Yehuda Roditty
Efficient construction of broadcast graphs. CoRR (2013)
Iris Gaber-Rosenblum, Yehuda Roditty
The depression of a graph and the diameter of its line graph. Discret. Math. 309 (6) (2009)
Gil Kaplan, Arieh Lev, Yehuda Roditty
On graph labeling problems and regular decompositions of complete graphs. Ars Comb. 92 (2009)
Gil Kaplan, Arieh Lev, Yehuda Roditty
On zero-sum partitions and anti-magic trees. Discret. Math. 309 (8) (2009)
Gil Kaplan, Arieh Lev, Yehuda Roditty
Bertrand's postulate, the prime number theorem and product anti-magic graphs. Discret. Math. 308 (5-6) (2008)
Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster
On Rainbow Connection. Electron. J. Comb. 15 (1) (2008)
Gideon Dror, Arieh Lev, Yehuda Roditty
A note: some results in step domination of trees. Discret. Math. 289 (1-3) (2004)
Yair Caro, Yehuda Roditty
Connected colorings of graphs. Ars Comb. 70 (2004)
Noga Alon, Gil Kaplan, Arieh Lev, Yehuda Roditty, Raphael Yuster
Dense graphs are antimagic. J. Graph Theory 47 (4) (2004)
Yair Caro, Arieh Lev, Yehuda Roditty
Some results in step domination of graphs. Ars Comb. 68 (2003)
Yair Caro, Yehuda Roditty, Johanan Schönheim
having lambda edges. Discret. Math. 247 (1-3) (2002)
Gil Kaplan, Arieh Lev, Yehuda Roditty
Transitive large sets of disjoint decompositions and group sequencings. Discret. Math. 254 (1-3) (2002)
Yehuda Roditty, Barack Shoham, Raphael Yuster
Monotone paths in edge-ordered sparse graphs. Discret. Math. 226 (1-3) (2001)
Amir Averbuch, Iris Gaber, Yehuda Roditty
Low-cost minimum-time line-broadcasting schemes in complete binary trees. Networks 38 (4) (2001)
Gil Kaplan, Arieh Lev, Yehuda Roditty
Regular Oberwolfach Problems and Group Sequencings. J. Comb. Theory, Ser. A 96 (1) (2001)
Amir Averbuch, Yehuda Roditty, Barack Shoham
Efficient line broadcasting in a d-dimensional grid. Discret. Appl. Math. 113 (2-3) (2001)
Omer Berkman, Michal Parnas, Yehuda Roditty
All Cycles are Edge-Magic. Ars Comb. 59 (2001)
Yair Caro, Yehuda Roditty
Improved bounds for the product of the domination and chromatic numbers of a graph. Ars Comb. 56 (2000)
Yair Caro, Yehuda Roditty, Johanan Schönheim
Covering designs with minimum overlap. Ars Comb. 55 (2000)
Amir Averbuch, Yehuda Roditty, Barack Shoham
Performance analysis of hybrid network multiprocessor architecture. Concurr. Pract. Exp. 12 (9) (2000)
Arieh Lev, Yehuda Roditty
Induced by Group Actions on Conjugacy Classes. Eur. J. Comb. 21 (3) (2000)
Amir Averbuch, Yehuda Roditty, Barack Shoham
Scheduling tasks of multi-join queries in a multiprocessor. Concurr. Pract. Exp. 11 (5) (1999)
Ilia Krasikov, Yehuda Roditty
On a Reconstruction Problem for Sequences, . J. Comb. Theory, Ser. A 77 (2) (1997)
Yehuda Roditty, Barack Shoham
On Broadcasting Multiple Messages in a D-dimensional Grid. Discret. Appl. Math. 75 (3) (1997)
Yair Caro, Yehuda Roditty, Johanan Schönheim
On colored designs - I. Discret. Math. 164 (1-3) (1997)
Yehuda Roditty
Packing and covering of the complete graph, V: the forests of order six and their multiple copies. Ars Comb. 44 (1996)
Yair Caro, Yehuda Roditty, Johanan Schönheim
On colored designs - II. Discret. Math. 138 (1-3) (1995)
Yair Caro, Yehuda Roditty
A zero-sum conjecture for trees. Ars Comb. 40 (1995)
Ilia Krasikov, Yehuda Roditty
More on Vertex-Switching Reconstruction. J. Comb. Theory, Ser. B 60 (1) (1994)
Yair Caro, Ilia Krasikov, Yehuda Roditty
On induced subgraphs of trees, with restricted degrees. Discret. Math. 125 (1-3) (1994)
Ilia Krasikov, Yehuda Roditty
Bounds for the harmonious chromatic number of a graph. J. Graph Theory 18 (2) (1994)
Ilia Krasikov, Yehuda Roditty
Switching reconstruction and diophantine equations. J. Comb. Theory, Ser. B 54 (2) (1992)
Yair Caro, Ilia Krasikov, Yehuda Roditty
On the largest tree of given maximum degree in a connected graph. J. Graph Theory 15 (1) (1991)
Ilia Krasikov, Yehuda Roditty
Some applications of the nash-williams lemma to the edge-reconstruction conjecture. Graphs Comb. 6 (1) (1990)
Yair Caro, Yehuda Roditty
A note on packing trees into complete bipartite graphs and on fishburn's conjecture. Discret. Math. 82 (3) (1990)
Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty
Combinatorial reconstruction problems. J. Comb. Theory, Ser. B 47 (2) (1989)
Chris D. Godsil, Ilia Krasikov, Yehuda Roditty
-edge deleted subgraphs. J. Comb. Theory, Ser. B 43 (3) (1987)
Yehuda Roditty
Packing and Covering of the Complete Graph with a Graph G of Four Vertices or Less. J. Comb. Theory, Ser. A 34 (2) (1983)