| 2001 |
|---|
| 5 | EE | Kaliappa Nadar Ravindran,
Ali Sabbir,
Dmitri Loguinov,
Gary S. Bloom:
Cost Optimal Multicast Trees for Multi-source Data Flows.
INFOCOM 2001: 966-975 |
| 1994 |
|---|
| 4 | | Gary S. Bloom,
Sergio Ruiz:
Decompositions into Linear Forests and Difference Labelings of Graphs.
Discrete Applied Mathematics 49(1-3): 61-75 (1994) |
| 1991 |
|---|
| 3 | EE | Gary S. Bloom,
D. Frank Hsu:
Foreword.
Discrete Mathematics 93(2-3): 111-113 (1991) |
| 1979 |
|---|
| 2 | EE | Edward F. Schmeichel,
Gary S. Bloom:
Connectivity, genus, and the number of components in vertex-deleted subgraphs.
J. Comb. Theory, Ser. B 27(2): 198-201 (1979) |
| 1977 |
|---|
| 1 | | Gary S. Bloom:
A Counterexample to a Theorem of S. Piccard.
J. Comb. Theory, Ser. A 22(3): 378-379 (1977) |
