| |
| 2000 | ||
|---|---|---|
| 3 | EE | Somasundaram Ravindran, Alan Gibbons, Mike Paterson: Dense edge-disjoint embedding of complete binary trees in interconnection networks. Theor. Comput. Sci. 249(2): 325-342 (2000) |
| 1993 | ||
| 2 | N. W. Holloway, Somasundaram Ravindran, Alan Gibbons: Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality. WG 1993: 11-20 | |
| 1 | Somasundaram Ravindran, Alan Gibbons: Dense Edge-Disjoint Embedding of Complete Binary Trees in the Hypercube. Inf. Process. Lett. 45(6): 321-325 (1993) | |
| 1 | Alan Gibbons | [1] [2] [3] |
| 2 | N. W. Holloway | [2] |
| 3 | Mike Paterson | [3] |