default search action
Jaume Martí-Farré
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j21]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) - [j20]Jaume Martí-Farré, Anna de Mier:
Approximation and decomposition in lattices of clutters. Discret. Math. 346(8): 113445 (2023) - [j19]Jaume Martí-Farré, Mercè Mora
Elimination properties for minimal dominating sets of graphs. Discuss. Math. Graph Theory 43(1): 137-149 (2023) - [j18]Josep Fàbrega
Distance-layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing. Networks 82(4): 527-550 (2023) - 2021
- [j17]Josep Fàbrega
Uniform forcing and immune sets in graphs and hypergraphs. Discret. Appl. Math. 305: 23-33 (2021)
2010 – 2019
- 2019
- [j16]Jaume Martí-Farré, Mercè Mora
Uniform clutters and dominating sets of graphs. Discret. Appl. Math. 263: 220-233 (2019) - 2016
- [j15]Josep Fàbrega
Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing. Electron. Notes Discret. Math. 54: 157-162 (2016) - 2015
- [j14]Jaume Martí-Farré, Mercè Mora
Completion and decomposition of hypergraphs into dominating sets of graphs. Electron. Notes Discret. Math. 49: 213-220 (2015) - 2014
- [j13]Jaume Martí-Farré:
From Clutters to Matroids. Electron. J. Comb. 21(1): 1 (2014) - [j12]Jaume Martí-Farré:
Linearly dependent vectorial decomposition of clutters. Electron. Notes Discret. Math. 46: 209-216 (2014) - 2012
- [j11]Oriol Farràs
Ideal Multipartite Secret Sharing Schemes. J. Cryptol. 25(3): 434-463 (2012) - 2011
- [j10]Jaume Martí-Farré
Optimal complexity of secret sharing schemes with four minimal qualified subsets. Des. Codes Cryptogr. 61(2): 167-186 (2011) - 2010
- [j9]Jaume Martí-Farré
On secret sharing schemes, matroids and polymatroids. J. Math. Cryptol. 4(2): 95-120 (2010)
2000 – 2009
- 2009
- [j8]Jaume Martí-Farré
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. Des. Codes Cryptogr. 52(1): 1-14 (2009) - 2008
- [j7]Jaume Martí-Farré, Carles Padró, Leonor Vázquez:
On the Diameter of Matroid Ports. Electron. J. Comb. 15(1) (2008) - [j6]Ronald Cramer, Vanesa Daza
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes. IEEE Trans. Inf. Theory 54(6): 2644-2657 (2008) - 2007
- [j5]Jaume Martí-Farré
A note on secret sharing schemes with three homogeneous access structure. Inf. Process. Lett. 102(4): 133-137 (2007) - [c5]Oriol Farràs
Ideal Multipartite Secret Sharing Schemes. EUROCRYPT 2007: 448-465 - [c4]Jaume Martí-Farré, Carles Padró:
On Secret Sharing Schemes, Matroids and Polymatroids. TCC 2007: 273-290 - 2006
- [j4]Jaume Martí-Farré
Secret sharing schemes on access structures with intersection number equal to one. Discret. Appl. Math. 154(3): 552-563 (2006) - [c3]Jaume Martí-Farré, Carles Padró:
Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants. SCN 2006: 201-215 - [i6]Jaume Martí-Farré, Carles Padró:
On Secret Sharing Schemes, Matroids and Polymatroids. IACR Cryptol. ePrint Arch. 2006: 77 (2006) - [i5]Oriol Farràs, Jaume Martí-Farré, Carles Padró:
Ideal Multipartite Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2006: 292 (2006) - 2005
- [j3]Jaume Martí-Farré
Secret Sharing Schemes with Three or Four Minimal Qualified Subsets. Des. Codes Cryptogr. 34(1): 17-34 (2005) - [c2]Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes. CRYPTO 2005: 327-343 - 2004
- [j2]Jaume Martí-Farré, Carles Padró:
Secret Sharing Schemes on Sparse Homogeneous Access Structures with Rank Three. Electron. J. Comb. 11(1) (2004) - [i4]Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré, Carles Padró:
On codes, matroids and secure multi-party computation from linear secret sharing schemes. IACR Cryptol. ePrint Arch. 2004: 245 (2004) - 2003
- [i3]Jaume Martí-Farré, Carles Padró:
Secret sharing schemes on sparse homogeneous access structures with rank three. IACR Cryptol. ePrint Arch. 2003: 151 (2003) - 2002
- [c1]Jaume Martí-Farré, Carles Padró:
Secret Sharing Schemes on Access Structures with Intersection Number Equal to One. SCN 2002: 354-363 - [i2]Jaume Martí-Farré, Carles Padró:
Secret sharing schemes with three or four minimal qualified subsets. IACR Cryptol. ePrint Arch. 2002: 50 (2002) - [i1]Jaume Martí-Farré, Carles Padró:
Secret sharing schemes on access structures with intersection number equal to one. IACR Cryptol. ePrint Arch. 2002: 106 (2002)
1990 – 1999
- 1999
- [j1]Jaume Martí-Farré:
Sets defining minimal vertex covers. Discret. Math. 197-198: 555-559 (1999)
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-06-10 20: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: