Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Roditty, Y."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dense graphs are antimagic
N. Alon
,
G. Kaplan
,
A. Lev
,
Y. Roditty
,
R. Yuster
Journal of Graph Theory
47
(4), 2004, pp. 297-309
Low-cost minimum-time line-broadcasting schemes in complete binary trees
A. Averbuch
,
I. Gaber
,
Y. Roditty
Networks
38
(4), 2001, pp. 189-193
Efficient line broadcasting in a
d
-dimensional grid
A. Averbuch
,
Y. Roditty
,
B. Shoham
Discrete Applied Mathematics
113
(2-3), 2001, pp. 129-141
On a reconstruction problem for sequences
I. Krasikov
,
Y. Roditty
Journal of Combinatorial Theory Series A
77
(2), 1997, pp. 344-348
On broadcasting multiple messages in a
d
-dimensional grid
Y. Roditty
,
B. Shoham
Discrete Applied Mathematics
75
(3), 1997, pp. 277-284
Bounds for the harmonious chromatic number of a graph
I. Krasikov
,
Y. Roditty
Journal of Graph Theory
18
(2), 1994, pp. 205-209
More on vertex-switching reconstruction
I. Krasikov
,
Y. Roditty
Journal of Combinatorial Theory Series B
60
(1), 1994, pp. 40-55
Switching reconstruction and diophantine equations
I. Krasikov
,
Y. Roditty
Journal of Combinatorial Theory Series B
54
(2), 1992, pp. 189-195
On the largest tree of given maximum degree in a connected graph
Y. Caro
,
I. Krasikov
,
Y. Roditty
Journal of Graph Theory
15
(1), 1991, pp. 7-13
Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture
I. Krasikov
,
Y. Roditty
Graphs and Combinatorics
6
, 1990, pp. 37-39
Combinatorial reconstruction problems
N. Alon
,
Y. Caro
,
I. Krasikov
,
Y. Roditty
Journal of Combinatorial Theory Series B
47
, 1989, pp. 153-161
Reconstructing graphs from their
k
-edge deleted subgraphs
C.D. Godsil
,
I. Krasikov
,
Y. Roditty
Journal of Combinatorial Theory Series B
43
(3), 1987, December, pp. 360-363
Packing and covering of the complete graph with a graph
G
of four vertices or less
Y. Roditty
Journal of Combinatorial Theory Series A
34
, 1983, pp. 231-243