| |
| 1999 | ||
|---|---|---|
| 7 | EE | Josep M. Basart, Pere Guitart: A Solution for the Coloured Cubes Problem. Theor. Comput. Sci. 225(1-2): 171-176 (1999) |
| 1998 | ||
| 6 | EE | Pere Guitart, Josep M. Basart: A High Performance Approximate Algorithm for the Steiner Problem in Graphs. RANDOM 1998: 280-293 |
| 1991 | ||
| 5 | Josep M. Basart: Some Upper Bounds for Minimal Trees. Inf. Process. Lett. 38(4): 209-213 (1991) | |
| 1989 | ||
| 4 | Josep M. Basart, Llorenç Huguet i Rotger: An Approximation Algorithm for the TSP. Inf. Process. Lett. 31(2): 77-81 (1989) | |
| 1988 | ||
| 3 | Josep Rifà, Josep M. Basart, Llorenç Huguet i Rotger: On Completely Regular Propelinear Codes. AAECC 1988: 341-355 | |
| 1987 | ||
| 2 | Josep M. Basart, Josep Rifà: Covering Radius for Codes Obtained from T(m) Triangular Graphs. AAECC 1987: 16-24 | |
| 1986 | ||
| 1 | Josep M. Basart, Llorenç Huguet i Rotger: From T(m) Triangular Graphs to Single-Error-Correcting Codes. AAECC 1986: 5-12 | |
| 1 | Pere Guitart | [6] [7] |
| 2 | Josep Rifà (Josep Rifà-Coma) | [2] [3] |
| 3 | Llorenç Huguet i Rotger | [1] [3] [4] |