My papers
Publications in International Journals
T. Calamoneri, F. Corò, S. Mancini: "Data Detection and Inspection with a Fleet of UAVs", Computers and Operations Research, 2024, to appear.
T. Calamoneri, F. Corò, S. Mancini: "Management of a post-disaster emergency scenario through unmanned aerial vehicles: Multi-Depot Multi-Trip Vehicle Routing with Total Completion Time Minimization", Expert Systems With Applications 251, 123766, 2024.
A. Marino, B. Sinaimeri, E. Tronci, T. Calamoneri: "STARGATE-X: a Python package for statistical analysis on the REACTOME network", Journal of Integrative Bioinformatics, pp. 20220029, 2023.
T. Calamoneri, D. Tavernelli: "Modeling and Approximating the Visit of a Set of Sites with a Fleet of UAVs", the Computer Journal, 66(7), 1586-1594, 2023.
T. Calamoneri, A. Monti, B. Sinaimeri: "On the domination number of t-constrained de Bruijn graphs", Discrete Mathematics & Theoretical Computer Science, 24(2), 2022.
T. Calamoneri, F. Corò, S. Mancini: "A Realistic Model to Support Rescue Operations after an Earthquake via UAVs", IEEE Access, 10, 6109-6125, 2022.
D. Tavernelli, T. Calamoneri, P. Vocca: "Linear Time Reconciliation with Bounded Transfers of Genes", IEEE Transactions on Computational Biology and Bioinformatics, 19(2), 1009-1017, 2022.
T. Calamoneri, M. Gastaldello, A. Mary; M.-F. Sagot; B. Sinaimeri: "Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility", Algorithms for Molecular Biology, 15, 14, 2020.
T. Calamoneri, V. Di Donato, D. Mariottini, M. Patrignani: "Visualizing Co-Phylogenetic Reconciliations", Theoretical Computer Science, 815, 228–245, 2020.
G. Baiocchi, T. Calamoneri, A. Monti, R. Petreschi: "Some classes of graphs that are not PCGs", Theoretical Computer Science, 791, pp. 62–75, 2019.
T. Calamoneri, A. Monti, B. Sinaimeri: "Co-Divergence and Tree Topology", Journal on Mathematical Biology, 79(3), pp.1149-1167, 2019.
T. Calamoneri, M. Dell’Orefice, A. Monti: "A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs", Theoretical Computer Science, 764, pp. 2–14, 2019.
T. Calamoneri, A. Monti, R. Petreschi: "On Dynamic Threshold Graphs and Related Classes", Theoretical Computer Science, 718, pp. 46–57, 2018.
N. Bartolini, T. Calamoneri, S. Ciavarella, T. La Porta, S. Silvestri: "Autonomous mobile sensor placement in complex environments", ACM Transactions on Autonomous and Adaptive Systems (TAAS), 12(2), 2017.
T. Calamoneri, B. Sinaimeri: “Pairwise Compatibility Graphs: A Survey", SIAM Reviews, 58(3), pp. 445–460, 2016.
T. Calamoneri: “Optimal L(j, k)-Edge-Labeling of Regular Grids", International Journal on Foundations of Computer Science, 26(4) pp. 523–535, 2015.
T. Calamoneri, R. Petreschi: “On Pairwise Compatibility Graphs having Dilworth Number k”, Theoretical Computer Science, 547, pp. 82–89, 2014.
T. Calamoneri, R. Petreschi: “On Pairwise Compatibility Graphs having Dilworth Number Two”, Theoretical Computer Science, 524, pp. 34–40, 2013 and Corrigendum to “On Pairwise Compatibility Graphs having Dilworth Number Two”, [Theoret. Comput. Sci. 524 (2013) 34–40], Theoretical Computer Science, 602, pp. 158–159, 2015.
T. Calamoneri, A. Frangioni, B. Sinaimeri: “Pairwise Compatibility Graphs of Caterpillars", Comput. J., 57(11), pp. 1616–1623, 2014.
T. Calamoneri: “Optimal L(δ1, δ2, 1)-Labeling of eight-Regular Grids", Information Processing Letters, 113(10-11), pp. 361–364, 2013.
T. Calamoneri, R. Petreschi, B. Sinaimeri: “On the Pairwise Compatibility Property of Some Superclasses of Threshold Graphs", Discrete Mathematics, Algorithms and Applications, 5(2), 2013.
T. Calamoneri, E. Montefusco, R. Petreschi, B. Sinaimeri: “Exploring Pairwise Compatibility Graphs", Theoretical Computer Science, 468, pp. 23-36, 2013.
T. Calamoneri, B. Sinaimeri: “L(2,1)-Labeling of Oriented Planar Graphs", Discrete Applied Mathematics, 161(12), pp. 1719-1725, 2013.
T. Calamoneri, D. Frascaria, B. Sinaimeri: “All graphs with at most seven vertices are Pairwise Compatibility Graphs", the Computer Journal, 56(7), pp. 882–886, 2013.
N. Bartolini, T. Calamoneri, T. La Porta, C. Petrioli, S. Silvestri: “Sensor Activation and Radius Adaptation (SARA) in Heterogeneous Sensor Networks", ACM Transactions on Sensor Networks, 8(3), pp. 24, 2012.
T. Calamoneri, R. Petreschi: “The L(2, 1)-labeling of unigraphs", Discrete Applied Mathematics, 159(12), pp. 1196-1206, 2011.
T. Calamoneri: "The L(2,1)-Labeling Problem on Oriented Regular Grids", the Computer Journal, 154(11), pp. 1869-1875, 2011.
T. Calamoneri: “The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography", the Computer Journal, 54(8), pp. 1344-1371, 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, S. Silvestri: “Autonomous deployment of heterogeneous mobile sensors", IEEE Transactions on Mobile Computing, 10(6), pp. 753-766, 2011.
N. Bartolini, T. Calamoneri, 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), pp. 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), pp. 208-216, 2011.
T. Calamoneri, A. Massini. L. Torok, I. Vrto: “Antibandwidth of Complete k-ary Trees", Discrete Mathematics, 309(22), pp. 6408-6414 (special issue di Cracow Conference on Graph Theory), 2009.
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), pp. 607-625, 2010.
T. Calamoneri, E. Fusco, R.B. Tan, P. Vocca: “L(h,1,1)-Labeling of Outerplanar Graphs", Mathematical Methods of Operations Research, 69(2), pp. 307-321, 2009.
T. Calamoneri, S. Caminiti, S. Olariu, R. Petreschi: “On the L(h,k)-Labeling of Co-Comparability Graphs and Circular-Arc Graphs", Networks, 53, pp. 27-34, 2009.
T. Calamoneri, S. Caminiti, R. Petreschi: “A General Approach to L(h,k)-Label Interconnection Networks", J. Comput. Science & Technology, 23(4), pp. 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 (special issue di SIROCCO 2006), 399 (1), pp. 38-53, 2008.
T. Calamoneri: "The L(h,k)-Labelling Problem: A Survey and Annotated Bibliography", The Computer Journal, 49(5), pp. 585-608, 2006.
T. Calamoneri: "Optimal L(h, k)-Labeling of Regular Grids", Discrete Mathematics & Theoretical Computer Science, 8, pp. 141-158, 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: "λ-Coloring Matrogenic Graphs", Discrete Applied Mathematics, 154, pp. 2445-2457, 2006.
T. Calamoneri, A. Massini: "Nearly Optimal Three Dimensional Layout of Hypercube Networks", Networks, 47(19), 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 of 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 λ-Coloring Problem", Journal of the Brazilian Computer Society, Special Issue in honor of Jayme Szwarcfiter’s 60th birthday, 3(7), pp. 38-47, 2002.
T. Calamoneri, I. Finocchi, Y. Manoussakis, R. Petreschi: "On Max Cut in Cubic Graphs", 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 Interconnection Networks", Theoretical Computer Science, 255, pp. 263-279, 2001.
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 Let- ters, 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, 1998.
T. Calamoneri, R. Petreschi: "Orthogonally Drawing Cubic Graphs in Parallel", Journal of Parallel and Distributed Computing, 55, pp. 94-108, 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, 63, pp. 97-102, 1997.
Book Chapters
T. Calamoneri, R. Petreschi: "λ-coloring matrogenic graphs", in P. Skums and V. Zverovich eds. Methods of Graph Decompositions, in memory of Regina Tyshkevich (1929--2019), Oxford University Press, 2022. In press.
Publications on the Proceedings of International Conferences
T. Calamoneri: "The L(3,2,1)-labeling of certain planar graphs (Extended Abstract)", Proc. 24th Italian Conference on Theoretical Computer Science (ICTCS 2023), CEUR Workshop Proceedings 3587, pp. 65-76, 2023.
T. Calamoneri, F. Corò: "(Eternal) Vertex Cover Number of Infinite and Finite Grid Graphs (short paper)", Proc. 24th Italian Conference on Theoretical Computer Science (ICTCS 2023), CEUR Workshop Proceedings 3587, pp. 104-109, 2023.
T. Calamoneri, F. Corò, S. Mancini: "A Matheuristic for Multi-Depot Multi-Trip Vehicle Routing Problems", Proc. 14th Metaheuristics International Conference (MIC 2022), Lecture Notes in Computer Science 13838, pp. 464-469, 2023.
T. Calamoneri, A. Monti, B. Sinaimeri: "On the domination number of t-constrained de Bruijn graphs (Short Paper)", Proc. 23rd Italian Conference on Theoretical Computer Science (ICTCS 2022), CEUR Workshop Proceedings 3284, pp.34-39, 2022.
T. Calamoneri, B. Sinaimeri: "Some Problems Related to the Space of Optimal Tree Reconciliations" (Invited Talk), Proc. 16th International Conference and Workshop on Algorithms and Computation (WALCOM 2022), Lecture Notes in Computer Science 13174, pp. 3-14, 2022.
T. Calamoneri, F. Corò: "A Realistic Model for Rescue Operations after an Earthquake", Poster at the 23rd International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2020) published on Proc. Q2SWinet20.
Also presented at 21st Italian Conference on Theoretical Computer Science (ICTCS 2020), CEUR Workshop Proceedings 2756, pp. 28-32, 2020.T. Calamoneri, A. Di Mambro, B. Sinaimeri: "Comparing related phylogenetic trees", Proc. 20th Italian Conference on Theoretical Computer Science (ICTCS 2019), CEUR Workshop Proceedings 2504, pp. 8–13, 2019.
T. Calamoneri, R. Petreschi: "Pairwise Compatibility Graphs (Invited Talk)", Proc. 19th Italian Conference on Theoretical Computer Science (ICTCS 2018), CEUR Workshop Proceedings 2243, pp. 1–6, 2018.
P. Baiocchi, T. Calamoneri, A. Monti, R. Petreschi: "Graphs that are Not Pairwise Compatible: A New Proof Technique (Extended Abstract)", Proc. International Workshop on Combinatorial Algorithms (IWOCA 2018), Lecture Notes in Computer Science, 10979, pp. 39–51, 2018.
Also presented at 19th Italian Conference on Theoretical Computer Science (ICTCS 2017), CEUR Workshop Proceedings 1949, pp. 203–207, 2017.T. Calamoneri, V. Di Donato, D. Mariottini, M. Patrignani: "Visualizing Co-Phylogenetic Reconciliations", Proc. 25th Int.l Symp. on Graph Drawing & Network Visualization (GD 2017), Lecture Notes in Computer Science, 10692, pp.334–347, 2018.
Also presented at 19th Italian Conference on Theoretical Computer Science (ICTCS 2017), CEUR Workshop Proceedings 1949, pp. 228–232, 2017.M. Gastaldello, T. Calamoneri, M.-F. Sagot: "Extracting Few Representative Reconciliations with Host-Switches (Extended Abstract)", Proc. 14th Computational Intelligence methods for Bioinformatics and Biostatistics (CIBB 2017), Lecture Notes in Bioinformatics (LNBI) 10834, pp. 9–18, 2019.
T. Calamoneri, M. Dell’Orefice, A. Monti: "A locally connected spanning tree can be found in polynomial time on Simple Clique 3-Trees (Extended Abstract)", Proc. 18th Italian Conference on Theoretical Computer Science (ICTCS 2016), CEUR Workshop Proceedings 2016.
T. Calamoneri, M. Gastaldello, A. Mary, M.-F. Sagot, B. Sinaimeri: "On Maximal Chain Subgraphs and Covers of Bipartite Graphs", Proc. 27th Int.l Workshop on Combinatorial Algorithms (IWOCA 2016). Lecture Notes in Computer Science, 9843, pp. 137–150, 2016.
Also presented at18th Italian Conference on Theoretical Computer Science (ICTCS 2016), CEUR Workshop Proceedings 2016.T. Calamoneri, A. Monti, R. Petreschi: "Dynamically maintaining minimal integral separator for Threshold and Difference Graphs", Proc. 10th Int.l Workshop on Algorithms and Computation (WALCOM 2016). Lecture Notes in Computer Science 9627, pp. 313–324, 2016.
T. Calamoneri, A. Monti, R. Petreschi: "Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract)", Proc. 13th Cologne-Twente Workshop on Graphs & Combinatorial Optimization (CTW 2015), 2015.
Also presented at 17th Italian Conference on Theoretical Computer Science (ICTCS 2015), CEUR Workshop Proceedings 1231, 2015.T. Calamoneri, B. Sinaimeri: "Relating threshold tolerance graphs to other graph classes", Proc. 16th Italian Conference on Theoretical Computer Science (ICTCS 2014), CEUR Workshop Proceedings vol. 1231, 2014.
T. Calamoneri, R. Petreschi: "On Dilworth k Graphs and their Pairwise Compatibility", Proc. 8-th Int.l Workshop on Algorithms and Computation (WALCOM 2014), Lecture Notes in Computer Science, 8344, pp. 213–224, 2014.
T. Calamoneri, R. Petreschi: "Graphs with Dilworth Two are Pairwise Compatibility Graphs", Proc. VII Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 2013), Electronic Notes in Disc. Math. 1663, pp. 31–38, 2013.
T. Calamoneri, R. Petreschi, B. Sinaimeri: "On relaxing the constraints in pairwise compatibility graphs", Proc. Workshop on Algorithms and Computation (WALCOM 2012), Lect. Notes in Comp. Sci., 7157, pp. 124-135, 2012.
Also presented at the Workshop on Graph algorithms and Applications (GA), in honor of the 70th birthday of Giorgio Ausiello, colocated with ICALP, 2011.T. Calamoneri, B. Sinaimeri: "L(2,1)-Labeling of Oriented Planar Graphs", Proc. 10th Cologne-Twente Workshop on graphs and combinatorial optimization (CTW 2011), pp. 93-96, http://ctw2011.dia.uniroma3.it/proceedings.html.
Also presented at 12th Italian Conference on Theoretical Computer Science (ICTCS 2010), 2010.T. Calamoneri, R. Petreschi: "L(2, 1)-Labeling of Unigraphs", Proc. 1st Int.l ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS 2011), Lect. Notes in Comp. Sci., 6595, pp. 57-68, 2011.
Also presented at SIAM Conference on Discrete Mathematics, 2010.N. Bartolini, T. Calamoneri, T. La Porta, S. Silvestri: "Mobile Sensor Deployment in Unknown Fields", Proc. 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. 17th IEEE Int.l Conference on Networks Protocols (ICNP ’09), 2009. Best paper award.
T. Calamoneri: "L(2, 1)-Labeling of Oriented Grids", 11th Italian Conference on Theoretical Computer Science (ICTCS 2009), 2009.
N. Bartolini, T. Calamoneri, A. Massini, S. Silvestri: "Variable density deployment and topology control for the solution of the sink-hole problem", Proc. 6th Int.l ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QShine 2009), 2009.
A. Borri, T. Calamoneri, R. Petreschi: "Recognition of Unigraphs through Superposition of Graphs", Proc. Whorkshop on ALgorithms and COMputation (WALCOM 2009), Lect. Notes in Comp. Sci., 5431, p. 165-176, 2009.
T. Calamoneri, E. Fusco, A. Pelc: "Impact of Information on the Complexity of Asynchronous Radio Broadcasting", Proc. 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. 3rd International Workshop on Self- Organizing Systems (IWSOS 2008), Lect. Notes in Comp. Sci. 5343, pp. 194-205, 2008.
T. Calamoneri, A.F. Clementi, A. Monti, G. Rossi, R. Silvestri: "Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms", Proc. 11-th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM ’08), 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. 4th Int.l Conference on Distributed Computing (DCOSS ’08), Lect. Notes in Comp. Sci. 5067, pp. 451-456, 2008.
T. Calamoneri, A. Clementi, E. Fusco, R. Silvestri: "Maximizing the number of broadcast operations in static random geometric ad-hoc networks", Proc. 11th Int.l Conference on Principles Of Distributed Systems (OPODIS ’07), Lect. Notes in Comp. Sci. 4878, 2007.
T. Calamoneri, S. Caminiti, S. Olariu, R. Petreschi: "On the L(h,k)-Labeling of Co-Comparability Graphs", Proc. di IntErnational Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE ’07), Lect. Notes in Comp. Sci. 4614, pp. 116-127, 2007.
T. Calamoneri, E. Fusco, A. Shende, S. Shende: "Proxy Assignments for Filling Gaps in Wireless Ad- hoc Lattice Computers", Proc. 14th Colloquium on Structural Information and Communication Complexity (SIROCCO 2007), Lect. Notes in Comp. Sci. 4474, pp. 204-217, 2007.
T. Calamoneri, A. Massini. L. Torok, I. Vrto: "Antibandwidth of Complete k-ary Trees", Proc. 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", Proc. 13th Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), Lect. Notes in Comp. Sci. 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. 13th Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), Lect. Notes in Comp. Sci. 4056, pp. 227 - 239, 2006.
T. Calamoneri, P. Vocca: "On the Approximability of the L(h,k)-Labelling Problem on Bipartite Graphs", Proc. 12th Colloquium on Structural Information and Communication Complexity (SIROCCO 2005), Lect. Notes in Comp. Sci. 3499, pp. 65-77, 2005.
T. Calamoneri, A. Massini: "Nearly Optimal Three Dimensional Layout of Hypercubes", Proc. 11th International Symposium on Graph Drawing (GD’03), Lect. Notes in Comp. Sci. 2912, pp. 247-258, 2003.
T. Calamoneri: "Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks (Extended Abstract)", Proc. 8th Italian Conference on Theoretical Computer Science (ICTCS ’03), Lect. Notes in Comp. Sci. 2841, pp. 163-173, 2003.
T. Calamoneri, R. Petreschi: "L(2, 1)-Coloring Matrogenic Graphs (Extended Abstract)", Proc. Latin American Theoretical INformatics (LATIN ’02), Lect. Notes in Comp. Sci. 2286, pp. 236-247, 2002.
T. Calamoneri, R. Petreschi: "The L(2, 1)-Labeling of Planar Graphs", Proc. 5th ACM DIAL-M, pp. 28-33, 2001.
T. Calamoneri, R. Petreschi: "λ-Coloring of Regular Tiling", Proc. 1st Cologne-Twente Workshop (CTW), Electronic Notes in Discrete Mathematics vol 8/2001, pp. 18-21.
T.Calamoneri, Y.Liu, R.Petreschi: "Optimally Extending Bistandard Graphs on the Orthogonal Grid", Proc. 4th Asian Symposium on Computer Mathematics (ASCM 2000), pp. 299-308, 2000.
T. Calamoneri, A. Massini: "Efficiently Checking the Equivalence of Multistage Interconnection Net- works", Proc. 11th International Conference on Parallel and Distributed Computing and Systems (PDCS ’99), pp. 23-30, 1999.
P. Alimonti, T.Calamoneri: "On the Complexity of the Max Balance Problem", Proc. 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", Proc. Argentinian Workshop on Theoretical Computer Science (WAIT ’99), pp. 175-184, 1999.
T. Calamoneri, I. Finocchi, Y. Manoussakis, R. Petreschi: "A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs", Proc. Advances in Computing Science (ASIAN ’99), Lect. Notes in Comp. Sci. 1742, pp. 27-36, 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. Sci. 1470, pp. 1029-1039, 1998.
T. Calamoneri, A. Massini: "On Three-Dimensional Layout of Networks", Proc. 5th International Symposium on Graph Drawing (GD’97), Lect. Notes in Comp. Sci. 1353, pp. 64-75, 1997.
T. Calamoneri, A. Sterbini: "Drawing 2-, 3- and 4-colorable Graphs in O(n^2) volume", Proc. 4th International Simposium on Graph Drawing (GD’96), Lect. Notes in Comp. Sci. 1190, pp. 53-62, 1997.
A. Avior, T. Calamoneri, S. Even, A. Litman, A. Rosenberg: "A Tight Layout of the Butterfly Network", Proc. 8-th Annual ACM Symosium on Parallel Algorithms and Architectures (SPAA ’96), pp.170- 175, 1996.
P. Alimonti, T.Calamoneri:"Improved Approximations of Independent Dominating Set in Bounded Degree Graphs", Proc. 22-nd International Workshop on Graph-Theoretic Concept in Computer Science (WG ’96), Lect. Notes in Comp. Sci. 1197, pp. 2-16, 1996.
T. Calamoneri, R. Petreschi: "Cubic graphs as model of real systems", Proc. Conference Matrices and Graphs: Theory and Economics Applications, pp. 19-30, 1996.
T. Calamoneri, R. Petreschi: "An Efficient Orthogonal Grid Drawing Algorithm for Cubic Graphs", Proc. First Annual International Conference on Computing and Combinatorics (COCOON ’95), Lect. Notes in Comp. Sci. 959, pp.31-40, 1995.