2 citations · 2 across the 4 of their papers we have counts for
6 papers
Pairwise Compatibility Graphs of Unweighted Caterpillars
Cyriac Antony, Manuel Lafond, Angelo Monti +1
In this paper we study pairwise compatibility graphs whose witness tree is required to be an unweighted caterpillar. This is a natural restriction of PCGs, in the same line of rese…
On the hardness of recognizing graphs of small mim-width and its variants
Max Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye
The mim-width of a graph is a powerful structural parameter that, when bounded by a constant, allows several hard problems to be polynomial-time solvable - with a recent meta-theor…
Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete
Max Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye
Leaf powers and pairwise compatibility graphs were introduced over twenty years ago as simplified graph models for phylogenetic trees. Despite significant research, several propert…
Galled Perfect Transfer Networks
Alitzel López Sánchez, Manuel Lafond
Predicting horizontal gene transfers often requires comparative sequence data, but recent work has shown that character-based approaches could also be useful for this task. Notably…
-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for
Max Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye +1
A graph is a -leaf power if there is a tree whose leaves are the vertices of with the property that a pair of leaves and induce an edge in if and o…
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…