2 citations · 5 across the 11 of their papers we have counts for
14 papers
(Eternal) Vertex Cover Number of Infinite and Finite Grid Graphs
Tiziana Calamoneri, Federico Corò
In the eternal vertex cover problem, mobile guards on the vertices of a graph are used to defend it against an infinite sequence of attacks on its edges by moving to neighbor verti…
Multi-Depot Multi-Trip Vehicle Routing with Total Completion Time Minimization
Tiziana Calamoneri, Federico Corò, Simona Mancini
Unmanned aerial vehicles (UAVs) are aircraft whose flights can be fully autonomous without any provision for human intervention. One of the most useful and promising domains where…
All Graphs with at most 8 nodes are 2-interval-PCGs
Tiziana Calamoneri, Angelo Monti, Fabrizio Petroni
A graph G is a multi-interval PCG if there exist an edge weighted tree T with non-negative real values and disjoint intervals of the non-negative real half-line such that each node…
On the domination number of -constrained de Bruijn graphs
Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri
Motivated by the work on the domination number of directed de Bruijn graphs and some of its generalizations, in this paper we introduce a natural generalization of de Bruijn graphs…
On Generalizations of Pairwise Compatibility Graphs
Tiziana Calamoneri, Manuel Lafond, Angelo Monti +1
A graph is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval , such that each leaf of the tree is a vertex of the graph, and there i…
Visualizing Co-Phylogenetic Reconciliations
Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini +1
We introduce a hybrid metaphor for the visualization of the reconciliations of co-phylogenetic trees, that are mappings among the nodes of two trees. The typical application is the…