Tiziana Calamoneri

2008
42	EE	Novella Bartolini, Tiziana Calamoneri, Emanuele G. Fusco, Annalisa Massini, Simone Silvestri: Push&Pull: autonomous deployment of mobile sensors for a complete coverage CoRR abs/0804.2191: (2008)
41	EE	Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri: Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms CoRR abs/0804.3902: (2008)
2007
40	EE	Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi: On the L(h, k)-Labeling of Co-comparability Graphs. ESCAPE 2007: 116-127
39	EE	Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri: Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks. OPODIS 2007: 247-259
38	EE	Tiziana Calamoneri, Emanuele G. Fusco, Anil M. Shende, Sunil M. Shende: Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers. SIROCCO 2007: 208-221
2006
37		Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano: Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings Springer 2006
36	EE	Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri: Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. SIROCCO 2006: 227-239
35	EE	Tiziana Calamoneri, Emanuele G. Fusco, Richard B. Tan, Paola Vocca: L(h, 1, 1)-Labeling of Outerplanar Graphs. SIROCCO 2006: 268-279
34	EE	Tiziana Calamoneri: The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography. Comput. J. 49(5): 585-608 (2006)
33	EE	Tiziana Calamoneri, Rossella Petreschi: lambda-Coloring matrogenic graphs. Discrete Applied Mathematics 154(17): 2445-2457 (2006)
32	EE	Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi: Labeling trees with a condition at distance two. Discrete Mathematics 306(14): 1534-1539 (2006)
31	EE	Tiziana Calamoneri: Optimal L(h, k)-Labeling of Regular Grids. Discrete Mathematics & Theoretical Computer Science 8(1): 141-158 (2006)
30	EE	Tiziana Calamoneri, Annalisa Massini: Nearly optimal three dimensional layout of hypercube networks. Networks 47(1): 1-8 (2006)
2005
29		Tiziana Calamoneri, Irene Finocchi, Rossella Petreschi: Graph Coloring with Distance Constraints. PDPTA 2005: 131-140
28	EE	Tiziana Calamoneri, Paola Vocca: On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract). SIROCCO 2005: 65-77
2004
27	EE	Tiziana Calamoneri, Annalisa Massini: Efficient algorithms for checking the equivalence of multistage interconnection networks. J. Parallel Distrib. Comput. 64(1): 135-150 (2004)
26	EE	Tiziana Calamoneri, Rossella Petreschi: L(h, 1)-labeling subclasses of planar graphs. J. Parallel Distrib. Comput. 64(3): 414-426 (2004)
2003
25	EE	Tiziana Calamoneri, Annalisa Massini: Nearly Optimal Three Dimensional Layout of Hypercube Networks. Graph Drawing 2003: 247-258
24	EE	Tiziana Calamoneri: Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks. ICTCS 2003: 163-173
23	EE	Tiziana Calamoneri, Miriam Di Ianni: Interval routing & layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Benes networks. J. Parallel Distrib. Comput. 63(11): 1017-1025 (2003)
22	EE	Tiziana Calamoneri, Annalisa Massini, Imrich Vrto: New results on edge-bandwidth. Theor. Comput. Sci. 307(3): 503-513 (2003)
2002
21	EE	Tiziana Calamoneri, Rossella Petreschi: On the Radiocoloring Problem. IWDC 2002: 118-127
20	EE	Tiziana Calamoneri, Rossella Petreschi: L(2, 1)-Coloring Matrogenic Graphs. LATIN 2002: 236-247
19	EE	Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi: On max cut in cubic graphs. Parallel Algorithms Appl. 17(3): 165-183 (2002)
2001
18	EE	Tiziana Calamoneri, Rossella Petreschi: L(2, 1)-labeling of planar graphs. DIAL-M 2001: 28-33
17		Tiziana Calamoneri, Rossella Petreschi: Edge-clique graphs and the l-coloring problem. J. Braz. Comp. Soc. 7(3): 38-47 (2001)
16	EE	Tiziana Calamoneri, Annalisa Massini: Optimal three-dimensional layout of interconnection networks. Theor. Comput. Sci. 255(1-2): 263-279 (2001)
2000
15	EE	Tiziana Calamoneri, Stephan Olariu, Rossella Petreschi: A Simple Parallel Algorithm to Draw Cubic Graphs. IEEE Trans. Parallel Distrib. Syst. 11(10): 1009-1018 (2000)
1999
14	EE	Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi: A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. ASIAN 1999: 27-36
13	EE	Tiziana Calamoneri, Annalisa Massini: An optimal layout of multigrid networks. Inf. Process. Lett. 72(3-4): 137-141 (1999)
12		Tiziana Calamoneri, Rossella Petreschi: Optimal Layout of Trivalent Cayley Interconnection Networks. Int. J. Found. Comput. Sci. 10(3): 277-288 (1999)
11	EE	Tiziana Calamoneri, Simone Jannelli, Rossella Petreschi: Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs. J. Graph Algorithms Appl. 3(2): (1999)
1998
10	EE	Tiziana Calamoneri, Miriam Di Ianni: Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees. Euro-Par 1998: 1029-1039
9		Tiziana Calamoneri, Rossella Petreschi: Orthogonally Drawing Cubic Graphs in Parallel. J. Parallel Distrib. Comput. 55(1): 94-108 (1998)
8	EE	Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg: A Tight Layout of the Butterfly Network. Theory Comput. Syst. 31(4): 475-488 (1998)
1997
7		Tiziana Calamoneri, Annalisa Massini: On Three-Dimensional Layout of Interconnection Networks. Graph Drawing 1997: 64-75
6	EE	Tiziana Calamoneri, Rossella Petreschi: A New 3D Representation of Trivalent Cayley Networks. Inf. Process. Lett. 61(5): 247-252 (1997)
5	EE	Tiziana Calamoneri, Andrea Sterbini: 3D Straight-Line Grid Drawing of 4-Colorable Graphs. Inf. Process. Lett. 63(2): 97-102 (1997)
1996
4		Tiziana Calamoneri, Andrea Sterbini: Drawing 2-, 3- and 4-colorable Graphs in O(n2) Volume. Graph Drawing 1996: 53-62
3		Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg: A Tight Layout of the Butterfly Network. SPAA 1996: 170-175
2		Paola Alimonti, Tiziana Calamoneri: Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. WG 1996: 2-16
1995
1		Tiziana Calamoneri, Rossella Petreschi: An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs. COCOON 1995: 31-40

Coauthor Index

1	Paola Alimonti	[2]
2	Aythan Avior	[3] [8]
3	Novella Bartolini	[42]
4	Saverio Caminiti	[40]
5	Andrea E. F. Clementi	[36] [39] [41]
6	Shimon Even	[3] [8]
7	Irene Finocchi	[14] [19] [29] [37]
8	Emanuele G. Fusco	[35] [38] [39] [42]
9	Miriam Di Ianni	[10] [23] [36]
10	Giuseppe F. Italiano	[37]
11	Simone Jannelli	[11]
12	Massimo Lauria	[36]
13	Ami Litman	[3] [8]
14	Yannis Manoussakis	[14] [19]
15	Annalisa Massini	[7] [13] [16] [22] [25] [27] [30] [42]
16	Angelo Monti	[36] [41]
17	Stephan Olariu	[15] [40]
18	Andrzej Pelc	[32]
19	Rossella Petreschi	[1] [6] [9] [11] [12] [14] [15] [17] [18] [19] [20] [21] [26] [29] [32] [33] [40]
20	Arnold L. Rosenberg	[3] [8]
21	Gianluca Rossi	[41]
22	Anil M. Shende	[38]
23	Sunil M. Shende	[38]
24	Riccardo Silvestri	[36] [39] [41]
25	Simone Silvestri	[42]
26	Andrea Sterbini	[4] [5]
27	Richard B. Tan	[35]
28	Paola Vocca	[28] [35]
29	Imrich Vrto	[22]

Colors in the list of coauthors