Sets defining minimal vertex covers. - Jaume Martí-Farré (Discret. Math., 1999)

Secret Sharing Schemes on Sparse Homogeneous Access Structures with Rank Three. - Jaume Martí-Farré; Carles Padró (Electron. J. Comb., 2004)

On codes, matroids and secure multi-party computation from linear secret sharing schemes. - Ronald Cramer; Vanesa Daza; Ignacio Gracia; Jorge Jiménez Urroz; Gregor Leander; Jaume Martí-Farré; Carles Padró (IACR Cryptol. ePrint Arch., 2004)

Secret Sharing Schemes with Three or Four Minimal Qualified Subsets. - Jaume Martí-Farré; Carles Padró (Des. Codes Cryptogr., 2005)

Secret sharing schemes on access structures with intersection number equal to one. - Jaume Martí-Farré; Carles Padró (Discret. Appl. Math., 2006)

A note on secret sharing schemes with three homogeneous access structure. - Jaume Martí-Farré (Inf. Process. Lett., 2007)

On the Diameter of Matroid Ports. - Jaume Martí-Farré; Carles Padró; Leonor Vázquez (Electron. J. Comb., 2008)

On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes. - Ronald Cramer; Vanesa Daza; Ignacio Gracia; Jorge Jiménez Urroz; Gregor Leander; Jaume Martí-Farré; Carles Padró (IEEE Trans. Inf. Theory, 2008)

Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. - Jaume Martí-Farré; Carles Padró (Des. Codes Cryptogr., 2009)

On secret sharing schemes, matroids and polymatroids. - Jaume Martí-Farré; Carles Padró (J. Math. Cryptol., 2010)

Optimal complexity of secret sharing schemes with four minimal qualified subsets. - Jaume Martí-Farré; Carles Padró; Leonor Vázquez (Des. Codes Cryptogr., 2011)

Ideal Multipartite Secret Sharing Schemes. - Oriol Farràs; Jaume Martí-Farré; Carles Padró (J. Cryptol., 2012)

From Clutters to Matroids. - Jaume Martí-Farré (Electron. J. Comb., 2014)

Linearly dependent vectorial decomposition of clutters. - Jaume Martí-Farré (Electron. Notes Discret. Math., 2014)

Completion and decomposition of hypergraphs into dominating sets of graphs. - Jaume Martí-Farré; Mercè Mora; José Luis Ruiz (Electron. Notes Discret. Math., 2015)

Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing. - Josep Fàbrega; Jaume Martí-Farré; Xavier Muñoz (Electron. Notes Discret. Math., 2016)

Uniform clutters and dominating sets of graphs. - Jaume Martí-Farré; Mercè Mora; José Luis Ruiz (Discret. Appl. Math., 2019)

Uniform forcing and immune sets in graphs and hypergraphs. - Josep Fàbrega; Jaume Martí-Farré; Xavier Muñoz (Discret. Appl. Math., 2021)

Elimination properties for minimal dominating sets of graphs. - Jaume Martí-Farré; Mercè Mora; María Luz Puertas; José Luis Ruiz (Discuss. Math. Graph Theory, 2023)

Approximation and decomposition in lattices of clutters. - Jaume Martí-Farré; Anna de Mier (Discret. Math., 2023)

Immune sets in monotone infection rules. Characterization and complexity. - Josep Fàbrega; Jaume Martí-Farré; Xavier Muñoz (Discret. Appl. Math., 2023)

Distance-layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing. - Josep Fàbrega; Jaume Martí-Farré; Xavier Muñoz (Networks, 2023)