 | 2012 |
|---|
| 31 |       | Simona Bonvicini,
Marco Buratti,
Gloria Rinaldi,
Tommaso Traetta:
Some progress on the existence of 1-rotational Steiner triple systems.
Des. Codes Cryptography 62(1): 63-78 (2012) |
| 2011 |
|---|
| 30 | | Marco Buratti,
Koji Momihara,
Anita Pasotti:
New results on optimal (v, 4, 2, 1) optical orthogonal codes.
Des. Codes Cryptography 58(1): 89-109 (2011) |
| 29 | | Marco Buratti,
Yueer Wei,
Dianhua Wu,
Pingzhi Fan,
Minquan Cheng:
Relative Difference Families With Variable Block Sizes and Their Related OOCs.
IEEE Transactions on Information Theory 57(11): 7489-7497 (2011) |
| 2010 |
|---|
| 28 | | Marco Buratti,
Anita Pasotti:
Further progress on difference families with block size 4 or 5.
Des. Codes Cryptography 56(1): 1-20 (2010) |
| 27 | | Marco Buratti,
Jie Yan,
Chengmin Wang:
From a 1-Rotational RBIBD to a Partitioned Difference Family.
Electr. J. Comb. 17(1): (2010) |
| 26 | | Marco Buratti,
Stefano Capparelli,
Alberto Del Fra:
Cyclic Hamiltonian cycle systems of the lambda-fold complete and cocktail party graphs.
Eur. J. Comb. 31(5): 1484-1496 (2010) |
| 2009 |
|---|
| 25 | | Marco Buratti,
Gloria Rinaldi:
A non-existence result on cyclic cycle-decompositions of the cocktail party graph.
Discrete Mathematics 309(14): 4722-4726 (2009) |
| 24 | | Marco Buratti,
Anita Pasotti:
Combinatorial designs and the theorem of Weil on multiplicative character sums.
Finite Fields and Their Applications 15(3): 332-344 (2009) |
| 23 | | Koji Momihara,
Marco Buratti:
Bounds and Constructions of Optimal (n, 4, 2, 1) Optical Orthogonal Codes.
IEEE Transactions on Information Theory 55(2): 514-523 (2009) |
| 2005 |
|---|
| 22 | | Marco Buratti,
Francesco Rania,
Fulvio Zuanni:
Some constructions for cyclic perfect cycle systems.
Discrete Mathematics 299(1-3): 33-48 (2005) |
| 21 | | Marco Buratti,
Gloria Rinaldi:
On sharply vertex transitive 2-factorizations of the complete graph.
J. Comb. Theory, Ser. A 111(2): 245-256 (2005) |
| 2004 |
|---|
| 20 | | Marco Buratti,
Alberto Del Fra:
Cyclic Hamiltonian cycle systems of the complete graph.
Discrete Mathematics 279(1-3): 107-119 (2004) |
| 19 | | Marco Buratti:
Existence of 1-Rotational k-Cycle Systems of the Complete Graph.
Graphs and Combinatorics 20(1): 41-46 (2004) |
| 18 | | R. Julian R. Abel,
Marco Buratti:
Some progress on (v, 4, 1) difference families and optical orthogonal codes.
J. Comb. Theory, Ser. A 106(1): 59-75 (2004) |
| 2003 |
|---|
| 17 | | Marco Buratti,
Alberto Del Fra:
Existence of cyclic k-cycle systems of the complete graph.
Discrete Mathematics 261(1-3): 113-125 (2003) |
| 2002 |
|---|
| 16 |  | Marco Buratti:
Cyclic Designs with Block Size 4 and Related Optimal Optical Orthogonal Codes.
Des. Codes Cryptography 26(1-3): 111-125 (2002) |
| 2001 |
|---|
| 15 | | Marco Buratti,
Fulvio Zuanni:
Perfect Cayley Designs as Generalizations of Perfect Mendelsohn Designs.
Des. Codes Cryptography 23(2): 233-248 (2001) |
| 14 | | Marco Buratti,
Fulvio Zuanni:
Some observations on three classical BIBD constructions.
Discrete Mathematics 238(1-3): 19-26 (2001) |
| 13 | | Marco Buratti:
Abelian 1-Factorizations of the Complete Graph.
Eur. J. Comb. 22(3): 291-295 (2001) |
| 2000 |
|---|
| 12 | | Marco Buratti:
Some Regular Steiner 2-Designs with Block Size 4.
Ars Comb. 55: (2000) |
| 11 | | Marco Buratti:
Existence of Z-Cyclic Triplewhist Tournaments for a Prime Number of Players.
J. Comb. Theory, Ser. A 90(2): 315-325 (2000) |
| 10 | | Marco Buratti:
Two New Classes of Difference Families.
J. Comb. Theory, Ser. A 90(2): 353-355 (2000) |
| 1999 |
|---|
| 9 | | Marco Buratti:
Some and BIBD Constructions.
Des. Codes Cryptography 16(2): 117-120 (1999) |
| 8 | | Marco Buratti:
Pairwise balanced designs from finite fields.
Discrete Mathematics 208-209: 103-117 (1999) |
| 7 | | Marco Buratti,
Fulvio Zuanni:
On Singular 1-Rotational Steiner 2-Designs.
J. Comb. Theory, Ser. A 86(2): 232-244 (1999) |
| 1997 |
|---|
| 6 | | Marco Buratti:
On Resolvable Difference Families.
Des. Codes Cryptography 11(1): 11-23 (1997) |
| 5 | | Marco Buratti:
From a (G, k, 1) to a (Ck + G, k, 1) Difference Family.
Des. Codes Cryptography 11(1): 5-9 (1997) |
| 4 | | Luigia Berardi,
Marco Buratti,
Stefano Innamorati:
4-blocked hadamard 3-designs.
Discrete Mathematics 174(1-3): 35-46 (1997) |
| 1996 |
|---|
| 3 | | Marco Buratti:
Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes.
Discrete Mathematics 161(1-3): 291-295 (1996) |
| 1995 |
|---|
| 2 | | Marco Buratti:
A Powerful Method for Constructing Difference Families and Optimal Optical Orthogonal Codes.
Des. Codes Cryptography 5(1): 13-25 (1995) |
| 1 | | Marco Buratti:
Constructions of (q, k, 1) difference families with q a prime power and k = 4, 5.
Discrete Mathematics 138(1-3): 169-175 (1995) |
Data released under the ODC-BY 1.0 license — See also our legal information page