Tiziana Calamoneri - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Autonomous Deployment of Heterogeneous Mobile SensorsNovella Bartolini, Tiziana Calamoneri, Thomas F. La Porta, Simone Silvestri. tmc, 10(6):753-766, 2011. [doi]

On Adaptive Density Deployment to Mitigate the Sink-Hole Problem in Mobile Sensor NetworksNovella Bartolini, Tiziana Calamoneri, Annalisa Massini, Simone Silvestri. monet, 16(1):134-145, 2011. [doi]

EditorialTiziana Calamoneri, Josep Díaz. jda, 9(3):213, 2011. [doi]

::::L::::(2, 1)-Labeling of Unigraphs - (Extended Abstract)Tiziana Calamoneri, Rossella Petreschi. tapas 2011: 57-68 [doi]

The L(2, 1)-labeling of unigraphsTiziana Calamoneri, Rossella Petreschi. DAM, 159(12):1196-1206, 2011. [doi]

Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless NetworksTiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri. tpds, 22(2):208-216, 2011. [doi]

The ::::L::::(::::h::::, ::::k::::)-Labelling Problem: An Updated Survey and Annotated BibliographyTiziana Calamoneri. cj, 54(8):1344-1371, 2011. [doi]

2010

Mobile Sensor Deployment in Unknown FieldsNovella Bartolini, Tiziana Calamoneri, Thomas F. La Porta, Simone Silvestri. infocom 2010: 471-475 [doi]

Push & Pull: autonomous deployment of mobile sensors for a complete coverageNovella Bartolini, Tiziana Calamoneri, Emanuele G. Fusco, Annalisa Massini, Simone Silvestri. winet, 16(3):607-625, 2010. [doi]

Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. ProceedingsTiziana Calamoneri, Josep Díaz, editors, Volume 6078 of Lecture Notes in Computer Science, Springer, 2010. [doi]

2009

Autonomous deployment of heterogeneous mobile sensorsNovella Bartolini, Tiziana Calamoneri, Tom La Porta, Annalisa Massini, Simone Silvestri. icnp 2009: 42-51 [doi]

Variable Density Deployment and Topology Control for the Solution of the Sink-Hole ProblemNovella Bartolini, Tiziana Calamoneri, Annalisa Massini, Simone Silvestri. qshine 2009: 167-182 [doi]

Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi. walcom 2009: 165-176 [doi]

Antibandwidth of complete k-ary treesTiziana Calamoneri, Annalisa Massini, L ubomír Török, Imrich Vrto. DM, 309(22):6408-6414, 2009. [doi]

On the ::::L::::(::::h::::, ::::k::::)-labeling of co-comparability graphs and circular-arc graphsTiziana Calamoneri, Saverio Caminiti, Rossella Petreschi, Stephan Olariu. networks, 53(1):27-34, 2009. [doi]

2008

Snap and Spread: A Self-deployment Algorithm for Mobile Sensor NetworksNovella Bartolini, Tiziana Calamoneri, Emanuele G. Fusco, Annalisa Massini, Simone Silvestri. dcoss 2008: 451-456 [doi]

Autonomous Deployment of Self-Organizing Mobile Sensors for a Complete CoverageNovella Bartolini, Tiziana Calamoneri, Emanuele G. Fusco, Annalisa Massini, Simone Silvestri. iwsos 2008: 194-205 [doi]

Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithmsTiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri. mswim 2008: 354-361 [doi]

Impact of Information on the Complexity of Asynchronous Radio BroadcastingTiziana Calamoneri, Emanuele G. Fusco, Andrzej Pelc. opodis 2008: 311-330 [doi]

A General Approach to ::::L:::: ( ::::h, k:::: )-Label Interconnection NetworksTiziana Calamoneri, Saverio Caminiti, Rossella Petreschi. jcst, 23(4):652-659, 2008. [doi]

Minimum-Energy Broadcast and disk cover in grid wireless networksTiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri. TCS, 399(1-2):38-53, 2008. [doi]

2007

2006

Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, ProceedingsTiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano, editors, Volume 3998 of Lecture Notes in Computer Science, Springer, 2006.

Minimum Energy Broadcast and Disk Cover in Grid Wireless NetworksTiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri. sirocco 2006: 227-239 [doi]

Labeling trees with a condition at distance twoTiziana Calamoneri, Andrzej Pelc, Rossella Petreschi. DM, 306(14):1534-1539, 2006. [doi]

Optimal L(h, k)-Labeling of Regular GridsTiziana Calamoneri. dmtcs, 8(1):141-158, 2006. [doi]

Nearly optimal three dimensional layout of hypercube networksTiziana Calamoneri, Annalisa Massini. networks, 47(1):1-8, 2006. [doi]

The ::::L::::(::::h, k::::)-Labelling Problem: A Survey and Annotated BibliographyTiziana Calamoneri. cj, 49(5):585-608, 2006. [doi]

Antibandwidth of Complete k-Ary TreesTiziana Calamoneri, Annalisa Massini, Lubomir Torok, Imrich Vrto. endm, 24:259-266, 2006. [doi]

L(h, 1, 1)-Labeling of Outerplanar GraphsTiziana Calamoneri, Emanuele G. Fusco, Richard B. Tan, Paola Vocca. sirocco 2006: 268-279 [doi]

lambda-Coloring matrogenic graphsTiziana Calamoneri, Rossella Petreschi. DAM, 154(17):2445-2457, 2006. [doi]

2005

A general approach to L(h, k)-label interconnection networksTiziana Calamoneri, Saverio Caminiti, Rossella Petreschi. endm, 19:211-217, 2005. [doi]

On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract)Tiziana Calamoneri, Paola Vocca. sirocco 2005: 65-77 [doi]

Graph Coloring with Distance ConstraintsTiziana Calamoneri, Irene Finocchi, Rossella Petreschi. pdpta 2005: 131-140

2004

Efficient algorithms for checking the equivalence of multistage interconnection networksTiziana Calamoneri, Annalisa Massini. jpdc, 64(1):135-150, 2004. [doi]

L(h, 1)-labeling subclasses of planar graphsTiziana Calamoneri, Rossella Petreschi. jpdc, 64(3):414-426, 2004. [doi]

2003

2002

On the Radiocoloring ProblemTiziana Calamoneri, Rossella Petreschi. iwdc 2002: 118-127 [doi]

L(2, 1)-Coloring Matrogenic GraphsTiziana Calamoneri, Rossella Petreschi. latin 2002: 236-247 [doi]

On max cut in cubic graphsTiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi. paapp, 17(3):165-183, 2002. [doi]

2001

LD-Coloring of Regular Tiling (Extended Abstract)Tiziana Calamoneri, Rossella Petreschi. endm, 8:18-21, 2001. [doi]

Optimal three-dimensional layout of interconnection networksTiziana Calamoneri, Annalisa Massini. TCS, 255(1-2):263-279, 2001. [doi]

L(2, 1)-labeling of planar graphsTiziana Calamoneri, Rossella Petreschi. dialm 2001: 28-33 [doi]

Edge-clique graphs and the l-coloring problemTiziana Calamoneri, Rossella Petreschi. jbcs, 7(3):38-47, 2001.

2000

A Simple Parallel Algorithm to Draw Cubic GraphsTiziana Calamoneri, Stephan Olariu, Rossella Petreschi. tpds, 11(10):1009-1018, 2000. [doi]

1999

1998

A Tight Layout of the Butterfly NetworkAythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg. mst, 31(4):475-488, 1998. [doi]

Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat TreesTiziana Calamoneri, Miriam Di Ianni. europar 1998: 1029-1039 [doi]

Orthogonally Drawing Cubic Graphs in ParallelTiziana Calamoneri, Rossella Petreschi. jpdc, 55(1):94-108, 1998.

1997

A New 3D Representation of Trivalent Cayley NetworksTiziana Calamoneri, Rossella Petreschi. ipl, 61(5):247-252, 1997. [doi]

On Three-Dimensional Layout of Interconnection NetworksTiziana Calamoneri, Annalisa Massini. gd 1997: 64-75

3D Straight-Line Grid Drawing of 4-Colorable GraphsTiziana Calamoneri, Andrea Sterbini. ipl, 63(2):97-102, 1997. [doi]

1996

Improved Approximations of Independent Dominating Set in Bounded Degree GraphsPaola Alimonti, Tiziana Calamoneri. criwg 1997: 2-16

A Tight Layout of the Butterfly NetworkAythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg. spaa 1996: 170-175

Drawing 2-, 3- and 4-colorable Graphs in ::::O::::(::::n:::::::2:::) VolumeTiziana Calamoneri, Andrea Sterbini. gd 1997: 53-62

1995

An Efficient Orthogonal Grid Drawing Algorithm For Cubic GraphsTiziana Calamoneri, Rossella Petreschi. cocoon 1995: 31-40