Gaetano Quattrocchi

According to our database1, Gaetano Quattrocchi authored at least 41 papers between 1988 and 2014.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
G-designs without blocking sets, Note.
Ars Comb., 2014

2013
Minimum embedding of STSs into (<i>K</i><sub>3</sub>+<i>e</i>)(K3+e)-systems.
Discret. Math., 2013

2012
Exact embedding of two G-designs into a (G+e)-design.
Discret. Math., 2012

Grooming traffic to minimize load.
Discret. Math., 2012

2011
Grooming Traffic to Maximize Throughput in SONET Rings.
JOCN, 2011

2010
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4.
SIAM J. Discret. Math., 2010

2009
Minimum embedding of Steiner triple systems into (K<sub>4</sub>-e)-designs II.
Discret. Math., 2009

Embedding Steiner triple systems in hexagon triple systems.
Discret. Math., 2009

Embeddings of P<sub>3</sub>-designs into bowtie and almost bowtie systems.
Discret. Math., 2009

Minimum embedding of a P<sub>4</sub>-design into a balanced incomplete block design of index lambda.
Discret. Math., 2009

Embedding handcuffed designs into a maximum packing of the complete graph with 4-cycles.
Ars Comb., 2009

Resolvable decompositions of λK<sub>n</sub> into the union of two 2-paths.
Ars Comb., 2009

2008
Grooming for two-period optical networks.
Networks, 2008

Lower bounds for two-period grooming via linear programming duality.
Networks, 2008

On some colouring of 4-cycle systems with specified block colour patterns.
Discret. Math., 2008

Embedding balanced P<sub>3</sub>-designs into (balanced) P<sub>4</sub>-designs.
Discret. Math., 2008

Minimum embedding of Steiner triple systems into (K<sub>4</sub>-e)-designs I.
Discret. Math., 2008

2006
Partial S(k-1, k, v)'s inducing P<sub>k</sub>-decompositions of K<sub>v</sub>.
Australas. J Comb., 2006

2005
Embedding path designs into kite systems.
Discret. Math., 2005

2004
Partition of <i>C</i> <sub>4</sub>-Designs into Minimum and Maximum Number of <i>P</i> <sub>3</sub>-Designs.
Graphs Comb., 2004

Minimum embedding of balanced <i>P</i><sub>4</sub>-designs into 5-cycle systems.
Discret. Math., 2004

Colouring 4-cycle systems with equitably coloured blocks.
Discret. Math., 2004

On the chromatic index of path decompositions.
Discret. Math., 2004

2003
Embedding handcuffed designs in D-designs, where D is the triangle with attached edge.
Discret. Math., 2003

Resolving P(v, 3, λ) designs into regular P<sub>3</sub>-configurations.
Australas. J Comb., 2003

2002
Embedding path designs in 4-cycle systems.
Discret. Math., 2002

On nesting of <i>G</i>-decompositions of lambda<i>K</i><sub>v</sub> where <i>G</i> has four nonisolated vertices or les.
Discret. Math., 2002

The metamorphosis of lambda-fold K3, 3-designs into lambda-fold 6-cycle systems.
Ars Comb., 2002

2001
Colouring 4-cycle Systems with Specified Block Colour Patterns: the Case of Embedding P<sub>3</sub>-designs.
Electron. J. Comb., 2001

2000
Resolving Triple Systems into Regular Configurations.
Electron. J. Comb., 2000

1999
Embedding handcuffed designs with block size 2 or 3 in 4-cycle systems.
Discret. Math., 1999

Blocking sets in balanced path designs.
Australas. J Comb., 1999

1998
Spanning Sets and Scattering Sets in Handcuffed Designs of order v and block size 3.
Ars Comb., 1998

1997
On arcs in path designs of block size four.
Discret. Math., 1997

The fine structure of threefold directed triple systems.
Australas. J Comb., 1997

1996
Support Sizes of Directed Triple Systems.
J. Comb. Theory A, 1996

1995
Embeddings of simple maximum packings of triples with lambda even.
Discret. Math., 1995

1993
Repeated blocks in maximum packing of triples with index 2.
Discret. Math., 1993

Path designs P(v, 3, 1) and P(v, 4, 1) with ovals.
Australas. J Comb., 1993

1990
On the intersection of two S(3, 4, 2upsilon) having a same derived triple system.
Discret. Math., 1990

1988
The spectrum for three-times repeated blocks in a <i>S</i><sub>3</sub>(2, 3, <i>v</i>).
J. Comb. Theory A, 1988


  Loading...