Spremljaj
Tiziana Calamoneri
Tiziana Calamoneri
Full Professor, Dept. of Computer Science, Sapienza Univ. of Rome
Preverjeni e-poštni naslov na di.uniroma1.it - Domača stran
Naslov
Navedeno
Navedeno
Leto
The L (h, k)-labelling problem: an updated survey and annotated bibliography
T Calamoneri
The Computer Journal 54 (8), 1344-1371, 2011
2142011
The L (h, k)-labelling problem: A survey and annotated bibliography
T Calamoneri
The computer journal 49 (5), 585-608, 2006
1972006
Autonomous deployment of heterogeneous mobile sensors
N Bartolini, T Calamoneri, TF La Porta, S Silvestri
IEEE Transactions on Mobile Computing 10 (6), 753-766, 2010
1182010
L (h, 1)-labeling subclasses of planar graphs
T Calamoneri, R Petreschi
Journal of Parallel and Distributed Computing 64 (3), 414-426, 2004
832004
Push & pull: autonomous deployment of mobile sensors for a complete coverage
N Bartolini, T Calamoneri, EG Fusco, A Massini, S Silvestri
Wireless Networks 16, 607-625, 2010
692010
A tight layout of the butterfly network
A Avior, T Calamoneri, S Even, A Litman, AL Rosenberg
Proceedings of the eighth annual ACM symposium on Parallel Algorithms and …, 1996
691996
Snap and spread: A self-deployment algorithm for mobile sensor networks
N Bartolini, T Calamoneri, EG Fusco, A Massini, S Silvestri
Distributed Computing in Sensor Systems: 4th IEEE International Conference …, 2008
482008
Sensor activation and radius adaptation (SARA) in heterogeneous sensor networks
N Bartolini, T Calamoneri, T La Porta, C Petrioli, S Silvestri
ACM Transactions on Sensor Networks (TOSN) 8 (3), 1-34, 2012
442012
Labeling trees with a condition at distance two
T Calamoneri, A Pelc, R Petreschi
Discrete Mathematics 306 (14), 1534-1539, 2006
432006
Optimal L (h, k)-labeling of regular grids
T Calamoneri
Discrete Mathematics & Theoretical Computer Science 8, 2006
412006
Autonomous deployment of self-organizing mobile sensors for a complete coverage
N Bartolini, T Calamoneri, EG Fusco, A Massini, S Silvestri
international workshop on self-organizing systems, 194-205, 2008
382008
Pairwise compatibility graphs: A survey
T Calamoneri, B Sinaimeri
siam REVIEW 58 (3), 445-460, 2016
372016
On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
T Calamoneri, S Caminiti, R Petreschi, S Olariu
Networks: An International Journal 53 (1), 27-34, 2009
342009
3D straight-line grid drawing of 4-colorable graphs
T Calamoneri, A Sterbini
Information Processing Letters 63 (2), 97-102, 1997
341997
All graphs with at most seven vertices are pairwise compatibility graphs
T Calamoneri, D Frascaria, B Sinaimeri
The Computer Journal 56 (7), 882-886, 2013
312013
Exploring pairwise compatibility graphs
T Calamoneri, E Montefusco, R Petreschi, B Sinaimeri
Theoretical Computer Science 468, 23-36, 2013
312013
L(2,1)-labeling of planar graphs
T Calamoneri, R Petreschi
Proceedings of the 5th international workshop on Discrete algorithms and …, 2001
302001
Mobile sensor deployment in unknown fields
N Bartolini, T Calamoneri, T La Porta, S Silvestri
2010 Proceedings IEEE INFOCOM, 1-5, 2010
252010
Drawing 2-, 3- and 4-colorable graphs in O(n2) volume
T Calamoneri, A Sterbini
Graph Drawing: Symposium on Graph Drawing, GD'96 Berkeley, California, USA …, 1997
241997
On relaxing the constraints in pairwise compatibility graphs
T Calamoneri, R Petreschi, B Sinaimeri
WALCOM: Algorithms and Computation: 6th International Workshop, WALCOM 2012 …, 2012
222012
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20