|
+
PDF
Chat
|
Cluster Editing on Cographs and Related Classes
|
2024
|
Manuel Lafond
Alitzel López Sánchez
Weidong Luo
|
|
+
PDF
Chat
|
Improved Kernelization and Fixed-parameter Algorithms for Bicluster
Editing
|
2024
|
Manuel Lafond
|
|
+
|
On Generalizations of Pairwise Compatibility Graphs
|
2024
|
Tiziana Calamoneri
Manuel Lafond
Angelo Monti
Blerina Sinaimeri
|
|
+
PDF
Chat
|
Galled Perfect Transfer Networks
|
2024
|
Alitzel López Sánchez
Manuel Lafond
|
|
+
PDF
Chat
|
Path Partitions of Phylogenetic Networks
|
2024
|
Manuel Lafond
Vincent Moulton
|
|
+
PDF
Chat
|
The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees
|
2024
|
Alitzel López Sánchez
José Antonio Ramírez-Rafael
Alejandro Flores-Lamas
Maribel Hernández-Rosales
Manuel Lafond
|
|
+
PDF
Chat
|
$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden
Induced Subgraphs for $k \geq 5$
|
2024
|
Max Dupré la Tour
Manuel Lafond
Ndiamé Ndiaye
Adrian Vetta
|
|
+
|
Median and small parsimony problems on RNA trees
|
2024
|
Bertrand Marchand
Yoann Anselmetti
Manuel Lafond
Aïda Ouangraoua
|
|
+
PDF
Chat
|
Finding Maximum Common Contractions Between Phylogenetic Networks
|
2024
|
Bertrand Marchand
Nadia Tahiri
Olivier Tremblay-Savard
Manuel Lafond
|
|
+
PDF
Chat
|
Median and Small Parsimony Problems on RNA trees
|
2024
|
Bertrand Marchand
Yoann Anselmetti
Manuel Lafond
Aïda Ouangraoua
|
|
+
|
Recognizing <i>k</i> -Leaf Powers in Polynomial Time, for Constant <i>k</i>
|
2023
|
Manuel Lafond
|
|
+
PDF
Chat
|
A lightweight semi-centralized strategy for the massive parallelization of branching algorithms
|
2023
|
Andres Pastrana-Cruz
Manuel Lafond
|
|
+
|
The Two-Squirrel Problem and Its Relatives
|
2023
|
Sergey Bereg
Yuya Higashikawa
Naoki Katoh
Manuel Lafond
Yuki Tokuni
Binhai Zhu
|
|
+
|
Finding agreement cherry-reduced subnetworks in level-1 networks
|
2023
|
Kaari Landry
Olivier Tremblay-Savard
Manuel Lafond
|
|
+
|
Preprocessing Complexity for Some Graph Problems Parameterized by Structural Parameters
|
2023
|
Manuel Lafond
Weidong Luo
|
|
+
|
An FTP Algorithm for Temporal Graph Untangling
|
2023
|
Riccardo Dondi
Manuel Lafond
|
|
+
|
Parameterized Complexity of Domination Problems Using Restricted Modular Partitions
|
2023
|
Manuel Lafond
Weidong Luo
|
|
+
PDF
Chat
|
Finding Agreement Cherry-Reduced Subnetworks in Level-1 Networks
|
2023
|
Kaari Landry
Olivier Tremblay-Savard
Manuel Lafond
|
|
+
|
Preprocessing complexity for some graph problems parameterized by structural parameters
|
2023
|
Manuel Lafond
Weidong Luo
|
|
+
|
Predicting Horizontal Gene Transfers with Perfect Transfer Networks
|
2023
|
Alitzel López Sánchez
Manuel Lafond
|
|
+
PDF
Chat
|
Further results on Hendry's Conjecture
|
2022
|
Manuel Lafond
Ben Seamone
Rezvan Sherkati
|
|
+
PDF
Chat
|
Recognizing <i>k</i>-leaf powers in polynomial time, for constant <i>k</i>
|
2022
|
Manuel Lafond
|
|
+
|
Relative Timing Information and Orthology in Evolutionary Scenarios
|
2022
|
David Schaller
Tom Hartmann
Manuel Lafond
Nicolas Wieseke
Marc Hellmuth
Peter F. Stadler
|
|
+
PDF
Chat
|
Edge clique covers in graphs with independence number two
|
2021
|
Pierre Charbit
Geňa Hahn
Marcin Kamiński
Manuel Lafond
Nicolas Lichiardopol
Reza Naserasr
Ben Seamone
Rezvan Sherkati
|
|
+
|
On Generalizations of Pairwise Compatibility Graphs
|
2021
|
Tiziana Calamoneri
Manuel Lafond
Angelo Monti
Blerina Sinaimeri
|
|
+
|
Recognizing k-leaf powers in polynomial time, for constant k
|
2021
|
Manuel Lafond
|
|
+
|
Indirect Identification of Horizontal Gene Transfer
|
2020
|
David Schaller
Manuel Lafond
Peter F. Stadler
Nicolas Wieseke
Marc Hellmuth
|
|
+
PDF
Chat
|
Time-energy tradeoffs for evacuation by two robots in the wireless model
|
2020
|
Jurek Czyzowicz
Konstantinos Georgiou
Ryan Killick
Evangelos Kranakis
Danny Kriz̧anc
Manuel Lafond
Lata Narayanan
Jaroslav Opatrný
Sunil Shende
|
|
+
PDF
Chat
|
Reconstruction of time-consistent species trees
|
2020
|
Manuel Lafond
Marc Hellmuth
|
|
+
PDF
Chat
|
Reconstruction of time-consistent species trees
|
2020
|
Manuel Lafond
Marc Hellmuth
|
|
+
PDF
Chat
|
Comparing copy-number profiles under multi-copy amplifications and deletions
|
2020
|
Garance Cordonnier
Manuel Lafond
|
|
+
|
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms
|
2020
|
Manuel Lafond
Binhai Zhu
Peng Zou
|
|
+
|
Further results on Hendry's Conjecture
|
2020
|
Manuel Lafond
Ben Seamone
Rezvan Sherkati
|
|
+
|
Indirect Identification of Horizontal Gene Transfer
|
2020
|
David Schaller
Manuel Lafond
Peter F. Stadler
Nicolas Wieseke
Marc Hellmuth
|
|
+
|
Comparing copy-number profiles under multi-copy amplifications and deletions
|
2020
|
Garance Cordonnier
Manuel Lafond
|
|
+
|
Reconstruction of time-consistent species trees
|
2019
|
Manuel Lafond
Marc Hellmuth
|
|
+
PDF
Chat
|
Weak Coverage of a Rectangular Barrier
|
2019
|
Stefan Dobrev
Evangelos Kranakis
Danny Kriz̧anc
Manuel Lafond
Ján Maňuch
Lata Narayanan
Jaroslav Opatrný
Ladislav Stacho
|
|
+
|
Distributed Pattern Formation in a Ring
|
2019
|
Anne-Laure Ehresmann
Manuel Lafond
Lata Narayanan
Jaroslav Opatrný
|
|
+
PDF
Chat
|
Reconciling multiple genes trees via segmental duplications and losses
|
2019
|
Riccardo Dondi
Manuel Lafond
Céline Scornavacca
|
|
+
|
The Tandem Duplication Distance is NP-hard
|
2019
|
Manuel Lafond
Binhai Zhu
Peng Zou
|
|
+
PDF
Chat
|
Distributed Pattern Formation in a Ring
|
2019
|
Anne-Laure Ehresmann
Manuel Lafond
Lata Narayanan
Jaroslav Opatrný
|
|
+
PDF
Chat
|
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model
|
2019
|
Jurek Czyzowicz
Konstantinos Georgiou
Ryan Killick
Evangelos Kranakis
Danny Kriz̧anc
Manuel Lafond
Lata Narayanan
Jaroslav Opatrný
Sunil Shende
|
|
+
|
Distributed Pattern Formation in a Ring
|
2019
|
Anne-Laure Ehresmann
Manuel Lafond
Lata Narayanan
Jaroslav Opatrný
|
|
+
|
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model
|
2019
|
Jurek Czyzowicz
Κωνσταντίνος Γεωργίου
Ryan Killick
Evangelos Kranakis
Danny Kriz̧anc
Manuel Lafond
Lata Narayanan
Jaroslav Opatrný
Sunil Shende
|
|
+
|
Reconstruction of time-consistent species trees
|
2019
|
Manuel Lafond
Marc Hellmuth
|
|
+
|
Energy Consumption of Group Search on a Line
|
2019
|
Jurek Czyzowicz
Κωνσταντίνος Γεωργίου
Ryan Killick
Evangelos Kranakis
Danny Kriz̧anc
Manuel Lafond
Lata Narayanan
Jaroslav Opatrný
Sunil Shende
|
|
+
|
On the Weighted Quartet Consensus problem
|
2018
|
Manuel Lafond
Céline Scornavacca
|
|
+
|
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics
|
2018
|
Manuel Lafond
Nadia El-Mabrouk
Katharina T. Huber
Vincent Moulton
|
|
+
|
Whom to befriend to influence people
|
2018
|
Gennaro Cordasco
Luisa Gargano
Manuel Lafond
Lata Narayanan
Adele A. Rescigno
Ugo Vaccaro
Kangkang Wu
|
|
+
|
Satisfying Neighbor Preferences on a Circle
|
2018
|
Danny Kriz̧anc
Manuel Lafond
Lata Narayanan
Jaroslav Opatrný
Sunil Shende
|
|
+
PDF
Chat
|
On the Weighted Quartet Consensus problem
|
2018
|
Manuel Lafond
Céline Scornavacca
|
|
+
|
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics
|
2018
|
Manuel Lafond
Nadia El-Mabrouk
Katharina T. Huber
Vincent Moulton
|
|
+
PDF
Chat
|
Gene Tree Construction and Correction Using SuperTree and Reconciliation
|
2017
|
Manuel Lafond
Cédric Chauve
Nadia El-Mabrouk
Aïda Ouangraoua
|
|
+
|
Consistency of orthology and paralogy constraints in the presence of gene transfers.
|
2017
|
Mark Jones
Manuel Lafond
Céline Scornavacca
|
|
+
|
On strongly chordal graphs that are not leaf powers
|
2017
|
Manuel Lafond
|
|
+
PDF
Chat
|
Weak Coverage of a Rectangular Barrier
|
2017
|
Stefan Dobrev
Evangelos Kranakis
Danny Kriz̧anc
Manuel Lafond
Ján Maňuch
Lata Narayanan
Jaroslav Opatrny
Sunil Shende
Ladislav Stacho
|
|
+
PDF
Chat
|
On Strongly Chordal Graphs That Are Not Leaf Powers
|
2017
|
Manuel Lafond
|
|
+
|
Constructing a Consensus Phylogeny from a Leaf-Removal Distance
|
2017
|
Cédric Chauve
Mark Jones
Manuel Lafond
Céline Scornavacca
Mathias Weller
|
|
+
|
Consistency of orthology and paralogy constraints in the presence of gene transfers
|
2017
|
Mark M. Jones
Manuel Lafond
Céline Scornavacca
|
|
+
|
On strongly chordal graphs that are not leaf powers
|
2017
|
Manuel Lafond
|
|
+
|
Weak Coverage of a Rectangular Barrier
|
2017
|
Stefan Dobrev
Evangelos Kranakis
Danny Kriz̧anc
Manuel Lafond
Ján Maňuch
Lata Narayanan
Jaroslav Opatrny
Ladislav Stacho
|
|
+
|
On the Weighted Quartet Consensus problem
|
2016
|
Manuel Lafond
Céline Scornavacca
|
|
+
|
How brokers can optimally plot against traders
|
2016
|
Manuel Lafond
|
|
+
PDF
Chat
|
Whom to Befriend to Influence People
|
2016
|
Manuel Lafond
Lata Narayanan
Kangkang Wu
|
|
+
|
On the Weighted Quartet Consensus problem
|
2016
|
Manuel Lafond
Céline Scornavacca
|
|
+
|
Gene Tree Construction and Correction using SuperTree and Reconciliation
|
2016
|
Manuel Lafond
Cédric Chauve
Nadia El-Mabrouk
Aïda Ouangraoua
|
|
+
|
Whom to befriend to influence people
|
2016
|
Gennaro Cordasco
Luisa Gargano
Manuel Lafond
Lata Narayanan
Adele A. Rescigno
Ugo Vaccaro
Kangkang Wu
|
|
+
|
How brokers can optimally plot against traders
|
2016
|
Manuel Lafond
|
|
+
|
Reconstructing protein and gene phylogenies by extending the framework of reconciliation
|
2016
|
Esaie Kuitche
Manuel Lafond
Aïda Ouangraoua
|
|
+
|
Hamiltonian Chordal Graphs are not Cycle Extendable
|
2015
|
Manuel Lafond
Ben Seamone
|
|
+
|
Hamiltonian chordal graphs are not cycle extendible
|
2013
|
Manuel Lafond
Ben Seamone
|