default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosep Fàbrega
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j29]Josep Fàbrega
, Jaume Martí-Farré, Xavier Muñoz:
Immune sets in monotone infection rules. Characterization and complexity. Discret. Appl. Math. 339: 202-215 (2023)- [j28]Josep Fàbrega, Jaume Martí-Farré, Xavier Muñoz:
Distance-layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing. Networks 82(4): 527-550 (2023) - 2021
- [j27]Josep Fàbrega, Jaume Martí-Farré, Xavier Muñoz:
Uniform forcing and immune sets in graphs and hypergraphs. Discret. Appl. Math. 305: 23-33 (2021)
2010 – 2019
- 2018
- [c3]Josep Fàbrega, Xavier Muñoz:
Online Matching in Regular Bipartite Graphs with Randomized Adversary. Adventures Between Lower Bounds and Higher Altitudes 2018: 297-310 - 2016
- [j26]Josep Fàbrega, Jaume Martí-Farré, Xavier Muñoz:
Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing. Electron. Notes Discret. Math. 54: 157-162 (2016) - 2014
- [j25]Marc Cámara, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga:
On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes. Discret. Appl. Math. 176: 12-18 (2014) - 2011
- [j24]Marc Cámara, Cristina Dalfó, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga:
Edge-distance-regular graphs. Electron. Notes Discret. Math. 38: 221-226 (2011) - [j23]Marc Cámara, Cristina Dalfó, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga:
Edge-distance-regular graphs. J. Comb. Theory A 118(7): 2071-2091 (2011) - [j22]José Gómez, Josep Fàbrega, José Luis Andres Yebra:
On large (Δ, D, D, 1)-graphs. Networks 57(4): 316-327 (2011) - 2010
- [j21]Marc Cámara, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga:
Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j20]Marc Cámara, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga:
Some Families of Orthogonal Polynomials of a Discrete Variable and their Applications to Graphs and Codes. Electron. J. Comb. 16(1) (2009) - 2007
- [j19]Camino Balbuena, Josep Fàbrega, Pedro García-Vázquez:
Edge-connectivity and edge-superconnectivity in sequence graphs. Discret. Appl. Math. 155(16): 2053-2060 (2007) - 2005
- [j18]Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo, Josep Fàbrega:
(delta, g)-cages with g geq 10 are 4-connected. Discret. Math. 301(1): 124-136 (2005) - [j17]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
- [j16]Ignacio M. Pelayo, Xavier Marcote, Camino Balbuena, Josep Fàbrega:
Using a progressive withdrawal procedure to study superconnectivity in digraphs. Discret. Math. 267(1-3): 229-246 (2003) - [c2]Josep Fàbrega, Xavier Muñoz:
A Study of Network Capacity under Deflection Routing Schemes. Euro-Par 2003: 989-994 - [p1]Josep Fàbrega, Miguel Angel Fiol, Herbert Fleischner, R. Gary Parker, A Dewdney, Ronald J. Gould, Gregory Z. Gutin:
Connectivity and Traversability. Handbook of Graph Theory 2003: 193-339 - 2002
- [j15]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
- [e1]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. Proceedings in Informatics 8, Carleton Scientific 2001, ISBN 1-894145-10-0 [contents] - 2000
- [j14]Lali Barrière, Josep Fàbrega, Ester Simó, Marisa Zaragozá:
Fault-tolerant routings in chordal ring networks. Networks 36(3): 180-190 (2000) - [c1]Lali Barrière, Josep Fàbrega:
Edge-Bisection of Chordal Rings. MFCS 2000: 162-171
1990 – 1999
- 1999
- [j13]Camino Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
Superconnectivity of bipartite digraphs and graphs. Discret. Math. 197-198: 61-75 (1999) - [j12]Ángeles Carmona, Josep Fàbrega:
On the superconnectivity and the conditional diameter of graphs and digraphs. Networks 34(3): 197-205 (1999) - 1997
- [j11]Josep Fàbrega, Marisa Zaragozá:
Fault-tolerant Routings in Double Fixed-step Networks. Discret. Appl. Math. 78(1-3): 61-74 (1997) - [j10]Camino Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
Extraconnectivity of graphs with large minimum degree and girth. Discret. Math. 167-168: 85-100 (1997) - [j9]M. C. Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
Connectivity of large bipartite digraphs and graphs. Discret. Math. 174(1-3): 3-17 (1997) - [j8]M. C. Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
On the order and size of s-geodetic digraphs with given connectivity. Discret. Math. 174(1-3): 19-27 (1997) - 1996
- [j7]Josep Fàbrega, Miguel Angel Fiol:
Bipartite Graphs and Digraphs with Maximum Connectivity. Discret. Appl. Math. 69(3): 271-279 (1996) - [j6]Josep Fàbrega, Miguel Angel Fiol:
On the extraconnectivity of graphs. Discret. Math. 155(1-3): 49-57 (1996) - [j5]Camino Balbuena, Ángeles 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
- [j4]Miguel Angel Fiol, Josep Fàbrega:
On the distance connectivity of graphs and digraphs. Discret. Math. 125(1-3): 169-176 (1994) - [j3]Josep Fàbrega, Miguel Angel Fiol:
Extraconnectivity of graphs with large girth. Discret. Math. 127(1-3): 163-170 (1994) - 1993
- [j2]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 Process. Lett. 3: 445-456 (1993)
1980 – 1989
- 1989
- [j1]Josep Fàbrega, Miguel Angel Fiol:
Maximally connected digraphs. J. Graph Theory 13(6): 657-668 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
