Result 1 to 20 of 185 total
Solving large Steiner Triple Covering Problems. (English)
Oper. Res. Lett. 39, No. 2, 127-131 (2011).
1
Mathematical aspects of network routing optimization. (English)
Springer Optimization and Its Applications 53. New York, NY: Springer (ISBN 978-1-4614-0310-4/hbk; 978-1-4614-0311-1/ebook). xxiii, 206~p. EUR~79.95/net; SFR~115.00; \sterling~72.00; \$~99.00 (2011).
2
Join-irreducible Boolean functions. (English)
Order 27, No. 3, 261-282 (2010).
3
A viral system massive infection algorithm to solve the Steiner tree problem in graphs with medium terminal density. (English)
Int. J. Bio-Inspired Comput. 2, No. 2, 71-77 (2010).
4
On list coloring Steiner triple systems. (English)
J. Comb. Des. 17, No. 4, 314-322 (2009).
5
Embedding in a perfect code. (English)
J. Comb. Des. 17, No. 5, 419-423 (2009).
6
Some unsolved problems in discrete mathematics and mathematical cybernetics. (English)
Russ. Math. Surv. 64, No. 5, 787-803 (2009); translation from Usp. Mat. Nauk 64, No. 5, 3-14 (2009).
7
Bounds and constructions for key distribution schemes. (English)
Adv. Math. Commun. 3, No. 3, 273-293 (2009).
8
Small stopping sets in Steiner triple systems. (English)
Cryptogr. Commun. 1, No. 1, 31-46 (2009).
9
Cliques in Steiner systems. (English)
Math. Slovaca 59, No. 1, 109-120 (2009).
10
Equitable specialized block-colourings for Steiner triple systems. (English)
Graphs Comb. 24, No. 4, 313-326 (2008).
11
Construction of large constant dimension codes with a prescribed minimum distance. (English)
Calmet, Jacques (ed.) et al., Mathematical methods in computer science. Essays in memory of Thomas Beth. Berlin: Springer (ISBN 978-3-540-89993-8/pbk). Lecture Notes in Computer Science 5393, 31-42 (2008).
12
A new online extended visual cryptography scheme for STS access structures. (English)
J. Discrete Math. Sci. Cryptography 11, No. 3, 357-374 (2008).
13
Clique partitions of complements of forests and bounded degree graphs. (English)
Discrete Math. 308, No. 10, 2011-2017 (2008).
14
Shortest single axioms for commutative Moufang loops of exponent 3. (English)
Discrete Math. 308, No. 15, 3381-3385 (2008).
15
On strongly regular bicirculants. (English)
Eur. J. Comb. 28, No. 3, 891-900 (2007).
16
Constructions for anonymous secret sharing schemes using combinatorial designs. (English)
Acta Math. Appl. Sin., Engl. Ser. 23, No. 1, 67-78 (2007).
17
Configuration distribution and designs of codes in the Johnson scheme. (English)
J. Comb. Des. 15, No. 1, 15-34 (2007).
18
Some rank 3 residually connected geometries for $M_{23}$. (English)
Int. J. Contemp. Math. Sci. 1, No. 13-16, 697-718 (2006).
19
On rank 3 residually connected geometries for $M_{23}$. (English)
Int. J. Contemp. Math. Sci. 1, No. 13-16, 679-696 (2006).
20
Result 1 to 20 of 185 total
Start
Contact
Print
General Help
