Yehuda Roditty

45 papers Journal 45
YearRankTypeTitle / Venue / Authors
2017 J jnl
New upper bound on
Networks
Amir Averbuch, Irete Peeri, Yehuda Roditty
2017 J jnl
On the rainbow connection number of graphs.
Ars Comb.
Gideon Dror, Arieh Lev, Yehuda Roditty, Romina Zigdon
2016 J jnl
Anti-Ramsey Numbers of Graphs with Small Connected Components.
Graphs Comb.
Shoni Gilboa, Yehuda Roditty
2016 J jnl
Line-broadcasting in complete
Networks
Revital Hollander Shabtai, Yehuda Roditty
2015 J jnl
Anti-Ramsey numbers of small graphs.
Ars Comb.
Arie Bialostocki, Shoni Gilboa, Yehuda Roditty
2015 J jnl
Line-Broadcasting in Complete k-Trees.
CoRR
Revital Hollander Shabtai, Yehuda Roditty
2014 J jnl
Efficient construction of broadcast graphs.
Discret. Appl. Math.
Avi Averbuch, R. Hollander Shabtai, Yehuda Roditty
2013 J jnl
Efficient construction of broadcast graphs.
CoRR
Avi Averbuch, R. Hollander Shabtai, Yehuda Roditty
2009 J jnl
On graph labeling problems and regular decompositions of complete graphs.
Ars Comb.
Gil Kaplan, Arieh Lev, Yehuda Roditty
2009 J jnl
On zero-sum partitions and anti-magic trees.
Discret. Math.
Gil Kaplan, Arieh Lev, Yehuda Roditty
2009 J jnl
The depression of a graph and the diameter of its line graph.
Discret. Math.
Iris Gaber-Rosenblum, Yehuda Roditty
2008 J jnl
Bertrand's postulate, the prime number theorem and product anti-magic graphs.
Discret. Math.
Gil Kaplan, Arieh Lev, Yehuda Roditty
2008 J jnl
On Rainbow Connection.
Electron. J. Comb.
Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster
2004 J jnl
A note: some results in step domination of trees.
Discret. Math.
Gideon Dror, Arieh Lev, Yehuda Roditty
2004 J jnl
Connected colorings of graphs.
Ars Comb.
Yair Caro, Yehuda Roditty
2004 J jnl
Dense graphs are antimagic.
J. Graph Theory
Noga Alon, Gil Kaplan, Arieh Lev, Yehuda Roditty, Raphael Yuster
2003 J jnl
Some results in step domination of graphs.
Ars Comb.
Yair Caro, Arieh Lev, Yehuda Roditty
2002 J jnl
On colored designs-III: on lambda-colored
Discret. Math.
Yair Caro, Yehuda Roditty, Johanan Schönheim
2002 J jnl
Transitive large sets of disjoint decompositions and group sequencings.
Discret. Math.
Gil Kaplan, Arieh Lev, Yehuda Roditty
2001 J jnl
All Cycles are Edge-Magic.
Ars Comb.
Omer Berkman, Michal Parnas, Yehuda Roditty
2001 J jnl
Efficient line broadcasting in a d-dimensional grid.
Discret. Appl. Math.
Amir Averbuch, Yehuda Roditty, Barack Shoham
2001 J jnl
Low-cost minimum-time line-broadcasting schemes in complete binary trees.
Networks
Amir Averbuch, Iris Gaber, Yehuda Roditty
2001 J jnl
Monotone paths in edge-ordered sparse graphs.
Discret. Math.
Yehuda Roditty, Barack Shoham, Raphael Yuster
2001 J jnl
Regular Oberwolfach Problems and Group Sequencings.
J. Comb. Theory A
Gil Kaplan, Arieh Lev, Yehuda Roditty
2000 J jnl
Covering designs with minimum overlap.
Ars Comb.
Yair Caro, Yehuda Roditty, Johanan Schönheim
2000 J jnl
Improved bounds for the product of the domination and chromatic numbers of a graph.
Ars Comb.
Yair Caro, Yehuda Roditty
2000 J jnl
On Hering Decomposition of
Eur. J. Comb.
Arieh Lev, Yehuda Roditty
2000 J jnl
Performance analysis of hybrid network multiprocessor architecture.
Concurr. Pract. Exp.
Amir Averbuch, Yehuda Roditty, Barack Shoham
1999 J jnl
Scheduling tasks of multi-join queries in a multiprocessor.
Concurr. Pract. Exp.
Amir Averbuch, Yehuda Roditty, Barack Shoham
1997 J jnl
On Broadcasting Multiple Messages in a D-dimensional Grid.
Discret. Appl. Math.
Yehuda Roditty, Barack Shoham
1997 J jnl
On a Reconstruction Problem for Sequences, .
J. Comb. Theory A
Ilia Krasikov, Yehuda Roditty
1997 J jnl
On colored designs - I.
Discret. Math.
Yair Caro, Yehuda Roditty, Johanan Schönheim
1996 J jnl
Packing and covering of the complete graph, V: the forests of order six and their multiple copies.
Ars Comb.
Yehuda Roditty
1995 J jnl
A zero-sum conjecture for trees.
Ars Comb.
Yair Caro, Yehuda Roditty
1995 J jnl
On colored designs - II.
Discret. Math.
Yair Caro, Yehuda Roditty, Johanan Schönheim
1994 J jnl
Bounds for the harmonious chromatic number of a graph.
J. Graph Theory
Ilia Krasikov, Yehuda Roditty
1994 J jnl
More on Vertex-Switching Reconstruction.
J. Comb. Theory B
Ilia Krasikov, Yehuda Roditty
1994 J jnl
On induced subgraphs of trees, with restricted degrees.
Discret. Math.
Yair Caro, Ilia Krasikov, Yehuda Roditty
1992 J jnl
Switching reconstruction and diophantine equations.
J. Comb. Theory B
Ilia Krasikov, Yehuda Roditty
1991 J jnl
On the largest tree of given maximum degree in a connected graph.
J. Graph Theory
Yair Caro, Ilia Krasikov, Yehuda Roditty
1990 J jnl
A note on packing trees into complete bipartite graphs and on fishburn's conjecture.
Discret. Math.
Yair Caro, Yehuda Roditty
1990 J jnl
Some applications of the nash-williams lemma to the edge-reconstruction conjecture.
Graphs Comb.
Ilia Krasikov, Yehuda Roditty
1989 J jnl
Combinatorial reconstruction problems.
J. Comb. Theory B
Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty
1987 J jnl
Reconstructing graphs from their
J. Comb. Theory B
Chris D. Godsil, Ilia Krasikov, Yehuda Roditty
1983 J jnl
Packing and Covering of the Complete Graph with a Graph G of Four Vertices or Less.
J. Comb. Theory A
Yehuda Roditty