| 2001 | ||
|---|---|---|
| c1 | Kaliappa Nadar Ravindran, Ali Sabbir, Dmitri Loguinov, Gary S. Bloom: Cost Optimal Multicast Trees for Multi-source Data Flows. INFOCOM 2001: 966-975 | |
| 1994 | ||
| j4 | Gary S. Bloom, Sergio Ruiz: Decompositions into Linear Forests and Difference Labelings of Graphs. Discrete Applied Mathematics 49(1-3): 61-75 (1994) | |
| 1991 | ||
| j3 | ||
| 1979 | ||
| j2 | 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 | ||
| j1 | Gary S. Bloom: A Counterexample to a Theorem of S. Piccard. J. Comb. Theory, Ser. A 22(3): 378-379 (1977) | |
| 1 | D. Frank Hsu | |
| 2 | Dmitri Loguinov | |
| 3 | Kaliappa Nadar Ravindran (Kaliappa Ravindran) | |
| 4 | Sergio Ruiz | |
| 5 | Ali Sabbir (Ali Shihab Sabbir) | |
| 6 | Edward F. Schmeichel |
Data released under the ODC-BY 1.0 license — See also our legal information page