AAAAAA
Results:
1-9
|
Results: 9
Authors:
HAKIMI SL
SCHMEICHEL EF
Citation: Sl. Hakimi et Ef. Schmeichel, LOCATING REPLICAS OF A DATABASE ON A NETWORK, Networks, 30(1), 1997, pp. 31-36
Authors:
HAKIMI SL
SCHMEICHEL EF
YOUNG NE
Citation: Sl. Hakimi et al., ORIENTING GRAPHS TO OPTIMIZE REACHABILITY, Information processing letters, 63(5), 1997, pp. 229-235
Authors:
BAGCHI A
SCHMEICHEL EF
HAKIMI SL
Citation: A. Bagchi et al., GOSSIPING WITH MULTIPLE SENDS AND RECEIVES, Discrete applied mathematics, 64(2), 1996, pp. 105-116
Authors:
LABBE M
SCHMEICHEL EF
HAKIMI SL
Citation: M. Labbe et al., APPROXIMATION ALGORITHMS FOR THE CAPACITATED PLANT ALLOCATION PROBLEM(VOL 15, PG 115, 1994), Operations research letters, 18(4), 1996, pp. 205-205
Authors:
HAKIMI SL
MITCHEM J
SCHMEICHEL EF
Citation: Sl. Hakimi et al., DEGREE-BOUNDED COLORING OF GRAPHS - VARIATIONS ON A THEME BY BROOKS, Journal of graph theory, 20(2), 1995, pp. 177-194
Authors:
LABBE M
SCHMEICHEL EF
HAKIMI SL
Citation: M. Labbe et al., APPROXIMATION ALGORITHMS FOR THE CAPACITATED PLANT ALLOCATION PROBLEM, Operations research letters, 15(3), 1994, pp. 115-126
Authors:
BAGCHI A
SCHMEICHEL EF
HAKIMI SL
Citation: A. Bagchi et al., PARALLEL INFORMATION DISSEMINATION BY PACKETS, SIAM journal on computing, 23(2), 1994, pp. 355-372
Authors:
UENO S
BAGCHI A
HAKIMI SL
SCHMEICHEL EF
Citation: S. Ueno et al., ON MINIMUM FAULT-TOLERANT NETWORKS, SIAM journal on discrete mathematics, 6(4), 1993, pp. 565-574
Authors:
HAKIMI SL
SCHMEICHEL EF
LABBE M
Citation: Sl. Hakimi et al., ON LOCATING PATH-SHAPED OR TREE-SHAPED FACILITIES ON NETWORKS, Networks, 23(6), 1993, pp. 543-555
Risultati:
1-9
|