20 citations · 29 across the 19 of their papers we have counts for
8 papers · 1 filter
Predicting Horizontal Gene Transfers with Perfect Transfer Networks
Alitzel López Sánchez, Manuel Lafond
Horizontal gene transfer inference approaches are usually based on gene sequences: parametric methods search for patterns that deviate from a particular genomic signature, while ph…
Parameterized Complexity of Domination Problems Using Restricted Modular Partitions
Manuel Lafond, Weidong Luo
For a graph class , we define the -modular cardinality of a graph as the minimum size of a vertex partition of into modules that each induces a gr…
An FTP Algorithm for Temporal Graph Untangling
Riccardo Dondi, Manuel Lafond
Several classical combinatorial problems have been considered and analysed on temporal graphs. Recently, a variant of Vertex Cover on temporal graphs, called MinTimelineCover, has…
Preprocessing Complexity for Some Graph Problems Parameterized by Structural Parameters
Manuel Lafond, Weidong Luo
Structural graph parameters play an important role in parameterized complexity, including in kernelization. Notably, vertex cover, neighborhood diversity, twin-cover, and modular-w…
A lightweight semi-centralized strategy for the massive parallelization of branching algorithms
Andres Pastrana-Cruz, Manuel Lafond
Several NP-hard problems are solved exactly using exponential-time branching strategies, whether it be branch-and-bound algorithms, or bounded search trees in fixed-parameter algor…
Finding agreement cherry-reduced subnetworks in level-1 networks
Kaari Landry, Olivier Tremblay-Savard, Manuel Lafond
Phylogenetic networks are increasingly being considered as better suited to represent the complexity of the evolutionary relationships between species. One class of phylogenetic ne…
The Longest Subsequence-Repeated Subsequence Problem
Manuel Lafond, Wenfeng Lai, Adiesha Liyanage +1
Motivated by computing duplication patterns in sequences, a new fundamental problem called the longest subsequence-repeated subsequence (LSRS) is proposed. Given a sequence of…
The Two-Squirrel Problem and Its Relatives
Sergey Bereg, Yuya Higashikawa, Naoki Katoh +3
In this paper, we start with a variation of the star cover problem called the Two-Squirrel problem. Given a set of points in the plane, and two sites and , comp…