SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Yehuda Roditty: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.007secs, Finished in 0.010secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP