28 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Lyon 1 UniversitéFR5 papers
- Libera Università Internazionale degli Studi Sociali Guido CarliIT3 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Données et algorithmes pour une ville intelligente et durableFR2 papers
- Institut national de recherche en sciences et technologies du numériqueFR2 papers
- Sapienza University of RomeIT2 papers
- Université de Versailles Saint-Quentin-en-YvelinesFR2 papers
- Centrum Wiskunde & InformaticaNL1 paper
- Google (United States)US1 paper
- King's College LondonGB1 paper
- Laboratoire de Biométrie et Biologie EvolutiveFR1 paper
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR1 paper
3 papers · 1 filter
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…
Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension
Laurent Beaudou, Florent Foucaud, Peter Dankelmann +3
The metric dimension of a graph is the minimum size of a set of vertices such that each vertex is uniquely determined by the distances to the vertices of that set. Our aim is to up…