 | 2007 |
|---|
| 21 |       | Camino Balbuena,
Josep Fàbrega,
Pedro García-Vázquez:
Edge-connectivity and edge-superconnectivity in sequence graphs.
Discrete Applied Mathematics 155(16): 2053-2060 (2007) |
| 2005 |
|---|
| 20 | | Xavier Marcote,
Camino Balbuena,
Ignacio M. Pelayo,
Josep Fàbrega:
(delta, g)-cages with g geq 10 are 4-connected.
Discrete Mathematics 301(1): 124-136 (2005) |
| 19 | | Xavier Marcote,
Camino Balbuena,
Josep Fàbrega:
Connectedness of digraphs and graphs under constraints on the conditional diameter.
Networks 45(2): 80-87 (2005) |
| 2003 |
|---|
| 18 | | Josep Fàbrega,
Xavier Muñoz:
A Study of Network Capacity under Deflection Routing Schemes.
Euro-Par 2003: 989-994 |
| 17 | | Ignacio M. Pelayo,
Xavier Marcote,
Camino Balbuena,
Josep Fàbrega:
Using a progressive withdrawal procedure to study superconnectivity in digraphs.
Discrete Mathematics 267(1-3): 229-246 (2003) |
| 2002 |
|---|
| 16 | | Camino Balbuena,
Josep Fàbrega,
Xavier Marcote,
Ignacio M. Pelayo:
Superconnected digraphs and graphs with small conditional diameters.
Networks 39(3): 153-160 (2002) |
| 2001 |
|---|
| 15 |  | Francesc Comellas,
Josep Fàbrega,
Pierre Fraigniaud:
SIROCCO 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001
Carleton Scientific 2001 |
| 2000 |
|---|
| 14 | | Lali Barrière,
Josep Fàbrega:
Edge-Bisection of Chordal Rings.
MFCS 2000: 162-171 |
| 13 | | Lali Barrière,
Josep Fàbrega,
Ester Simó,
Marisa Zaragozá:
Fault-tolerant routings in chordal ring networks.
Networks 36(3): 180-190 (2000) |
| 1999 |
|---|
| 12 | | Camino Balbuena,
Angeles Carmona,
Josep Fàbrega,
Miguel Angel Fiol:
Superconnectivity of bipartite digraphs and graphs.
Discrete Mathematics 197-198: 61-75 (1999) |
| 11 | | Angeles Carmona,
Josep Fàbrega:
On the superconnectivity and the conditional diameter of graphs and digraphs.
Networks 34(3): 197-205 (1999) |
| 1997 |
|---|
| 10 | | Josep Fàbrega,
Marisa Zaragozá:
Fault-tolerant Routings in Double Fixed-step Networks.
Discrete Applied Mathematics 78(1-3): 61-74 (1997) |
| 9 | | Camino Balbuena,
Angeles Carmona,
Josep Fàbrega,
Miguel Angel Fiol:
Extraconnectivity of graphs with large minimum degree and girth.
Discrete Mathematics 167-168: 85-100 (1997) |
| 8 | | M. C. Balbuena,
Angeles Carmona,
Josep Fàbrega,
Miguel Angel Fiol:
On the order and size of s-geodetic digraphs with given connectivity.
Discrete Mathematics 174(1-3): 19-27 (1997) |
| 7 | | M. C. Balbuena,
Angeles Carmona,
Josep Fàbrega,
Miguel Angel Fiol:
Connectivity of large bipartite digraphs and graphs.
Discrete Mathematics 174(1-3): 3-17 (1997) |
| 1996 |
|---|
| 6 | | Josep Fàbrega,
Miguel Angel Fiol:
Bipartite Graphs and Digraphs with Maximum Connectivity.
Discrete Applied Mathematics 69(3): 271-279 (1996) |
| 5 | | Josep Fàbrega,
Miguel Angel Fiol:
On the extraconnectivity of graphs.
Discrete Mathematics 155(1-3): 49-57 (1996) |
| 4 | | Camino Balbuena,
Angeles Carmona,
Josep Fàbrega,
Miguel Angel Fiol:
On the connectivity and the conditional diameter of graphs and digraphs.
Networks 28(2): 97-105 (1996) |
| 1994 |
|---|
| 3 | | Miguel Angel Fiol,
Josep Fàbrega:
On the distance connectivity of graphs and digraphs.
Discrete Mathematics 125(1-3): 169-176 (1994) |
| 2 | | Josep Fàbrega,
Miguel Angel Fiol:
Extraconnectivity of graphs with large girth.
Discrete Mathematics 127(1-3): 163-170 (1994) |
| 1993 |
|---|
| 1 | | Miguel Angel Fiol,
Josep Fàbrega,
Oriol Serra,
J. Luis A. Yebra:
A Unified Approach to the design and Control of Dynamic Memory Networks.
Parallel Processing Letters 3: 445-456 (1993) |
