2 citations · 2 across the 4 of their papers we have counts for
3 papers · 1 filter
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…
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…