Home|
MY PAPERS
|
|
This is a list of publications (co)authored by myself. Papers are roughly in order of conception, most recent first. For each paper you can access a plain-text abstract and, for most of them, either the ps or the pdf file. |
|
|
|
T. Calamoneri, E. Moggi eds.: Special issue on selected papers from the 12th Italian Conference on Theoretical Computer Science, RAIRO Theoretical Informatics and Applications - Informatique Theoretique et Applications, 2011, to appear. |
|
|
T. Calamoneri, J. Diaz eds., Special issue on selected papers from the 7th Conference on Algorithms and Complexity, Journal of Discrete Algorithms, 9(3), 2011. Editorial |
|
|
T. Calamoneri, J. Diaz eds.: "Algorithms and Complexity", Proceedings of the 7th Conference on Algorithms and Complex ity, Lecture Notes in Computer Science 6078, SpringerVerlag, 2010. |
|
|
T. Calamoneri, I. Finocchi eds.: Special issue in honor of the 60th birthdate of Rossella Petreschi, Networks , 2010, to appear. |
|
|
T. Calamoneri, I. Finocchi, G. Italiano eds.: "Algorithms and Complexity", Proceedings of the 6th Conference on Algorithms and Complexity, Lecture Notes in Computer Science 3998, SpringerVerlag, 2006. |
|
|
T. Calamoneri ed., Special issue on selected papers from the 1st Workshop on Frequency Assignment Problems, International Journal of Mobile Network Design and Innovation 1(2), 2006. |
|
Publications on International Reviews |
|
|
N. Bartolini, T. Calamoneri, T. La Porta, C. Petrioli, S. Silvestri, "Sensor Activation and Radius Adaptation (SARA) in Heterogeneous Sensor Networks", IEEE Transactions on Sensor Networks, to appear, 2011. |
|
|
T. Calamoneri, "The L(2, 1)-Labeling Problem on Oriented Regular Grids ", the Computer Journal , bxr045 first published online May 10, 2011 doi:10.1093/comjnl/bxr045. |
|
|
T. Calamoneri, "The L(h,k)-Labelling problem: An updated Survey and Annotated Bibliography", the Computer Journal, 54(8), pp. 1344-1371, 2011. |
|
|
T. Calamoneri, R. Petreschi, "The L(2, 1)-Labeling of Unigraphs", Discrete Applied Mathematics , 159(12), pp. 1196-1206, 2011. |
|
|
A. Borri, T. Calamoneri, R. Petreschi, "Recognition of Unigraphs through superposition of graphs", Journal of Graph Algorithms and Applications, 15(3), pp. 323-343, 2011. |
|
|
N: Bartolini, T. Calamoneri, T. La Porta, A. Massini, S. Silvestri, "Autonomous deployment of heterogeneous mobile sensors", IEEE Transactions on Mobile Computing , 10(6), pp. 753-766 , 2011. |
|
|
N. Bartolini, T. Calamoneri, T. La Porta, A. Massini, S. Silvestri, "On adaptive density deployment to mitigate the sink-hole problem in mobile sensor networks", ACM/Springer Mobile Networks and Applications (MONET), 16(1), 134-145, 2011. |
|
|
T. Calamoneri, A. Clementi, E. Fusco, R. Silvestri, " Maximizing the number of broadcast operations in static random geometric ad-hoc networks ", IEEE Transactions on Parallel and Distributed Systems , 22(2), p. 208-216, 2011. |
|
|
N. Bartolini, T. Calamoneri, E.G. Fusco, A. Massini, S. Silvestri, "Push & Pull: autonomous deployment of mobile sensors for a complete coverage ", Wireless Networks, 16(3), p. 607-625, 2010. |
|
|
T. Calamoneri, A. Massini. L. Torok, I. Vrto, "Antibandwidth of Complete k-ary Trees ", Discrete Mathematics , 309(22), p. 6408-6414, 2010. |
|
|
T. Calamoneri, S. Caminiti, S. Olariu, R. Petreschi, "On the L(h,k)-Labeling of Co-Comparability Graphs ", Networks, 53(1); p. 27-34, 2009. |
|
|
T. Calamoneri, E. Fusco, R.B. Tan, P. Vocca, "L(h,1,1)-Labeling of Outerplanar Graphs", Mathematical Methods of Operations Research , 69(2); p. 307-321, 2009. |
|
|
T. Calamoneri, S. Caminiti, R. Petreschi, "A General Approach to L(h,k)-Label Interconnection Networks", Journal of Computer Science and Technology, 23(4); p. 652-659, 2008. |
|
|
T. Calamoneri, A.F. Clementi, M. Di Ianni, M. Lauria, A. Monti, R. Silvestri, "Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks ", Theoretical Computer Science , 399 (1); p. 38-53, 2008. |
|
|
T. Calamoneri, "Optimal L(h, k)-Labeling of Regular Grids", Discrete Mathematics & Theoretical Computer Science, 8, pp. 141-158, 2006. |
|
|
T. Calamoneri, "The L(h,k)-Labelling Problem: A Survey and Annotated Bibliography", The Computer Journal, 49(5), pp. 585-608, 2006. |
|
|
T. Calamoneri, S. Caminiti, G. Fertin, "Exact Solution of a Class of Frequency Assignment Problems in Regular Grids", International Journal of Mobile Network Design and Innovation , 1(2), pp. 92-101, 2006. |
|
|
T. Calamoneri, R. Petreschi, "Lambda-Coloring Matrogenic Graphs", Discrete Applied Mathematics, 154(17), pp. 2445-2457, 2006. |
|
|
T. Calamoneri, A. Massini, "Nearly Optimal Three Dimensional Layout of Hypercube Networks", Networks , 47(1), pp. 1-8, 2006. |
|
|
T. Calamoneri, A. Pelc, R. Petreschi, "Labeling trees with a condition at distance two", Discrete Mathematics, 306(14), pp. 1534-1539, 2006. |
|
|
T. Calamoneri, R. Petreschi, "L(h,1)-Labeling Subclasses of Planar Graphs", Journal on Parallel and Distributed Computing, 64(3), pp. 414-426, 2004. |
|
|
T. Calamoneri, A. Massini, "Efficient Algorithms for Checking the Equivalence of Multistage Interconnection Networks", Journal on Parallel and Distributed Computing, 64(1), pp. 135-150, 2004. |
|
|
T. Calamoneri, M. Di Ianni, "Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees", Journal on Parallel and Distributed Computing, 63(11), pp. 1017-1025, 2003. |
|
|
T. Calamoneri, A. Massini, I. Vrto, "New Results on Edge-Bandwidth", Theoretical Computer Science, 307(3), pp. 503-513, 2003. |
|
|
T. Calamoneri, R. Petreschi, "Edge-Clique Graphs and the Lambda-Coloring Problem", Journal of the Brazilian Computer Society, Special Issue in honor of Jaime Szwarcfiter's 60th birthday, 2002. |
|
|
T. Calamoneri, I. Finocchi, Y. Manoussakis, R.Petreschi, A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs, Journal on Parallel Algorithms and Applications, 17(3), pp. 165-183, 2001. |
|
|
T. Calamoneri, S. Olariu, R.Petreschi, A Simple Parallel Algorithm to Draw Cubic Graphs, IEEE Transactions on Parallel and Distributed Systems, 11(10), pp. 1009-1018, , 2000. |
|
|
T. Calamoneri, A. Massini , Optimal Three-Dimensional Layout of Networks, Theoretical Computer Science, 255, pp.263-279, 2000. |
|
|
T. Calamoneri, R. Petreschi , Optimal Layout of Trivalent Cayley Interconnection Networks, International Journal on Foundations of Computer Science, 10(3), pp. 277-287, 1999. |
|
|
T. Calamoneri, A. Massini , An Optimal Layout of Multigrid Networks, Information Processing Letters , 72, pp. 137-141, 1999. |
|
|
T. Calamoneri, S. Jannelli, R. Petreschi: , Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs, Journal of Graph Algorithms and Applications;, 3(2), pp. 1-22, 1999. |
|
|
A. Avior, T. Calamoneri, S. Even, A. Litman, A. Rosenberg, A Tight Layout of the Butterfly Network, Theory of Computing Systems (Math.Systems Theory), 31, pp. 475-487, Springer-Verlag Ed., New York (USA) 1998. |
|
|
T. Calamoneri, R.Petreschi, Orthogonally Drawing Cubic Graphs in Parallel, Journal on Parallel and Distributed Computing, 55, pp. 94-108, Academic Press, 1998. |
|
|
T.Calamoneri, R.Petreschi, A new 3D Representation of Trivalent Cayley Networks, Inform. Processing Letters. 61, pp.247-252, 1997. |
|
|
T.Calamoneri, A.Sterbini, 3D Straight-Line Grid Drawing of 4-colorable Graphs, Inform. Processing Letters. 62, pp 97-102, 1997. |
|
Publications on International Conferences |
|
|
T. Calamoneri, R. Petreschi, B. Sinaimeri, "On Relaxing the Constraints in Pairwise Compatibility Graphs", Accepted to the Workshop on Algorithms and Computation (WALCOM 2012), , 2012. Also presented during the GA - Graph algorithms and Applications Workshop, in honor of the 70th birthday of Giorgio Ausiello , 2011 |
|
|
T. Calamoneri, R. Petreschi, "L(2,1)-Labeling of Unigraphs", Proc. of 1st Int.l ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS 2011), Lecture Notes in computer Science, 6595, pp. 57-68, 2011. Also presented during the SIAM Conference on Discrete Mathematics , 2010 |
|
|
T. Calamoneri, B. Sinaimeri, "L(2,1)-Labeling of Oriented Planar Graphs", Accepted to the 10th Cologne-Twente Workshop on graphs and combinatorial optimization (CTW 2011), 2011. Also presented at the 12th Italian Conference on Theoretical Computer Science (ICTCS 2010) , 2010 |
|
|
N. Bartolini, T. Calamoneri, T. La Porta, S. Silvestri, "GREASE: grid and release, deployment of mobile sensors in an unknown environment", Proc. of 29th IEEE International Conference on Computer Communications (INFOCOM 2010), . Miniconference, 2010. |
|
|
N. Bartolini, T. Calamoneri, T. La Porta, A. Massini, S. Silvestri, "Autonomous deployment of heterogeneous mobile sensors", Proc. of 17th IEEE Int.l Conference on Networks Protocols (ICNP '09) . Best Paper Award. |
|
|
T. Calamoneri, "L(2,1)-Labeling of Oriented Grids" Presented during the 11th Italian Conference on Theoretical Computer Science (ICTCS 2009) . |
|
|
N. Bartolini,T. Calamoneri, A. Massini, S. Silvestri, "Variable density deployment and topology control for the solution of the sink-hole problem", Proc. of 6th Int.l ICST Conferente on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QShine 2009) . |
|
|
A. Borri, T. Calamoneri, R. Petreschi, "Recognition of Unigraphs through Superposition of Graphs", Proc. of Whorkshop on ALgorithms and COMputation (WALCOM 2009) , Lecture Notes in computer Science, 5431, p. 165-176, 2009. |
|
|
T. Calamoneri, E. Fusco, A. Pelc, "Impact of Information on the Complexity of Asynchronous Radio Broadcasting", Proc. of 12th International Conference On Principles Of DIstributed Systems (OPODIS '08), , Lect. Notes in Comp. Sci. 5401, pp. 311-330, 2008. |
|
|
N. Bartolini, T. Calamoneri, E.G. Fusco, A. Massini, S. Silvestri, "Autonomous deployment of self-organizing mobile sensors for a complete coverage", Proc. of 3rd International Workshop on Self-Organizing Systems (IWSOS 2008), , Lecture Notes in computer Science, 5343, pp. 194-205,2008. |
|
|
T. Calamoneri, A. Clementi, A. Monti, G. Rossi, R. Silvestri, "Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms", Proc. of 11-th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM '08) , ACM Press, pp. 354-361, 2008. |
|
|
N. Bartolini, T. Calamoneri, E.G. Fusco, A. Massini, S. Silvestri, "Snap and Spread: a self-deployment algorithm for mobile sensor networks", Proc. of 4th International Conference on Distributed Computing (DCOSS '08) , Lecture Notes in computer Science, 5067, pp. 451-456, 2008. |
|
|
T. Calamoneri, A. Clementi, E. Fusco, R. Silvestri, "Maximizing the number of broadcast operations in random geometric ad-hoc networks ", 11th Int.l Conference on Principles Of Distributed Systems (OPODIS 07), Lecture Notes in Computer Science 4878, 2007. |
|
|
T. Calamoneri, S. Caminiti, S. Olariu, R. Petreschi, "On the L(h,k)-Labeling of Co-Comparability Graphs", Proc. of IntErnational Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE '07), Lecture Notes in computer Science 4614, pp. 116-127, 2007. |
|
|
T. Calamoneri, E. Fusco, A. Shende, S. Shende, "Proxy Assignments for Filling Gaps in Wireless Ad-hoc Lattice Computers", 14th Colloquium on Structural Information and Communication Complexity (SIROCCO 2007), Lecture Notes in Computer Science 4474, pp. 204-217, 2007. |
|
|
T. Calamoneri, A. Massini, L. Torok, I. Vrto, "Antibandwidth of Complete k-ary Trees", Proc. of 5th Cracow Conference on Graph Theory, Electronic Notes in Discrete Mathematics, 24, pp. 259-266, 2006. |
|
|
T. Calamoneri, E. Fusco, R.B. Tan, P. Vocca, "L(h,1,1)-Labeling of Outerplanar Graphs", 13th Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), Lecture Notes in Computer Science, 4056, pp. 268 - 279, 2006. |
|
|
T. Calamoneri, A.F. Clementi, M. Di Ianni, M. Lauria, A. Monti, R. Silvestri, "Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks", Proc. of 13th Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), Lecture Notes in Computer Science, 4056, pp. 227-239, 2006. |
|
|
T. Calamoneri, I. Finocchi, R. Petreschi, "Graph Coloring with Distance Constraints", The 2005 International Conference on Parallel and Distributed Processing Techniques and Applications , pp. 178-184, 2005. |
|
|
T. Calamoneri, P. Vocca,"On the L(h,k)-Labelling Problem of Bipartite Graphs", Proc. of 12th Colloquium on Structural Information and Communication Complexity (SIROCCO 2005), Lecture Notes in Computer Science 3499, pp. 65-77, 2005. |
|
|
T. Calamoneri, S. Caminiti, R. Petreschi, "A General Approach to L(h,k)-Label Interconnection Networks ", accepted to 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics (GRACO 05) , 2004. |
|
|
T. Calamoneri, A. Massini,"Nearly Optimal Three Dimensional Layout of Hypercubes", Proc. of 11th International Symposium on Graph Drawing (GD'03), Lecture Notes in Computer Science 2912, pp.247-258, 2003. |
|
|
T. Calamoneri, "Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks (Extended Abstract)", 8th Italian Conference on Theoretical Computer Science (ICTCS'03), Lect. Notes in Comp. Science 2841, pp. 163-173, 2003. |
|
|
T.Calamoneri, R.Petreschi, "On the Radiocoloring Problem", Proc. 4th Int.l Whorkshop on Distributed Computing (IWDC), Lect. Notes in Comp. Science 2571, pp. 118-127, 2002. |
|
|
T.Calamoneri, A.Pelc, R.Petreschi "Labeling trees with a condition at distance two", Proc. R. C. Bose Centenary Symp. On Discrete Math. And Applications, Electronic Notes in Discrete Mathematics 15/2003, pp. 1-4, 2002. |
|
|
T.Calamoneri, R.Petreschi, "L(2,1)-Coloring Matrogenic Graphs (Extended Abstract)", Latin American Theoretical Informatics (LATIN 2002), Lect. Notes in Comp. Science 2286, pp. 236-247, 2002. |
|
|
T.Calamoneri, R.Petreschi, "The L(2,1)-Labeling of Planar Graphs", Proc. of 5th ACM DIAL-M, pp. 28-33, 2001. |
|
|
T.Calamoneri, R.Petreschi, "Lambda-Labeling of Regular Tiling", Proc. of 1st Cologne-Twente Workshop (CTW), Electronic Notes in Discr. Math. 8/2001 pp. 18-21. |
|
|
T.Calamoneri, A.Massini, "A New Approach to the Rearrangeability of (2log N -1) Stage MINs", IASTED International Symposium on Applied Informatics (AI 2001), pp. 365-370, 2001. |
|
|
T.Calamoneri, Y. Liu and R. Petreschi, "Optimally Extending Bistandard Graphs on the Orthogonal Grid", Fourth Asian Symposium on Computer Mathematics (ASCM 2000), pp. 299-308, 2000. |
|
|
T.Calamoneri, A.Massini, Efficiently Checking the Equivalence of Multistage Interconnection Networks, Eleventh IASTED International Conference on Parallel and Distributed Computing and Systems (CPDC'99), pp. 23-30, 1999. |
|
|
P.Alimonti, T.Calamoneri, "On the Complexity of the Max Balance Problem", Argentinian Workshop on Theoretical Computer Science (WAIT'99), pp. 133-138, 1999. |
|
|
T.Calamoneri, I. Finocchi, Y. Manoussakis, R. Petreschi, "Parallel Generation of Large Bipartite Subgraphs in Cubic Graphs", Workshop on Theoretical Computer Science (WAIT'99), pp. 133-138, 1999. |
|
|
T.Calamoneri, I. Finocchi, Y. Manoussakis, R. Petreschi, "A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs", Advances in Computing Science -ASIAN'99, Lect. Notes in Comp. Science 1742, pp. 27-36, Springer Verlag Ed., Berlin (Germania) 1999. |
|
|
T. Calamoneri, M. Di Ianni, "Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees (Extended Abstract)", Proc. Annual ACM Conference Euro-Par '98; Lect. Notes in Comp. Science 1470, pp. 1029-1039, Springer Verlag Ed., Berlin (Germany) 1998. |
|
|
T.Calamoneri, A.Massini, "On the Three-Dimensional Layout of Interconnection Networks", Proc.Graph Drawing '97 (GD97) , Lect. Notes in Comp. Science 1353, pp. 64-75, Springer Verlag Ed., Berlin (Germania) 1997. |
|
|
A.Avior, T.Calamoneri, S.Even, A.Litman, A.L.Rosenberg, "A Tight Layout of the Butterfly Network", Proc. 8-th Annual ACM Symosium on Parallel Algorithms and Architectures (SPAA 96) ,Padua - Italy, ACM Press Ed., pp.170-175,1996. |
|
|
T. Calamoneri, A. Sterbini, "Drawing 2-, 3- and 4-colorable Graphs in O(n^2) volume" Proc. Workshop on Graph Drawing (GD 96) , Berkeley - California, U.S.A. Lect. Notes in Comp. Science, Springer Verlag Ed.1190, pp. 53-62,1996. |
|
|
T.Calamoneri, R.Petreschi, "Visual representations of Trivalent Cayley Interconnection Networks" Proc. Eleventh International Symposium on Computer and Information Sciences (ISCIS XI), Antalya - Turkey, pp.555-564, 1996. |
|
|
P.Alimonti, T.Calamoneri, "Improved Approximations for Minimim Independent Dominating Set in Bounded Degree Graphs" Proc. 22-nd International Workshop on Graph-Theoretic Concept in Computer Science (WG 96), Como - Italy, Lect. Notes in Comp. Science 1197, Springer Verlag Ed., pp.2-16, 1996. |
|
|
T.Calamoneri, R.Petreschi, "An Efficient Orthogonal Grid Drawing Algorithm for Cubic Graphs" Proc. First Annual International Conference, COCOON 95 Xian - China, Lect. Notes in Comp. Science 959, Springer Verlag Ed., pp.31-40, 1995. |
|
|
T. Calamoneri, R. Petreschi, "A Parallel Algorithm for Orthogonal Drawings of Cubic Graphs" Proc. Fifth Italian Conference On Theoretical Computer Science (FITCTS), Ravello - Italy, World Scientific Publ., pp. 118-129, 1995. |
|
|
T. Calamoneri, R. Petreschi, "Cubic graphs as model of real systems" Proc. Conference 'Matrices and Graphs: Theory and Economics' Applications' Brescia - Italy, World Scientific Publ., pp. 19-30,1995. |
|
| If you would like to have a version of any paper not appearing in this page, please, feel free to write me, and I will send you the file... |