|
Search the dblp DataBase
Josep Fàbrega:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Josep Fàbrega, Xavier Muñoz
A Study of Network Capacity under Deflection Routing Schemes. [Citation Graph (0, 0)][DBLP] Euro-Par, 2003, pp:989-994 [Conf]
- Lali Barrière, Josep Fàbrega
Edge-Bisection of Chordal Rings. [Citation Graph (0, 0)][DBLP] MFCS, 2000, pp:162-171 [Conf]
- Josep Fàbrega, Miguel Angel Fiol
Bipartite Graphs and Digraphs with Maximum Connectivity. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:69, n:3, pp:271-279 [Journal]
- Josep Fàbrega, Marisa Zaragozá
Fault-tolerant Routings in Double Fixed-step Networks. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:61-74 [Journal]
- Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo, Josep Fàbrega
(delta, g)-cages with g geq 10 are 4-connected. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:301, n:1, pp:124-136 [Journal]
- Ignacio M. Pelayo, Xavier Marcote, Camino Balbuena, Josep Fàbrega
Using a progressive withdrawal procedure to study superconnectivity in digraphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:267, n:1-3, pp:229-246 [Journal]
- Angeles Carmona, Josep Fàbrega
On the superconnectivity and the conditional diameter of graphs and digraphs. [Citation Graph (0, 0)][DBLP] Networks, 1999, v:34, n:3, pp:197-205 [Journal]
- Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
On the connectivity and the conditional diameter of graphs and digraphs. [Citation Graph (0, 0)][DBLP] Networks, 1996, v:28, n:2, pp:97-105 [Journal]
- Camino Balbuena, Josep Fàbrega, Xavier Marcote, Ignacio M. Pelayo
Superconnected digraphs and graphs with small conditional diameters. [Citation Graph (0, 0)][DBLP] Networks, 2002, v:39, n:3, pp:153-160 [Journal]
- Lali Barrière, Josep Fàbrega, Ester Simó, Marisa Zaragozá
Fault-tolerant routings in chordal ring networks. [Citation Graph (0, 0)][DBLP] Networks, 2000, v:36, n:3, pp:180-190 [Journal]
- Xavier Marcote, Camino Balbuena, Josep Fàbrega
Connectedness of digraphs and graphs under constraints on the conditional diameter. [Citation Graph (0, 0)][DBLP] Networks, 2005, v:45, n:2, pp:80-87 [Journal]
- Miguel Angel Fiol, Josep Fàbrega, Oriol Serra, J. Luis A. Yebra
A Unified Approach to the design and Control of Dynamic Memory Networks. [Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 1993, v:3, n:, pp:445-456 [Journal]
- Camino Balbuena, Josep Fàbrega, Pedro García-Vázquez
Edge-connectivity and edge-superconnectivity in sequence graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:16, pp:2053-2060 [Journal]
- Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
Superconnectivity of bipartite digraphs and graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:197, n:, pp:61-75 [Journal]
- M. C. Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
On the order and size of s-geodetic digraphs with given connectivity. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:174, n:1-3, pp:19-27 [Journal]
- M. C. Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
Connectivity of large bipartite digraphs and graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:174, n:1-3, pp:3-17 [Journal]
- Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
Extraconnectivity of graphs with large minimum degree and girth. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:167, n:, pp:85-100 [Journal]
- Josep Fàbrega, Miguel Angel Fiol
On the extraconnectivity of graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:155, n:1-3, pp:49-57 [Journal]
- Miguel Angel Fiol, Josep Fàbrega
On the distance connectivity of graphs and digraphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:125, n:1-3, pp:169-176 [Journal]
- Josep Fàbrega, Miguel Angel Fiol
Extraconnectivity of graphs with large girth. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:127, n:1-3, pp:163-170 [Journal]
Search in 0.004secs, Finished in 0.005secs
|