| 2009 | ||
|---|---|---|
| 55 | Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi: Recognition of Unigraphs through Superposition of Graphs (Extended Abstract). WALCOM 2009: 165-176 | |
| 54 | Tiziana Calamoneri: The L(2, 1)-Labeling Problem on Oriented Regular Grids CoRR abs/0905.1780: (2009) | |
| 53 | Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi, Stephan Olariu: On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs. Networks 53(1): 27-34 (2009) | |
| 2008 | ||
| 52 | Novella Bartolini, Tiziana Calamoneri, Emanuele G. Fusco, Annalisa Massini, Simone Silvestri: Snap and Spread: A Self-deployment Algorithm for Mobile Sensor Networks. DCOSS 2008: 451-456 | |
| 51 | Novella Bartolini, Tiziana Calamoneri, Emanuele G. Fusco, Annalisa Massini, Simone Silvestri: Autonomous Deployment of Self-Organizing Mobile Sensors for a Complete Coverage. IWSOS 2008: 194-205 | |
| 50 | 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. MSWiM 2008: 354-361 | |
| 49 | Tiziana Calamoneri, Emanuele G. Fusco, Andrzej Pelc: Impact of Information on the Complexity of Asynchronous Radio Broadcasting. OPODIS 2008: 311-330 | |
| 48 | 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) | |
| 47 | 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) | |
| 46 | Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi: A General Approach to L ( h, k )-Label Interconnection Networks. J. Comput. Sci. Technol. 23(4): 652-659 (2008) | |
| 45 | 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. Theor. Comput. Sci. 399(1-2): 38-53 (2008) | |
| 2007 | ||
| 44 | Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi: On the L(h, k)-Labeling of Co-comparability Graphs. ESCAPE 2007: 116-127 | |
| 43 | 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 | |
| 42 | 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 | ||
| 41 | Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano: Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings Springer 2006 | |
| 40 | 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 | |
| 39 | Tiziana Calamoneri, Emanuele G. Fusco, Richard B. Tan, Paola Vocca: L(h, 1, 1)-Labeling of Outerplanar Graphs. SIROCCO 2006: 268-279 | |
| 38 | Tiziana Calamoneri: The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography. Comput. J. 49(5): 585-608 (2006) | |
| 37 | Tiziana Calamoneri, Rossella Petreschi: lambda-Coloring matrogenic graphs. Discrete Applied Mathematics 154(17): 2445-2457 (2006) | |
| 36 | Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi: Labeling trees with a condition at distance two. Discrete Mathematics 306(14): 1534-1539 (2006) | |
| 35 | Tiziana Calamoneri: Optimal L(h, k)-Labeling of Regular Grids. Discrete Mathematics & Theoretical Computer Science 8(1): 141-158 (2006) | |
| 34 | Tiziana Calamoneri, Annalisa Massini, Lubomir Torok, Imrich Vrto: Antibandwidth of Complete k-Ary Trees. Electronic Notes in Discrete Mathematics 24: 259-266 (2006) | |
| 33 | Tiziana Calamoneri, Annalisa Massini: Nearly optimal three dimensional layout of hypercube networks. Networks 47(1): 1-8 (2006) | |
| 2005 | ||
| 32 | Tiziana Calamoneri, Irene Finocchi, Rossella Petreschi: Graph Coloring with Distance Constraints. PDPTA 2005: 131-140 | |
| 31 | Tiziana Calamoneri, Paola Vocca: On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract). SIROCCO 2005: 65-77 | |
| 30 | Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi: A general approach to L(h, k)-label interconnection networks. Electronic Notes in Discrete Mathematics 19: 211-217 (2005) | |
| 2004 | ||
| 29 | Tiziana Calamoneri, Annalisa Massini: Efficient algorithms for checking the equivalence of multistage interconnection networks. J. Parallel Distrib. Comput. 64(1): 135-150 (2004) | |
| 28 | Tiziana Calamoneri, Rossella Petreschi: L(h, 1)-labeling subclasses of planar graphs. J. Parallel Distrib. Comput. 64(3): 414-426 (2004) | |
| 2003 | ||
| 27 | Tiziana Calamoneri, Annalisa Massini: Nearly Optimal Three Dimensional Layout of Hypercube Networks. Graph Drawing 2003: 247-258 | |
| 26 | Tiziana Calamoneri: Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks. ICTCS 2003: 163-173 | |
| 25 | Tiziana Calamoneri, Rossella Petreschi, Andrzej Pelc: Labeling trees with a condition at distance two. Electronic Notes in Discrete Mathematics 15: 55-58 (2003) | |
| 24 | 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) | |
| 23 | Tiziana Calamoneri, Annalisa Massini, Imrich Vrto: New results on edge-bandwidth. Theor. Comput. Sci. 307(3): 503-513 (2003) | |
| 2002 | ||
| 22 | Tiziana Calamoneri, Rossella Petreschi: On the Radiocoloring Problem. IWDC 2002: 118-127 | |
| 21 | Tiziana Calamoneri, Rossella Petreschi: L(2, 1)-Coloring Matrogenic Graphs. LATIN 2002: 236-247 | |
| 20 | Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi: On max cut in cubic graphs. Parallel Algorithms Appl. 17(3): 165-183 (2002) | |
| 2001 | ||
| 19 | Tiziana Calamoneri, Rossella Petreschi: L(2, 1)-labeling of planar graphs. DIAL-M 2001: 28-33 | |
| 18 | Tiziana Calamoneri, Rossella Petreschi: LD-Coloring of Regular Tiling (Extended Abstract). Electronic Notes in Discrete Mathematics 8: 18-21 (2001) | |
| 17 | Tiziana Calamoneri, Rossella Petreschi: Edge-clique graphs and the l-coloring problem. J. Braz. Comp. Soc. 7(3): 38-47 (2001) | |
| 16 | Tiziana Calamoneri, Annalisa Massini: Optimal three-dimensional layout of interconnection networks. Theor. Comput. Sci. 255(1-2): 263-279 (2001) | |
| 2000 | ||
| 15 | 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 | 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 | 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 | Tiziana Calamoneri, Simone Jannelli, Rossella Petreschi: Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs. J. Graph Algorithms Appl. 3(2): (1999) | |
| 1998 | ||
| 10 | 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 | 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 | Tiziana Calamoneri, Rossella Petreschi: A New 3D Representation of Trivalent Cayley Networks. Inf. Process. Lett. 61(5): 247-252 (1997) | |
| 5 | 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 | |