Author of the publication

New bounds on the diameter vulnerability of iterated line digraphs.

, and . Discret. Math., 233 (1-3): 103-113 (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Spanners of Underlying Graphs of Iterated Line Digraphs., and . SIROCCO, page 180-194. Carleton Scientific, (1996)Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs"., , and . IEEE Trans. Computers, 45 (6): 768 (1996)New bounds on the diameter vulnerability of iterated line digraphs., and . Discret. Math., 233 (1-3): 103-113 (2001)Representing Small Identically Self-Dual Matroids by Self-Dual Codes., and . SIAM J. Discret. Math., 20 (4): 1046-1055 (2006)Secret sharing schemes with three or four minimal qualified subsets., and . IACR Cryptology ePrint Archive, (2002)Optimal Algebraic Manipulation Detection Codes., , and . IACR Cryptology ePrint Archive, (2014)On the Diameter of Matroid Ports., , and . Electr. J. Comb., (2008)Matroids Can Be Far from Ideal Secret Sharing., , and . TCC, volume 4948 of Lecture Notes in Computer Science, page 194-212. Springer, (2008)Ideal Hierarchical Secret Sharing Schemes., and . TCC, volume 5978 of Lecture Notes in Computer Science, page 219-236. Springer, (2010)Secret Sharing Schemes with Bipartite Access Structure., and . EUROCRYPT, volume 1403 of Lecture Notes in Computer Science, page 500-511. Springer, (1998)