Publications
Copyrights of these manuscripts may belong to the publishers.
Preprints are intended for personal use only.
International Journals:
S. Caminiti, R. Petreschi.
Unified Parallel Encoding and Decoding Algorithms for DandelionLike Codes.
Journal of Parallel and Distributed Computing,
70(11):11191127, 2010.
S. Caminiti, E.G. Fusco, and R. Petreschi.
Bijective Linear Time Coding and Decoding for kTrees.
Theory of Computing Systems,
46(2):284–300, 2010.
T. Calamoneri, S. Caminiti, S. Olariu, and R. Petreschi.
On the L(h,k)Labeling CoComparability Graphs and CircularArc Graphs.
Networks,
53(1):2734, 2009.
T. Calamoneri, S. Caminiti, and R. Petreschi.
A General Approach to L(h,k)Label Interconnection Networks.
Journal of Computer Science and Technology,
23(4):652659, 2008.
S. Caminiti, I. Finocchi, and R. Petreschi.
On Coding Labeled Trees.
Theoretical Computer Science,
382(2):97108, 2007.
This paper appeared among the most downloaded papers of TCS
S. Caminiti, E.G. Fusco.
On the Number of Labeled karch Graphs.
Journal of Integer Sequences, 10(7), Article 07.7.5, 2007.
S. Caminiti, N. Deo, and P. Micikevičius.
Lineartime Algorithms for Encoding Trees as Sequences of Node
Labels. Congressus Numerantium, 183:6575, 2006.
T. Calamoneri, S. Caminiti, and G. Fertin.
New Bounds for the L(h,k)Number of Regular
Grids. In International Journal of Mobile
Network Design and Innovation, 1(2):92–101, 2006.
International Conferences:
S. Caminiti, I. Finocchi, and E.G. Fusco.
Local dependency dynamic programming in the presence of memory faults.
In Proceedings of the 28^{th} Symposium on Theoretical Aspects of Computer Science
(STACS'11), Dortmund , Germany, March 1012, LIPIcs 9, pages 4556, 2011.
S. Caminiti, R. Petreschi.
Parallel Algorithms for Encoding and Decoding Blob Code.
In Proceedings of Workshop on Algorithms and Computation
(WALCOM'10), Dhaka, Bangladesh, February 1012, LNCS 5942, pages 167178, 2010.
S. Caminiti, R. Petreschi.
Parallel Algorithms for DandelionLike Codes.
In Proceedings of the International Conference on Computational Science
(ICCS'09), Baton Rouge, Louisiana, USA, May 2527, LNCS 5544, pages 611620, 2009.
S. Caminiti, I. Finocchi, and R. Petreschi.
Engineering Tree Labeling Schemes: a Case Study on Least Common Ancestors.
In Proceedings of the 16^{th} Annual European Symposium on Algorithms
(ESA'08), Karlsruhe, Germany, September 1517, LNCS 5193,
pages 234245, 2008.
T. Calamoneri, S. Caminiti, S. Olariu, and R. Petreschi.
On the L(h,k)Labeling CoComparability Graphs. In
Proceedings of the IntErnational Symposium on Combinatorics,
Algorithms, Probabilistic and Experimental Methodologies
(ESCAPE'07), Hangzhou, China, 79 April, LNCS 4614,
pages 116127, 2007.
S. Caminiti, E.G. Fusco, and R. Petreschi.
A Bijective Code for kTrees with Linear Time Encoding
and Decoding. In Proceedings of the IntErnational Symposium on
Combinatorics, Algorithms, Probabilistic and Experimental
Methodologies (ESCAPE'07), Hangzhou, China, 79
April, LNCS 4614, pages 408420, 2007.
S. Caminiti, R. Petreschi.
String Coding of Trees with Locality and Heritability. In
Proceedings of the 11^{th} International Conference on
Computing and Combinatorics (COCOON'05), Kunming, Yunnan, China,
1619 August, LNCS 3595, pages 251–262, 2005.
T. Calamoneri, S. Caminiti, and R. Petreschi.
A General Approach to L(h,k)Label
Interconnection Networks (Extended Abstract). In Proceedings
of the 2^{nd} Brazilian Symposium on Graphs, Algorithms,
and Combinatorics (GRACO'05), Rio de Janeiro,
Brazil, 2729 April, ENDM 19, pages 211–217, 2005.
S. Caminiti, I. Finocchi, and R. Petreschi.
A Unified Approach to Coding Labeled Trees. In Proceedings of
the 6^{th} Latin American Symposium on Theoretical
Informatics (LATIN'04), Buenos Aires, Argentina,
58 April, LNCS 2976, pages 339–348, 2004.
PhD Thesis:
S. Caminiti.
On Coding Labeled Trees.
PhD thesis, Sapienza University of Rome. December 2007.
Reports:
S. Caminiti, R. Petreschi.
Optimal Algorithms for Chen Code.
Technical Report TR022009, Department of Computer Science,
Sapienza University of Rome, March 2009.
T. Calamoneri, S. Caminiti, and G. Fertin.
New Bounds for the L(h,k)Number of Regular Grids.
Research Report RRLINA05.04, LINA, Université de Nantes, June
2005.
Abstracts:
S. Caminiti, R. Petreschi.
Algorithmic Aspects of Bijective Tree Encoding: a Survey.
3^{rd} Annual Meeting of the Asian Association for Algorithms and Computation (AAAC'10)
Pohang, Korea, 17–19 April, 2010.
S. Caminiti, I. Finocchi, and R. Petreschi.
Informative Labeling Schemes for Least Common Ancestor Problem.
Italian Conference on Theoretical Computer Science (ICTCS'09),
Cremona, Italy, 28–30 September 2009.
S. Caminiti, E.G. Fusco, and R. Petreschi.
On Bijective kTrees Encoding.
International Combinatorics, Geometry and Computer Science Conference (CGCS'07),
Marseille, France, 24 May, 2007.
S. Caminiti.
Combinatorial Mappings between Labelled Trees and Strings.
Bristol Algorithm Days (BAD'07), Bristol, England, 1820
February, 2007.
S. Caminiti, N. Deo, and P. Micikevičius.
Lineartime Algorithms for Encoding Trees as Sequences of Node
Labels (Abstract). In 37^{th} Southeastern
International Conference on Combinatorics, Graph Theory, and
Computing, Boca Raton, FL, USA, 610 March, 2006.
Laurea Thesis (in Italian):
S. Caminiti.
Sulla Rappresentazione di Alberi Tramite Stringhe.
Relatore Prof.^{ssa} Rossella Petreschi, Correlatore Dott.^{ssa} Irene Finocchi.
Corso di Laurea in Informatica,
Facoltà di Scienze Matematiche Fisiche e Naturali,
Università degli Studi di Roma "La Sapienza".
Maggio 2003. Valutazione 110/110 e Lode.
