Elimination properties for minimal dominating sets of graphs. | 0 | 0.34 | 2023 |
Uniform clutters and dominating sets of graphs | 0 | 0.34 | 2019 |
Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing. | 0 | 0.34 | 2016 |
Completion and decomposition of hypergraphs into dominating sets of graphs | 0 | 0.34 | 2015 |
From Clutters to Matroids. | 1 | 0.43 | 2014 |
Optimal complexity of secret sharing schemes with four minimal qualified subsets | 3 | 0.43 | 2011 |
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants | 4 | 0.41 | 2009 |
On secret sharing schemes, matroids and polymatroids | 19 | 0.91 | 2007 |
A note on secret sharing schemes with three homogeneous access structure | 1 | 0.35 | 2007 |
On codes, matroids and secure multi-party computation from linear secret sharing schemes | 21 | 1.19 | 2005 |
Secret sharing schemes with three or four minimal qualified subsets | 22 | 0.96 | 2005 |
Secret sharing schemes on sparse homogeneous access structures with rank three. | 2 | 0.38 | 2003 |
Secret sharing schemes on access structures with intersection number equal to one | 13 | 0.63 | 2002 |
Sets defining minimal vertex covers | 0 | 0.34 | 1999 |