Marco Buratti

According to our database1, Marco Buratti authored at least 47 papers between 1995 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Designs over finite fields by difference methods.
Finite Fields Their Appl., 2019

Fano Kaleidoscopes and their generalizations.
Des. Codes Cryptogr., 2019

Partitioned difference families versus zero-difference balanced functions.
Des. Codes Cryptogr., 2019

On disjoint (v, k, k-1) difference families.
Des. Codes Cryptogr., 2019

Hadamard partitioned difference families and their descendants.
Cryptogr. Commun., 2019

2018
Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems.
Ars Math. Contemp., 2018

On silver and golden optical orthogonal codes.
Art Discret. Appl. Math., 2018

2017
3-pyramidal Steiner triple systems.
Ars Math. Contemp., 2017

2016
A Cyclic Solution for an Infinite Class of Hamilton-Waterloo Problems.
Graphs Comb., 2016

2015
The Structure of 2-Pyramidal 2-Factorizations.
Graphs Comb., 2015

On the Full Automorphism Group of a Hamiltonian Cycle System of Odd Order.
Graphs Comb., 2015

2013
A collection of results on Hamiltonian cycle systems with a nice automorphism group.
Electron. Notes Discret. Math., 2013

New designs by changing ... the signs.
Electron. Notes Discret. Math., 2013

On optimal (v, 5, 2, 1) optical orthogonal codes.
Des. Codes Cryptogr., 2013

2012
Some progress on the existence of 1-rotational Steiner triple systems.
Des. Codes Cryptogr., 2012

2011
Relative Difference Families With Variable Block Sizes and Their Related OOCs.
IEEE Trans. Inf. Theory, 2011

New results on optimal (<i>v</i>, 4, 2, 1) optical orthogonal codes.
Des. Codes Cryptogr., 2011

2010
Cyclic Hamiltonian cycle systems of the lambda-fold complete and cocktail party graphs.
Eur. J. Comb., 2010

Further progress on difference families with block size 4 or 5.
Des. Codes Cryptogr., 2010

From a 1-Rotational RBIBD to a Partitioned Difference Family.
Electron. J. Comb., 2010

2009
Bounds and Constructions of Optimal (n, 4, 2, 1) Optical Orthogonal Codes.
IEEE Trans. Inf. Theory, 2009

Combinatorial designs and the theorem of Weil on multiplicative character sums.
Finite Fields Their Appl., 2009

A non-existence result on cyclic cycle-decompositions of the cocktail party graph.
Discret. Math., 2009

2005
On sharply vertex transitive 2-factorizations of the complete graph.
J. Comb. Theory, Ser. A, 2005

Some constructions for cyclic perfect cycle systems.
Discret. Math., 2005

2004
Some progress on (v, 4, 1) difference families and optical orthogonal codes.
J. Comb. Theory, Ser. A, 2004

Existence of 1-Rotational <i>k</i>-Cycle Systems of the Complete Graph.
Graphs Comb., 2004

Cyclic Hamiltonian cycle systems of the complete graph.
Discret. Math., 2004

2003
Existence of cyclic k-cycle systems of the complete graph.
Discret. Math., 2003

2002
Cyclic Designs with Block Size 4 and Related Optimal Optical Orthogonal Codes.
Des. Codes Cryptogr., 2002

2001
Abelian 1-Factorizations of the Complete Graph.
Eur. J. Comb., 2001

Some observations on three classical BIBD constructions.
Discret. Math., 2001

Perfect Cayley Designs as Generalizations of Perfect Mendelsohn Designs.
Des. Codes Cryptogr., 2001

Lower and upper chromatic numbers for BSTSs(2<sup>h</sup> - 1).
Comput. Sci. J. Moldova, 2001

2000
Two New Classes of Difference Families.
J. Comb. Theory, Ser. A, 2000

Existence of Z-Cyclic Triplewhist Tournaments for a Prime Number of Players.
J. Comb. Theory, Ser. A, 2000

Some Regular Steiner 2-Designs with Block Size 4.
Ars Comb., 2000

1999
On Singular 1-Rotational Steiner 2-Designs.
J. Comb. Theory, Ser. A, 1999

Pairwise balanced designs from finite fields.
Discret. Math., 1999

Some and BIBD Constructions.
Des. Codes Cryptogr., 1999

1998
Some constructions for 1-rotational BIBD's with block size 5.
Australas. J Comb., 1998

1997
4-blocked hadamard 3-designs.
Discret. Math., 1997

On Resolvable Difference Families.
Des. Codes Cryptogr., 1997

From a (G, k, 1) to a (C<sub>k</sub> + G, k, 1) Difference Family.
Des. Codes Cryptogr., 1997

1996
Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes.
Discret. Math., 1996

1995
Constructions of (q, k, 1) difference families with q a prime power and k = 4, 5.
Discret. Math., 1995

A Powerful Method for Constructing Difference Families and Optimal Optical Orthogonal Codes.
Des. Codes Cryptogr., 1995


  Loading...