| Publication | Date of Publication | Type |
|---|
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing
Networks | 2024-01-18 | Paper |
Immune sets in monotone infection rules. Characterization and complexity
Discrete Applied Mathematics | 2023-12-11 | Paper |
Approximation and decomposition in lattices of clutters
Discrete Mathematics | 2023-05-31 | Paper |
Elimination properties for minimal dominating sets of graphs
Discussiones Mathematicae Graph Theory | 2022-12-02 | Paper |
Uniform forcing and immune sets in graphs and hypergraphs
Discrete Applied Mathematics | 2021-10-21 | Paper |
Uniform clutters and dominating sets of graphs
Discrete Applied Mathematics | 2019-06-06 | Paper |
Transformation and decomposition of clutters into matroids
Advances in Mathematics | 2017-05-10 | Paper |
| Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing | 2017-02-13 | Paper |
| Completion and decomposition of hypergraphs into dominating sets of graphs | 2016-10-14 | Paper |
| Linearly dependent vectorial decomposition of clutters | 2016-05-13 | Paper |
| Uniform hypergraphs and dominating sets of graphs | 2016-05-05 | Paper |
Completion and decomposition of a clutter into representable matroids
Linear Algebra and its Applications | 2015-02-27 | Paper |
From clutters to matroids
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Ideal multipartite secret sharing schemes
Journal of Cryptology | 2012-07-10 | Paper |
Optimal complexity of secret sharing schemes with four minimal qualified subsets
Designs, Codes and Cryptography | 2011-09-27 | Paper |
On secret sharing schemes, matroids and polymatroids
Journal of Mathematical Cryptology | 2010-11-12 | Paper |
A note on secret sharing schemes with three homogeneous access structure
Information Processing Letters | 2010-01-29 | Paper |
| scientific article; zbMATH DE number 5556015 (Why is no real title available?) | 2009-05-22 | Paper |
On the diameter of matroid ports
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
On the diameter of matroid ports
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
Designs, Codes and Cryptography | 2009-03-31 | Paper |
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants
Lecture Notes in Computer Science | 2008-11-27 | Paper |
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Ideal Multipartite Secret Sharing Schemes
Advances in Cryptology - EUROCRYPT 2007 | 2007-11-29 | Paper |
On Secret Sharing Schemes, Matroids and Polymatroids
Theory of Cryptography | 2007-08-30 | Paper |
Secret sharing schemes on access structures with intersection number equal to one
Discrete Applied Mathematics | 2006-04-28 | Paper |
Secret sharing schemes on sparse homogeneous access structures with rank three
The Electronic Journal of Combinatorics | 2005-04-25 | Paper |
Secret sharing schemes on sparse homogeneous access structures with rank three
The Electronic Journal of Combinatorics | 2005-04-25 | Paper |
Secret sharing schemes with three or four minimal qualified subsets
Designs, Codes and Cryptography | 2005-02-28 | Paper |
| scientific article; zbMATH DE number 1952912 (Why is no real title available?) | 2003-07-24 | Paper |
Symbolic powers and the associated graded ring
Communications in Algebra | 1997-07-14 | Paper |
Symbolic powers, integral closure and local cohomology
Communications in Algebra | 1996-05-13 | Paper |
Symbolic powers and local cohomology
Mathematika | 1995-11-09 | Paper |
General symbolic powers: A homological point of view
Communications in Algebra | 1995-04-09 | Paper |
