Publications by Andrea Vietri:
     
Papers:
An inductive proof of a known result about \phi(x)
(Am. Math. Monthly, vol. 109, 2002, pp. 390-391)
Combinatorial aspects of Total Weight Orders over
monomials of fixed degree
(Order, vol. 19, 2002, pp. 239-263)
Cyclic k-Cycle Systems of
order 2kn+k; a solution of the last open cases
(J. Comb. Des., vol. 12, 2004, pp. 299-310)
The complexity of arc-colorings for directed hypergraphs
(Discr. Appl. Math., vol. 143, 2004, pp. 266-271)
Chromatic number of regular walls
(Ars Comb., vol. 76, 2005, pp. 97-111)
On the posets (W_2^k,<) and their connections with some homogeneous inequalities of degree 2  (Order,
vol. 22, 2005, pp. 201-221)
Graceful labellings for an infinite class of Generalised Petersen Graphs (Ars Comb., vol. 81, 2006, pp. 247-255)
NOTE:
a very little emendation to the above paper, by the same author, has appeared in the same journal: Ars Comb., vol. 83, 2007, p. 381
Difference families in Z_2d+1 x Z_2d+1 and infinite translation designs in Z x Z (Graphs and
Comb., vol. 23, 2007, pp. 111-121)
On certain 2-rotational cycle systems of complete graphs (Austral.
J. Comb., vol. 37, 2007, pp. 73-79)
Nice lists of differences, and their connections with algebraic properties of unitary polynomials (Austral.
J. Comb., vol. 37, 2007, pp. 171-185)
Coloring walls may help to make good schedules (Ars Comb., vol. 84, 2007, pp. 205-215)
A combinatorial approach to the phonetic similarity of languages - with D.A. Gewurz
(Mathém. et Sc. Humaines, vol. 179, 2007, pp. 21-44)
Sailing towards, and then against, The Graceful Tree Conjecture: some promiscuous results (I.C.A.
Bull., vol.53, 2008, pp. 31-46)
A new infinite family of graceful generalised Petersen graphs, via “graceful collages” again
(Austral. J. Comb. vol.41, 2008, pp. 273-282)
Necessary conditions on graceful labels: a study case on trees and other examples (Utilitas Math., to appear).
     
Proceedings:
Arc-Coloring of Directed Hypergraphs and Brick-Coloring of Walls (IEEE
Proc. IV04, London, 2004, pp. 394-399)
The complexity of arc-colorings for directed hypergraphs   (Proc. CTW04, Electr. N. Discr. Math., vol. 17, 2004, pp. 281-284)
A graph-theoretic framework for semantic relatedness   (XI-th International Conference CML, Constantza, Romania. Text Processing and Cognitive Technologies, coll. 17, Kazan, 2010, pp. 181-192).
     
Textbooks:
Itinerario di geometria e algebra lineare (ed. CISU, 2010)
(for publications of a different kind - poems, novels - look up ENEA TRIVARDI - pseudonym and anagram - on the web.
Something here)