dblp.uni-trier.dewww.uni-trier.de

Yehuda Roditty

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
29EEGil Kaplan, Arieh Lev, Yehuda Roditty: Bertrand's postulate, the prime number theorem and product anti-magic graphs. Discrete Mathematics 308(5-6): 787-794 (2008)
2004
28 Yair Caro, Yehuda Roditty: Connected colorings of graphs. Ars Comb. 70: (2004)
27EEGideon Dror, Arieh Lev, Yehuda Roditty: A note: some results in step domination of trees. Discrete Mathematics 289(1-3): 137-144 (2004)
26EENoga Alon, Gil Kaplan, Arieh Lev, Yehuda Roditty, Raphael Yuster: Dense graphs are antimagic. Journal of Graph Theory 47(4): 297-309 (2004)
2003
25 Yair Caro, Arieh Lev, Yehuda Roditty: Some results in step domination of graphs. Ars Comb. 68: (2003)
2002
24EEYair Caro, Yehuda Roditty, J. Schönheim: On colored designs-III: on lambda-colored H-designs, H having lambda edges. Discrete Mathematics 247(1-3): 51-64 (2002)
23EEGil Kaplan, Arieh Lev, Yehuda Roditty: Transitive large sets of disjoint decompositions and group sequencings. Discrete Mathematics 254(1-3): 207-219 (2002)
2001
22 Omer Berkman, Michal Parnas, Yehuda Roditty: All Cycles are Edge-Magic. Ars Comb. 59: (2001)
21 Amir Averbuch, Yehuda Roditty, Barack Shoham: Efficient line broadcasting in a d-dimensional grid. Discrete Applied Mathematics 113(2-3): 129-141 (2001)
20EEYehuda Roditty, Barack Shoham, Raphael Yuster: Monotone paths in edge-ordered sparse graphs. Discrete Mathematics 226(1-3): 411-417 (2001)
19EEGil Kaplan, Arieh Lev, Yehuda Roditty: Regular Oberwolfach Problems and Group Sequencings. J. Comb. Theory, Ser. A 96(1): 1-19 (2001)
18EEAmir Averbuch, Iris Gaber, Yehuda Roditty: Low-cost minimum-time line-broadcasting schemes in complete binary trees. Networks 38(4): 189-193 (2001)
2000
17 Yair Caro, Yehuda Roditty, J. Schönheim: Covering designs with minimum overlap. Ars Comb. 55: (2000)
16 Yair Caro, Yehuda Roditty: Improved bounds for the product of the domination and chromatic numbers of a graph. Ars Comb. 56: (2000)
15 Amir Averbuch, Yehuda Roditty, Barack Shoham: Performance analysis of hybrid network multiprocessor architecture. Concurrency - Practice and Experience 12(9): 821-844 (2000)
14EEArieh Lev, Yehuda Roditty: On Hering Decomposition ofDKnInduced by Group Actions on Conjugacy Classes. Eur. J. Comb. 21(3): 379-393 (2000)
1999
13 Amir Averbuch, Yehuda Roditty, Barack Shoham: Scheduling tasks of multi-join queries in a multiprocessor. Concurrency - Practice and Experience 11(5): 247-279 (1999)
1997
12EEYehuda Roditty, Barack Shoham: On Broadcasting Multiple Messages in a D-dimensional Grid. Discrete Applied Mathematics 75(3): 277-284 (1997)
11EEYair Caro, Yehuda Roditty, J. Schönheim: On colored designs - I. Discrete Mathematics 164(1-3): 47-65 (1997)
10EEIlia Krasikov, Yehuda Roditty: On a Reconstruction Problem for Sequences, . J. Comb. Theory, Ser. A 77(2): 344-348 (1997)
1996
9 Yehuda Roditty: Packing and covering of the complete graph, V: the forests of order six and their multiple copies. Ars Comb. 44: (1996)
1995
8EEYair Caro, Yehuda Roditty, J. Schönheim: On colored designs - II. Discrete Mathematics 138(1-3): 177-186 (1995)
1994
7EEYair Caro, Ilia Krasikov, Yehuda Roditty: On induced subgraphs of trees, with restricted degrees. Discrete Mathematics 125(1-3): 101-106 (1994)
6EEIlia Krasikov, Yehuda Roditty: More on Vertex-Switching Reconstruction. J. Comb. Theory, Ser. B 60(1): 40-55 (1994)
1992
5EEIlia Krasikov, Yehuda Roditty: Switching reconstruction and diophantine equations. J. Comb. Theory, Ser. B 54(2): 189-195 (1992)
1990
4EEYair Caro, Yehuda Roditty: A note on packing trees into complete bipartite graphs and on fishburn's conjecture. Discrete Mathematics 82(3): 323-326 (1990)
1989
3EENoga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty: Combinatorial reconstruction problems. J. Comb. Theory, Ser. B 47(2): 153-161 (1989)
1987
2EEChris D. Godsil, Ilia Krasikov, Yehuda Roditty: Reconstructing graphs from their k-edge deleted subgraphs. J. Comb. Theory, Ser. B 43(3): 360-363 (1987)
1983
1 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): 231-243 (1983)

Coauthor Index

1Noga Alon [3] [26]
2Amir Averbuch [13] [15] [18] [21]
3Omer Berkman [22]
4Yair Caro [3] [4] [7] [8] [11] [16] [17] [24] [25] [28]
5Gideon Dror [27]
6Iris Gaber [18]
7Chris D. Godsil (C. D. Godsil) [2]
8Gil Kaplan [19] [23] [26] [29]
9Ilia Krasikov [2] [3] [5] [6] [7] [10]
10Arieh Lev [14] [19] [23] [25] [26] [27] [29]
11Michal Parnas [22]
12J. Schönheim [8] [11] [17] [24]
13Barack Shoham [12] [13] [15] [20] [21]
14Raphael Yuster [20] [26]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)