default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTiziana Calamoneri
Person information
- affiliation: University of Rome "Sapienza", Italy
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j71]Tiziana Calamoneri, Federico Corò
, Simona Mancini:
Autonomous data detection and inspection with a fleet of UAVs. Comput. Oper. Res. 168: 106678 (2024)- [j70]Tiziana Calamoneri, Federico Corò, Simona Mancini:
Management of a post-disaster emergency scenario through unmanned aerial vehicles: Multi-Depot Multi-Trip Vehicle Routing with Total Completion Time Minimization. Expert Syst. Appl. 251: 123766 (2024) - [j69]Andrea Marino, Blerina Sinaimeri, Enrico Tronci, Tiziana Calamoneri:
STARGATE-X: a Python package for statistical analysis on the REACTOME network. J. Integr. Bioinform. 20(3) (2024) - [j68]Tiziana Calamoneri:
L(3,2,1)-labeling of certain planar graphs. Theor. Comput. Sci. 1022: 114881 (2024) - [i15]Davide Belluomo, Tiziana Calamoneri, Giacomo Paesani, Ivano Salvo:
Toward a Unified Graph-Based Representation of Medical Data for Precision Oncology Medicine. CoRR abs/2410.14739 (2024) - 2023
- [j67]Tiziana Calamoneri, Daniele Tavernelli:
Modeling and Approximating the Visit of a Set of Sites With a Fleet of UAVs. Comput. J. 66(7): 1586-1594 (2023) - [c48]Tiziana Calamoneri:
L(3, 2, 1)-Labeling of Certain Planar Graphs. ICTCS 2023: 65-76 - [c47]Tiziana Calamoneri, Federico Corò:
(Eternal) Vertex Cover Number of Infinite and Finite Grid Graphs (short paper). ICTCS 2023: 104-109 - 2022
- [j66]Tiziana Calamoneri, Federico Corò, Simona Mancini:
A Realistic Model to Support Rescue Operations After an Earthquake via UAVs. IEEE Access 10: 6109-6125 (2022) - [j65]Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
On the domination number of $t$-constrained de Bruijn graphs. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [j64]Daniele Tavernelli, Tiziana Calamoneri, Paola Vocca:
Linear Time Reconciliation With Bounded Transfers of Genes. IEEE ACM Trans. Comput. Biol. Bioinform. 19(2): 1009-1017 (2022) - [j63]Tiziana Calamoneri:
Editorial. Theor. Comput. Sci. 931: 152-153 (2022) - [c46]Tiziana Calamoneri, Federico Corò, Simona Mancini:
A Matheuristic for Multi-Depot Multi-Trip Vehicle Routing Problems. MIC 2022: 464-469 - [c45]Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
On the Domination Number of t-Constrained de Bruijn Graphs. ICTCS 2022: 34-39 - [c44]Tiziana Calamoneri, Blerina Sinaimeri:
Some Problems Related to the Space of Optimal Tree Reconciliations - (Invited Talk). WALCOM 2022: 3-14 - [i14]Tiziana Calamoneri, Angelo Monti, Fabrizio Petroni:
All Graphs with at most 8 nodes are 2-interval-PCGs. CoRR abs/2202.13844 (2022) - [i13]Tiziana Calamoneri, Federico Corò, Simona Mancini:
Multi-Depot Multi-Trip Vehicle Routing with Total Completion Time Minimization. CoRR abs/2207.06155 (2022) - [i12]Tiziana Calamoneri, Federico Corò:
(Eternal) Vertex Cover Number of Infinite and Finite Grid Graphs. CoRR abs/2209.05102 (2022) - 2021
- [e3]Tiziana Calamoneri, Federico Corò:
Algorithms and Complexity - 12th International Conference, CIAC 2021, Virtual Event, May 10-12, 2021, Proceedings. Lecture Notes in Computer Science 12701, Springer 2021, ISBN 978-3-030-75241-5 [contents] - [i11]Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
On Generalizations of Pairwise Compatibility Graphs. CoRR abs/2112.08503 (2021) - 2020
- [j62]Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility. Algorithms Mol. Biol. 15(1): 14 (2020) - [j61]Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani:
Visualizing co-phylogenetic reconciliations. Theor. Comput. Sci. 815: 228-245 (2020) - [c43]Tiziana Calamoneri, Federico Corò:
A Realistic Model for Rescue Operations after an Earthquake. ICTCS 2020: 28-32 - [c42]Tiziana Calamoneri, Federico Corò:
A Realistic Model for Rescue Operations after an Earthquake. Q2SWinet 2020: 123-126
2010 – 2019
- 2019
- [j60]Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti:
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs. Theor. Comput. Sci. 764: 2-14 (2019) - [j59]Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Some classes of graphs that are not PCGs. Theor. Comput. Sci. 791: 62-75 (2019) - [c41]Tiziana Calamoneri, Angelo Di Mambro, Blerina Sinaimeri:
Comparing Related Phylogenetic Trees. ICTCS 2019: 8-13 - 2018
- [j58]Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
On dynamic threshold graphs and related classes. Theor. Comput. Sci. 718: 46-57 (2018) - [c40]Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract). IWOCA 2018: 39-51 - 2017
- [j57]Tiziana Calamoneri:
Report on ICTCS 2017. Bull. EATCS 123 (2017) - [j56]Novella Bartolini, Tiziana Calamoneri, Stefano Ciavarella, Thomas La Porta, Simone Silvestri:
Autonomous Mobile Sensor Placement in Complex Environments. ACM Trans. Auton. Adapt. Syst. 12(2): 7:1-7:28 (2017) - [c39]Mattia Gastaldello, Tiziana Calamoneri, Marie-France Sagot:
Extracting Few Representative Reconciliations with Host Switches. CIBB 2017: 9-18 - [c38]Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani:
Visualizing Co-phylogenetic Reconciliations. GD 2017: 334-347 - [i10]Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Some classes of graphs that are not PCGs. CoRR abs/1707.07436 (2017) - [i9]Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani:
Visualizing Co-Phylogenetic Reconciliations. CoRR abs/1708.09691 (2017) - 2016
- [j55]Tiziana Calamoneri:
Report on ICTCS 2016. Bull. EATCS 120 (2016) - [j54]Tiziana Calamoneri, Blerina Sinaimeri:
Pairwise Compatibility Graphs: A Survey. SIAM Rev. 58(3): 445-460 (2016) - [c37]Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti:
A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees. ICTCS 2016: 103-121 - [c36]Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
On Maximal Chain Subgraphs and Covers of Bipartite Graphs. ICTCS 2016: 286-291 - [c35]Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
On Maximal Chain Subgraphs and Covers of Bipartite Graphs. IWOCA 2016: 137-150 - [c34]Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs. WALCOM 2016: 313-324 - 2015
- [j53]Tiziana Calamoneri:
Optimal L(j, k)-Edge-Labeling of Regular Grids. Int. J. Found. Comput. Sci. 26(4): 523-535 (2015) - [j52]Tiziana Calamoneri, Rossella Petreschi:
Corrigendum to "On pairwise compatibility graphs having Dilworth number two" [Theoret. Comput. Science (2014) 34-40]. Theor. Comput. Sci. 602: 524 (2015) - [i8]Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract). CTW 2015: 20-23 - [i7]Tiziana Calamoneri, Blerina Sinaimeri, Mattia Gastaldello:
On Pairwise Compatibility of Some Graph (Super)Classes. CoRR abs/1504.06454 (2015) - 2014
- [j51]Tiziana Calamoneri, Antonio Frangioni, Blerina Sinaimeri:
Pairwise Compatibility Graphs of Caterpillars. Comput. J. 57(11): 1616-1623 (2014) - [j50]Tiziana Calamoneri:
Report from the Italian Chapter. Bull. EATCS 114 (2014) - [j49]Tiziana Calamoneri, Rossella Petreschi:
On pairwise compatibility graphs having Dilworth number two. Theor. Comput. Sci. 524: 34-40 (2014) - [j48]Tiziana Calamoneri, Rossella Petreschi:
On pairwise compatibility graphs having Dilworth number k. Theor. Comput. Sci. 547: 82-89 (2014) - [c33]Tiziana Calamoneri, Blerina Sinaimeri:
Relating threshold tolerance graphs to other graph classes. ICTCS 2014: 73-79 - [c32]Tiziana Calamoneri, Rossella Petreschi:
On Dilworth k Graphs and Their Pairwise Compatibility. WALCOM 2014: 213-224 - 2013
- [j47]Tiziana Calamoneri, Dario Frascaria, Blerina Sinaimeri:
All Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs. Comput. J. 56(7): 882-886 (2013) - [j46]Tiziana Calamoneri, Blerina Sinaimeri:
L(2, 1)L(2, 1)-labeling of oriented planar graphs. Discret. Appl. Math. 161(12): 1719-1725 (2013) - [j45]Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri:
On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs. Discret. Math. Algorithms Appl. 5(2) (2013) - [j44]Tiziana Calamoneri:
Report from ICTCS 2013. Bull. EATCS 111 (2013) - [j43]Tiziana Calamoneri, Rossella Petreschi:
Graphs with Dilworth Number Two are Pairwise Compatibility Graphs. Electron. Notes Discret. Math. 44: 31-38 (2013) - [j42]Tiziana Calamoneri:
Optimal L(δ1, δ2, 1)-labeling of eight-regular grids. Inf. Process. Lett. 113(10-11): 361-364 (2013) - [j41]Tiziana Calamoneri, Eugenio Montefusco, Rossella Petreschi, Blerina Sinaimeri:
Exploring pairwise compatibility graphs. Theor. Comput. Sci. 468: 23-36 (2013) - 2012
- [j40]Tiziana Calamoneri, Irene Finocchi:
Editorial: Preface to the special issue. Networks 59(3): 265-266 (2012) - [j39]Novella Bartolini, Tiziana Calamoneri, Tom La Porta, Chiara Petrioli, Simone Silvestri:
Sensor activation and radius adaptation (SARA) in heterogeneous sensor networks. ACM Trans. Sens. Networks 8(3): 24:1-24:34 (2012) - [c31]Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri:
On Relaxing the Constraints in Pairwise Compatibility Graphs. WALCOM 2012: 124-135 - [i6]Tiziana Calamoneri, Dario Frascaria, Blerina Sinaimeri:
All graphs with at most seven vertices are Pairwise Compatibility Graphs. CoRR abs/1202.4631 (2012) - 2011
- [j38]Tiziana Calamoneri:
The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography. Comput. J. 54(8): 1344-1371 (2011) - [j37]Tiziana Calamoneri:
The L(2, 1)-Labeling Problem on Oriented Regular Grids. Comput. J. 54(11): 1869-1875 (2011) - [j36]Tiziana Calamoneri, Rossella Petreschi:
The L(2, 1)-labeling of unigraphs. Discret. Appl. Math. 159(12): 1196-1206 (2011) - [j35]Tiziana Calamoneri, Josep Díaz:
Editorial. J. Discrete Algorithms 9(3): 213 (2011) - [j34]Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi:
Recognition of Unigraphs through Superposition of Graphs. J. Graph Algorithms Appl. 15(3): 323-343 (2011) - [j33]Novella Bartolini, Tiziana Calamoneri, Annalisa Massini, Simone Silvestri:
On Adaptive Density Deployment to Mitigate the Sink-Hole Problem in Mobile Sensor Networks. Mob. Networks Appl. 16(1): 134-145 (2011) - [j32]Novella Bartolini, Tiziana Calamoneri, Thomas F. La Porta, Simone Silvestri:
Autonomous Deployment of Heterogeneous Mobile Sensors. IEEE Trans. Mob. Comput. 10(6): 753-766 (2011) - [j31]Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri:
Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks. IEEE Trans. Parallel Distributed Syst. 22(2): 208-216 (2011) - [c30]Tiziana Calamoneri, Blerina Sinaimeri:
Labeling of Oriented Planar Graphs. CTW 2011: 93-96 - [c29]Tiziana Calamoneri, Rossella Petreschi:
L(2, 1)-Labeling of Unigraphs - (Extended Abstract). TAPAS 2011: 57-68 - [i5]Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri:
On relaxing the constraints in pairwise compatibility graphs. CoRR abs/1105.2171 (2011) - 2010
- [j30]Novella Bartolini, Tiziana Calamoneri, Emanuele G. Fusco, Annalisa Massini, Simone Silvestri:
Push & Pull: autonomous deployment of mobile sensors for a complete coverage. Wirel. Networks 16(3): 607-625 (2010) - [c28]Novella Bartolini, Tiziana Calamoneri, Thomas La Porta, Simone Silvestri:
Mobile Sensor Deployment in Unknown Fields. INFOCOM 2010: 471-475 - [e2]Tiziana Calamoneri, Josep Díaz:
Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings. Lecture Notes in Computer Science 6078, Springer 2010, ISBN 978-3-642-13072-4 [contents] - [i4]Novella Bartolini, Tiziana Calamoneri, Tom La Porta, Chiara Petrioli, Simone Silvestri:
Sensor Activation and Radius Adaptation (SARA) in Heterogeneous Sensor Networks. CoRR abs/1009.6098 (2010)
2000 – 2009
- 2009
- [j29]Tiziana Calamoneri, Annalisa Massini, L'ubomír Török, Imrich Vrto:
Antibandwidth of complete k-ary trees. Discret. Math. 309(22): 6408-6414 (2009) - [j28]Tiziana Calamoneri, Emanuele G. Fusco, Richard B. Tan, Paola Vocca:
L ( h , 1, 1)-labeling of outerplanar graphs. Math. Methods Oper. Res. 69(2): 307-321 (2009) - [j27]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) - [c27]Novella Bartolini, Tiziana Calamoneri, Thomas La Porta, Annalisa Massini, Simone Silvestri:
Autonomous deployment of heterogeneous mobile sensors. ICNP 2009: 42-51 - [c26]Tiziana Calamoneri:
The L(2, 1)-Labeling Problem on Oriented Regular Grids. ICTCS 2009: 62-65 - [c25]Novella Bartolini, Tiziana Calamoneri, Annalisa Massini, Simone Silvestri:
Variable Density Deployment and Topology Control for the Solution of the Sink-Hole Problem. QSHINE 2009: 167-182 - [c24]Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi:
Recognition of Unigraphs through Superposition of Graphs (Extended Abstract). WALCOM 2009: 165-176 - [i3]Tiziana Calamoneri:
The L(2, 1)-Labeling Problem on Oriented Regular Grids. CoRR abs/0905.1780 (2009) - 2008
- [j26]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) - [j25]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) - [c23]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 - [c22]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 - [c21]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 - [c20]Tiziana Calamoneri, Emanuele G. Fusco, Andrzej Pelc:
Impact of Information on the Complexity of Asynchronous Radio Broadcasting. OPODIS 2008: 311-330 - [i2]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) - [i1]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) - 2007
- [c19]Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi:
On the L(h, k)-Labeling of Co-comparability Graphs. ESCAPE 2007: 116-127 - [c18]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 - [c17]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
- [j24]Tiziana Calamoneri:
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography. Comput. J. 49(5): 585-608 (2006) - [j23]Tiziana Calamoneri, Rossella Petreschi:
lambda-Coloring matrogenic graphs. Discret. Appl. Math. 154(17): 2445-2457 (2006) - [j22]Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi:
Labeling trees with a condition at distance two. Discret. Math. 306(14): 1534-1539 (2006) - [j21]Tiziana Calamoneri:
Optimal L(h, k)-Labeling of Regular Grids. Discret. Math. Theor. Comput. Sci. 8(1): 141-158 (2006) - [j20]Tiziana Calamoneri, Annalisa Massini, Lubomir Torok, Imrich Vrto:
Antibandwidth of Complete k-Ary Trees. Electron. Notes Discret. Math. 24: 259-266 (2006) - [j19]Tiziana Calamoneri, Annalisa Massini:
Nearly optimal three dimensional layout of hypercube networks. Networks 47(1): 1-8 (2006) - [c16]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 - [c15]Tiziana Calamoneri, Emanuele G. Fusco, Richard B. Tan, Paola Vocca:
L(h, 1, 1)-Labeling of Outerplanar Graphs. SIROCCO 2006: 268-279 - [e1]Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano:
Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings. Lecture Notes in Computer Science 3998, Springer 2006, ISBN 3-540-34375-X [contents] - 2005
- [j18]Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi:
A general approach to L(h, k)-label interconnection networks. Electron. Notes Discret. Math. 19: 211-217 (2005) - [c14]Tiziana Calamoneri, Irene Finocchi, Rossella Petreschi:
Graph Coloring with Distance Constraints. PDPTA 2005: 131-140 - [c13]Tiziana Calamoneri, Paola Vocca:
On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract). SIROCCO 2005: 65-77 - 2004
- [j17]Tiziana Calamoneri, Annalisa Massini:
Efficient algorithms for checking the equivalence of multistage interconnection networks. J. Parallel Distributed Comput. 64(1): 135-150 (2004) - [j16]Tiziana Calamoneri, Rossella Petreschi:
L(h, 1)-labeling subclasses of planar graphs. J. Parallel Distributed Comput. 64(3): 414-426 (2004) - 2003
- [j15]Tiziana Calamoneri, Rossella Petreschi, Andrzej Pelc:
Labeling trees with a condition at distance two. Electron. Notes Discret. Math. 15: 55-58 (2003) - [j14]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 Distributed Comput. 63(11): 1017-1025 (2003) - [j13]Tiziana Calamoneri, Annalisa Massini, Imrich Vrto:
New results on edge-bandwidth. Theor. Comput. Sci. 307(3): 503-513 (2003) - [c12]Tiziana Calamoneri, Annalisa Massini:
Nearly Optimal Three Dimensional Layout of Hypercube Networks. GD 2003: 247-258 - [c11]Tiziana Calamoneri:
Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks. ICTCS 2003: 163-173 - 2002
- [j12]Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi:
On max cut in cubic graphs. Parallel Algorithms Appl. 17(3): 165-183 (2002) - [c10]Tiziana Calamoneri, Rossella Petreschi:
On the Radiocoloring Problem. IWDC 2002: 118-127 - [c9]Tiziana Calamoneri, Rossella Petreschi:
L(2, 1)-Coloring Matrogenic Graphs. LATIN 2002: 236-247 - 2001
- [j11]Tiziana Calamoneri, Rossella Petreschi:
LD-Coloring of Regular Tiling (Extended Abstract). Electron. Notes Discret. Math. 8: 18-21 (2001) - [j10]Tiziana Calamoneri, Rossella Petreschi:
Edge-clique graphs and the l-coloring problem. J. Braz. Comput. Soc. 7(3): 38-47 (2001) - [j9]Tiziana Calamoneri, Annalisa Massini:
Optimal three-dimensional layout of interconnection networks. Theor. Comput. Sci. 255(1-2): 263-279 (2001) - [c8]Tiziana Calamoneri, Rossella Petreschi:
L(2, 1)-labeling of planar graphs. DIAL-M 2001: 28-33 - 2000
- [j8]Tiziana Calamoneri, Stephan Olariu, Rossella Petreschi:
A Simple Parallel Algorithm to Draw Cubic Graphs. IEEE Trans. Parallel Distributed Syst. 11(10): 1009-1018 (2000)
1990 – 1999
- 1999
- [j7]Tiziana Calamoneri, Rossella Petreschi:
Optimal Layout of Trivalent Cayley Interconnection Networks. Int. J. Found. Comput. Sci. 10(3): 277-288 (1999) - [j6]Tiziana Calamoneri, Annalisa Massini:
An optimal layout of multigrid networks. Inf. Process. Lett. 72(3-4): 137-141 (1999) - [j5]Tiziana Calamoneri, Simone Jannelli, Rossella Petreschi:
Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs. J. Graph Algorithms Appl. 3(2): 1-23 (1999) - [c7]Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi:
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. ASIAN 1999: 27-36 - 1998
- [j4]Tiziana Calamoneri, Rossella Petreschi:
Orthogonally Drawing Cubic Graphs in Parallel. J. Parallel Distributed Comput. 55(1): 94-108 (1998) - [j3]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) - [c6]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 - 1997
- [j2]Tiziana Calamoneri, Rossella Petreschi:
A New 3D Representation of Trivalent Cayley Networks. Inf. Process. Lett. 61(5): 247-252 (1997) - [j1]Tiziana Calamoneri, Andrea Sterbini:
3D Straight-Line Grid Drawing of 4-Colorable Graphs. Inf. Process. Lett. 63(2): 97-102 (1997) - [c5]Tiziana Calamoneri, Annalisa Massini:
On Three-Dimensional Layout of Interconnection Networks. GD 1997: 64-75 - 1996
- [c4]Tiziana Calamoneri, Andrea Sterbini:
Drawing 2-, 3- and 4-colorable Graphs in O(n2) Volume. GD 1996: 53-62 - [c3]Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg:
A Tight Layout of the Butterfly Network. SPAA 1996: 170-175 - [c2]Paola Alimonti, Tiziana Calamoneri:
Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. WG 1996: 2-16 - 1995
- [c1]Tiziana Calamoneri, Rossella Petreschi:
An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs. COCOON 1995: 31-40
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
