Jaume Martí-Farré

Networks, December, 2023

Immune sets in monotone infection rules. Characterization and complexity.

[BibT_eX]

[DOI]

Discret. Appl. Math., November, 2023

Approximation and decomposition in lattices of clutters.

[BibT_eX]

[DOI]

Anna de Mier

Discret. Math., August, 2023

Elimination properties for minimal dominating sets of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2023

2021

Uniform forcing and immune sets in graphs and hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2019

Uniform clutters and dominating sets of graphs.

[BibT_eX]

[DOI]

Mercè Mora

José Luis Ruiz

Discret. Appl. Math., 2019

2016

Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

2015

Completion and decomposition of hypergraphs into dominating sets of graphs.

[BibT_eX]

[DOI]

Mercè Mora

José Luis Ruiz

Electron. Notes Discret. Math., 2015

2014

Linearly dependent vectorial decomposition of clutters.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2014

From Clutters to Matroids.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

2012

Ideal Multipartite Secret Sharing Schemes.

[BibT_eX]

[DOI]

Oriol Farràs

J. Cryptol., 2012

2011

Optimal complexity of secret sharing schemes with four minimal qualified subsets.

[BibT_eX]

[DOI]

Leonor Vázquez

Des. Codes Cryptogr., 2011

2009

Ideal secret sharing schemes whose minimal qualified subsets have at most three participants.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

2008

On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

On the Diameter of Matroid Ports.

[BibT_eX]

[DOI]

Leonor Vázquez

Electron. J. Comb., 2008

2007

A note on secret sharing schemes with three homogeneous access structure.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

2006

On Secret Sharing Schemes, Matroids and Polymatroids.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Secret sharing schemes on access structures with intersection number equal to one.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Secret Sharing Schemes with Three or Four Minimal Qualified Subsets.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2005

2004

On codes, matroids and secure multi-party computation from linear secret sharing schemes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

Secret Sharing Schemes on Sparse Homogeneous Access Structures with Rank Three.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

1999

Sets defining minimal vertex covers.

[BibT_eX]

[DOI]