- On Three-Dimensional Layout of Interconnection Networks
- Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks
- Variable density deployment and topology control for the solution of the sink-hole problem
- OPTIMALLY EXTENDING BISTANDARD GRAPHS ON THE ORTHOGONAL GRID
- University of Rome "Sapienza", Computer Science Department,
- International Journal of Foundations of Computer Science World Scienti c Publishing Company
- Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks
- Maximizing the Number of Broadcast Operations in Random Geometric Ad-Hoc Wireless Networks
- ARTICLE IN PRESS Discrete Mathematics ( )
- The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography
- Does Cubicity Help to Solve Problems? T. Calamoneri
- L(2, 1)-Labeling of Unigraphs (Extended Abstract)
- L(2, 1)-Labeling of Unigraphs Tiziana Calamoneri Rossella Petreschi
- Recognition of Unigraphs through Superposition (Extended Abstract)
- A General Approach to L(h, k)-Label Interconnection networks
- Calamoneri T, Caminiti S, Petreschi R. A general approach to L(h, k)-label interconnection networks. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 23(4): 652659 July 2008
- Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks and Other Regular
- -Coloring Matrogenic Graphs Tiziana Calamoneri Rossella Petreschi
- L(2, 1)-Labeling of Oriented Planar Graphs (Extended Abstract)
- Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms
- Proxy Assignments for Filling Gaps in Wireless Ad-hoc Lattice Computers
- On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs
- Minimum-Energy Broadcast and Disk Cover in Grid Wireless Networks
- A Simple Parallel Algorithm to Draw Cubic Graphs Tiziana Calamoneri y Stephan Olariu z Rossella Petreschi y
- On the Radiocoloring Problem Tiziana Calamoneri and Rossella Petreschi
- Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh
- On the L(h, k)-Labeling of Co-Comparability Tiziana Calamoneri1
- Labeling trees with a condition at distance two Tiziana Calamoneri
- A New Approach to the Rearrangeability of (2 log N 1) Stage MINs Tiziana Calamoneri Annalisa Massini
- -Coloring of Regular Tiling (Extended Abstract)
- L(2; 1)-Coloring Matrogenic Graphs (Extended Abstract)
- L(h,1) -Labeling Subclasses of Planar Graphs Tiziana Calamoneri Rossella Petreschi
- Parallel and Distributed Computing and Systems November 3-6, 1999 in Cambridge Massachusetts, USA
- L(h,1,1)-Labeling of Outerplanar Graphs Tiziana Calamoneri a
- An Optimal Layout of Multigrid Networks Tiziana Calamoneri 1 and Annalisa Massini
- A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
- Noname manuscript No. (will be inserted by the editor)
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 11 Optimal L(h, k)-Labeling of Regular Grids
- Nearly Optimal Three Dimensional Layout of Hypercube Networks
- Efficient Algorithms for Checking the Equivalence of Multistage Interconnection Networks
- Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 0, no. 0, pp. 00 (0)
- New Results on Edge-Bandwidth Tiziana Calamoneri and Annalisa Massini
- On the L(h, k)-Labeling of Co-Comparability Graphs and Circular-Arc Graphs
- Optimal Three-Dimensional Layout of Interconnection Networks
- A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
- Journal of Graph Algorithms and Applications http://www.cs.brown.edu/publications/jgaa/
- A New 3D Representation of Trivalent Cayley Networks Tiziana Calamoneri and Rossella Petreschi
- Autonomous deployment of heterogeneous mobile N. Bartolini, T. Calamoneri
- Impact of Information on the Complexity of Asynchronous Radio Broadcasting
- Nearly Optimal Three Dimensional Layout of Hypercube Networks
- Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks
- Sensor Activation and Radius Adaptation (SARA) in Heterogeneous Sensor Networks
