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
9 papers
Cophylogeny Reconstruction Allowing for Multiple Associations Through Approximate Bayesian Computation
Blerina Sinaimeri, Laura Urbini, Marie-France Sagot +1
Phylogenetic tree reconciliation is employed for the examination of coevolution between host and symbiont species. An important concern is the requirement for dependable cost value…
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…
Longest Property-Preserved Common Factor
Lorraine A. K Ayad, Giulia Bernardini, Roberto Grossi +4
In this paper we introduce a new family of string processing problems. We are given two or more strings and we are asked to compute a factor common to all strings that preserves a…
Decremental SPQR-trees for Planar Graphs
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz +2
We present a decremental data structure for maintaining the SPQR-tree of a planar graph subject to edge contractions and deletions. The update time, amortized over operation…
An image representation based convolutional network for DNA classification
Bojian Yin, Marleen Balvert, Davide Zambrano +2
The folding structure of the DNA molecule combined with helper molecules, also referred to as the chromatin, is highly relevant for the functional properties of DNA. The chromatin…
Efficient enumeration of solutions produced by closure operations
Arnaud Mary, Yann Strozecki
In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the c…
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…
Efficient enumeration of solutions produced by closure operations
Arnaud Mary, Yann Strozecki
In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the c…