Efficient construction of broadcast graphs von Averbuch, A., Hollander Shabtai, R., Roditty, Y.

Volltext

Dense graphs are antimagic von Alon, N., Kaplan, G., Lev, A., Roditty, Y., Yuster, R.

Volltext

Bertrand's postulate, the prime number theorem and product anti-magic graphs von Kaplan, G., Lev, A., Roditty, Y.

Volltext

On a Reconstruction Problem for Sequences von Krasikov, I., Roditty, Y.

Volltext

A note: some results in step domination of trees von Dror, G., Lev, A., Roditty, Y.

Volltext

On colored designs-III: on λ-colored H-designs, H having λ edges von CARO, Y, RODITTY, Y, SCHÖNHEIM, J

Volltext

Efficient line broadcasting in a d-dimensional grid von Averbuch, A., Roditty, Y., Shoham, B.

Volltext

Low-cost minimum-time line-broadcasting schemes in complete binary trees von Averbuch, A., Gaber, I., Roditty, Y.

Volltext

On broadcasting multiple messages in a d-dimensional grid von Roditty, Y., Shoham, B.

Volltext

A NOTE ON THE k-DOMINATION NUMBER OF A GRAPH von Caro, Y., Roditty, Y.

Volltext

More on Vertex-Switching Reconstruction von Krasikov, I., Roditty, Y.

Volltext

Bounds for the harmonious chromatic number of a graph von Krasikov, I., Roditty, Y.

Volltext

Acyclic edge-colorings of sparse graphs von Caro, Y., Roditty, Y.

Volltext

Packing and covering of the complete graph with a graph G of four vertices or less von Roditty, Y

Volltext

Performance analysis of hybrid network multiprocessor architecture von Averbuch, A., Roditty, Y., Shoham, B.

Volltext

ZERO-SUM PARTITION THEOREMS FOR GRAPHS von Caro, Y., Krasikov, I., Roditty, Y.

Volltext

On induced subgraphs of trees, with restricted degrees von Caro, Y., Krasikov, I., Roditty, Y.

Volltext

Scheduling tasks of multi-join queries in a multiprocessor von Averbuch, A., Roditty, Y., Shoham, B.

Volltext

Switching reconstruction and diophantine equations von Krasikov, I, Roditty, Y

Volltext

On zero-sum turan problems of Bialostocki and Dierker von Caro, Y., Roditty, Y.

Volltext