Privacy invasion in business environments. - Manuel Lafond; Pierre-Olivier Brosseau; Esma Aïmeur (PST, 2012)

An Optimal Reconciliation Algorithm for Gene Trees with Polytomies. - Manuel Lafond; Krister M. Swenson; Nadia El-Mabrouk (WABI, 2012)

Error Detection and Correction of Gene Trees. - Manuel Lafond; Krister M. Swenson; Nadia El-Mabrouk (Models and Algorithms for Genome Evolution, 2013)

The Scourge of Internet Personal Data Collection. - Esma Aïmeur; Manuel Lafond (ARES, 2013)

Gene tree correction guided by orthology. - Manuel Lafond; Magali Semeria; Krister M. Swenson; Eric Tannier; Nadia El-Mabrouk (BMC Bioinform., 2013)

Hamiltonian chordal graphs are not cycle extendible. - Manuel Lafond; Ben Seamone (CoRR, 2013)

Polytomy refinement for the correction of dubious duplications in gene trees. - Manuel Lafond; Cédric Chauve; Riccardo Dondi; Nadia El-Mabrouk (Bioinform., 2014)

Orthology Relation and Gene Tree Correction: Complexity Results. - Manuel Lafond; Nadia El-Mabrouk (WABI, 2015)

Hamiltonian Chordal Graphs are not Cycle Extendable. - Manuel Lafond; Ben Seamone (SIAM J. Discret. Math., 2015)

Reconstructing a SuperGeneTree minimizing reconciliation. - Manuel Lafond; Aïda Ouangraoua; Nadia El-Mabrouk (BMC Bioinform., 2015)

Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost. - Manuel Lafond; Emmanuel Noutahi; Nadia El-Mabrouk (CPM, 2016)

Whom to Befriend to Influence People. - Manuel Lafond; Lata Narayanan; Kangkang Wu (SIROCCO, 2016)

Correction of Weighted Orthology and Paralogy Relations - Complexity and Algorithmic Results. - Riccardo Dondi; Nadia El-Mabrouk; Manuel Lafond (WABI, 2016)

The link between orthology relations and gene trees: a correction perspective. - Manuel Lafond; Riccardo Dondi; Nadia El-Mabrouk (Algorithms Mol. Biol., 2016)

Weak Coverage of a Rectangular Barrier. - Stefan Dobrev; Evangelos Kranakis; Danny Krizanc; Manuel Lafond; Ján Manuch; Lata Narayanan; Jaroslav Opatrny; Sunil M. Shende; Ladislav Stacho (CIAC, 2017)

Optimal Local Buffer Management for Information Gathering with Adversarial Traffic. - Stefan Dobrev; Manuel Lafond; Lata Narayanan; Jaroslav Opatrny (SPAA, 2017)

Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract). - Cédric Chauve; Mark Jones 001; Manuel Lafond; Céline Scornavacca; Mathias Weller (SPIRE, 2017)

On Strongly Chordal Graphs That Are Not Leaf Powers. - Manuel Lafond (WG, 2017)

Approximating the correction of weighted and unweighted orthology and paralogy relations. - Riccardo Dondi; Manuel Lafond; Nadia El-Mabrouk (Algorithms Mol. Biol., 2017)

Constructing a Consensus Phylogeny from a Leaf-Removal Distance. - Cédric Chauve; Mark Jones 001; Manuel Lafond; Céline Scornavacca; Mathias Weller (CoRR, 2017)

Consistency of orthology and paralogy constraints in the presence of gene transfers. - Mark Jones 001; Manuel Lafond; Céline Scornavacca (CoRR, 2017)

On strongly chordal graph that are not leaf powers. - Manuel Lafond (CoRR, 2017)

Reconstructing protein and gene phylogenies using reconciliation and soft-clustering. - Esaie Kuitche; Manuel Lafond; Aïda Ouangraoua (J. Bioinform. Comput. Biol., 2017)

Rearrangement moves on rooted phylogenetic networks. - Philippe Gambette; Leo van Iersel; Mark Jones 001; Manuel Lafond; Fabio Pardi; Céline Scornavacca (PLoS Comput. Biol., 2017)

Editing Graphs to Satisfy Diversity Requirements. - Huda Chuangpishit; Manuel Lafond; Lata Narayanan (COCOA, 2018)

The complexity of speedrunning video games. - Manuel Lafond (FUN, 2018)

Satisfying Neighbor Preferences on a Circle. - Danny Krizanc; Manuel Lafond; Lata Narayanan; Jaroslav Opatrny; Sunil M. Shende (LATIN, 2018)

Reconstructing the History of Syntenies Through Super-Reconciliation. - Mattéo Delabre; Nadia El-Mabrouk; Katharina T. Huber; Manuel Lafond; Vincent Moulton; Emmanuel Noutahi; Miguel Sautie Castellanos (RECOMB-CG, 2018)

The Rooted SCJ Median with Single Gene Duplications. - Aniket C. Mane; Manuel Lafond; Pedro Feijão; Cédric Chauve (RECOMB-CG, 2018)

Accurate prediction of orthologs in the presence of divergence after duplication. - Manuel Lafond; Mona Meghdari Miardan; David Sankoff (Bioinform., 2018)

Gene Tree Construction and Correction Using SuperTree and Reconciliation. - Manuel Lafond; Cédric Chauve; Nadia El-Mabrouk; Aïda Ouangraoua (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

Energy Consumption of Group Search on a Line. - Jurek Czyzowicz; Konstantinos Georgiou; Ryan Killick; Evangelos Kranakis; Danny Krizanc; Manuel Lafond; Lata Narayanan; Jaroslav Opatrny; Sunil M. Shende (ICALP, 2019)

Distributed Pattern Formation in a Ring. - Anne-Laure Ehresmann; Manuel Lafond; Lata Narayanan; Jaroslav Opatrny (SIROCCO, 2019)

Reconciling multiple genes trees via segmental duplications and losses. - Riccardo Dondi; Manuel Lafond; Céline Scornavacca (Algorithms Mol. Biol., 2019)

The SCJ Small Parsimony Problem for Weighted Gene Adjacencies. - Nina Luhmann; Manuel Lafond; Annelyse Thévenin; Aïda Ouangraoua; Roland Wittler; Cédric Chauve (IEEE ACM Trans. Comput. Biol. Bioinform., 2019)

The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics. - Manuel Lafond; Nadia El-Mabrouk; Katharina T. Huber; Vincent Moulton (Theor. Comput. Sci., 2019)

On the Weighted Quartet Consensus problem. - Manuel Lafond; Céline Scornavacca (Theor. Comput. Sci., 2019)

Even Better Fixed-Parameter Algorithms for Bicluster Editing. - Manuel Lafond (COCOON, 2020)

Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms. - Manuel Lafond; Binhai Zhu; Peng Zou (CPM, 2020)

The Tandem Duplication Distance Is NP-Hard. - Manuel Lafond; Binhai Zhu; Peng Zou (STACS, 2020)

Weak Coverage of a Rectangular Barrier. - Stefan Dobrev; Evangelos Kranakis; Danny Krizanc; Manuel Lafond; Ján Manuch; Lata Narayanan; Jaroslav Opatrny; Ladislav Stacho (Algorithmica, 2020)

Evolution through segmental duplications and losses: a Super-Reconciliation approach. - Mattéo Delabre; Nadia El-Mabrouk; Katharina T. Huber; Manuel Lafond; Vincent Moulton; Emmanuel Noutahi; Miguel Sautie Castellanos (Algorithms Mol. Biol., 2020)

Reconstruction of time-consistent species trees. - Manuel Lafond; Marc Hellmuth (Algorithms Mol. Biol., 2020)

The distance and median problems in the single-cut-or-join model with single-gene duplications. - Aniket C. Mane; Manuel Lafond; Pedro Cipriano Feijão; Cédric Chauve (Algorithms Mol. Biol., 2020)

A generalized Robinson-Foulds distance for labeled trees. - Samuel Briand; Christophe Dessimoz; Nadia El-Mabrouk; Manuel Lafond; Gabriela Lobinska (BMC Genom., 2020)

Comparing copy-number profiles under multi-copy amplifications and deletions. - Garance Cordonnier; Manuel Lafond (CoRR, 2020)

Indirect Identification of Horizontal Gene Transfer. - David Schaller 001; Manuel Lafond; Peter F. Stadler; Nicolas Wieseke; Marc Hellmuth (CoRR, 2020)

Whom to befriend to influence people. - Gennaro Cordasco; Luisa Gargano; Manuel Lafond; Lata Narayanan; Adele A. Rescigno; Ugo Vaccaro; Kangkang Wu (Theor. Comput. Sci., 2020)

Novel Phylogenetic Network Distances Based on Cherry Picking. - Kaari Landry; Aivee Teodocio; Manuel Lafond; Olivier Tremblay Savard (AlCoB, 2021)

Gene tree and species tree reconciliation with endosymbiotic gene transfer. - Yoann Anselmetti; Nadia El-Mabrouk; Manuel Lafond; Aïda Ouangraoua (Bioinform., 2021)

Efficient assembly consensus algorithms for divergent contig sets. - Annie Chateau; Tom Davot; Manuel Lafond (Comput. Biol. Chem., 2021)

Recognizing k-leaf powers in polynomial time, for constant k. - Manuel Lafond (CoRR, 2021)

Colorful orthology clustering in bounded-degree similarity graphs. - Alitzel López Sánchez; Manuel Lafond (J. Bioinform. Comput. Biol., 2021)

Edge clique covers in graphs with independence number two. - Pierre Charbit; Gena Hahn; Marcin Kaminski 001; Manuel Lafond; Nicolas Lichiardopol; Reza Naserasr; Ben Seamone; Rezvan Sherkati (J. Graph Theory, 2021)

Time-energy tradeoffs for evacuation by two robots in the wireless model. - Jurek Czyzowicz; Konstantinos Georgiou; Ryan Killick; Evangelos Kranakis; Danny Krizanc; Manuel Lafond; Lata Narayanan; Jaroslav Opatrny; Sunil M. Shende (Theor. Comput. Sci., 2021)

How Brokers Can Optimally Abuse Traders. - Manuel Lafond (FUN, 2022)

The Two-Squirrel Problem and Its Relatives. - Sergey Bereg; Yuya Higashikawa; Naoki Katoh; László Kozma 002; Manuel Lafond; Günter Rote; Yuki Tokuni; Max Willert; Binhai Zhu (JCDCGGG, 2022)

The Complexity of Finding Common Partitions of Genomes with Predefined Block Sizes. - Manuel Lafond; Adiesha Liyanage; Binhai Zhu; Peng Zou (RECOMB-CG, 2022)

Recognizing k-leaf powers in polynomial time, for constant k. - Manuel Lafond (SODA, 2022)

Further results on Hendry's Conjecture. - Manuel Lafond; Ben Seamone; Rezvan Sherkati (Discret. Math. Theor. Comput. Sci., 2022)

Computing the Tandem Duplication Distance is NP-Hard. - Manuel Lafond; Binhai Zhu; Peng Zou (SIAM J. Discret. Math., 2022)

Graph Algorithms and Graph Theory-Symmetry Special Issue. - Manuel Lafond (Symmetry, 2022)

The Longest Subsequence-Repeated Subsequence Problem. - Manuel Lafond; Wenfeng Lai; Adiesha Liyanage; Binhai Zhu (COCOA (1), 2023)

An FPT Algorithm for Temporal Graph Untangling. - Riccardo Dondi; Manuel Lafond (IPEC, 2023)

Parameterized Complexity of Domination Problems Using Restricted Modular Partitions. - Manuel Lafond; Weidong Luo (MFCS, 2023)

Classifying the Post-duplication Fate of Paralogous Genes. - Reza Kalhor; Guillaume Beslon; Manuel Lafond; Céline Scornavacca (RECOMB-CG, 2023)

Two Strikes Against the Phage Recombination Problem. - Manuel Lafond; Anne Bergeron; Krister M. Swenson (RECOMB-CG, 2023)

Finding Agreement Cherry-Reduced Subnetworks in Level-1 Networks. - Kaari Landry; Olivier Tremblay Savard; Manuel Lafond (RECOMB-CG, 2023)

The Two-Squirrel Problem and Its Relatives. - Sergey Bereg; Yuya Higashikawa; Naoki Katoh; Manuel Lafond; Yuki Tokuni; Binhai Zhu (CoRR, 2023)

An FTP Algorithm for Temporal Graph Untangling. - Riccardo Dondi; Manuel Lafond (CoRR, 2023)

A lightweight semi-centralized strategy for the massive parallelization of branching algorithms. - Andres Pastrana-Cruz; Manuel Lafond (Parallel Comput., 2023)

Defining Phylogenetic Network Distances Using Cherry Operations. - Kaari Landry; Aivee Teodocio; Manuel Lafond; Olivier Tremblay Savard (IEEE ACM Trans. Comput. Biol. Bioinform., 2023)

On the Tractability of Covering a Graph with 2-Clubs. - Riccardo Dondi; Manuel Lafond (Algorithmica, 2023)

Recognizing k-Leaf Powers in Polynomial Time, for Constant k. - Manuel Lafond (ACM Trans. Algorithms, 2023)

Relative timing information and orthology in evolutionary scenarios. - David Schaller 001; Tom Hartmann; Manuel Lafond; Peter F. Stadler; Nicolas Wieseke; Marc Hellmuth (Algorithms Mol. Biol., 2023)

Galled Perfect Transfer Networks. - Alitzel López Sánchez; Manuel Lafond (RECOMB-CG, 2024)

Finding Maximum Common Contractions Between Phylogenetic Networks. - Bertrand Marchand; Nadia Tahiri; Olivier Tremblay Savard; Manuel Lafond (WABI, 2024)

The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees. - Alitzel López Sánchez; José Antonio Ramírez-Rafael; Alejandro Flores-Lamas; Maribel Hernández-Rosales; Manuel Lafond (WABI, 2024)

Median and small parsimony problems on RNA trees. - Bertrand Marchand; Yoann Anselmetti; Manuel Lafond; Aïda Ouangraoua (Bioinform., 2024)

k-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5. - Max Dupré la Tour; Manuel Lafond; Ndiamé Ndiaye; Adrian Vetta (CoRR, 2024)

On Generalizations of Pairwise Compatibility Graphs. - Tiziana Calamoneri; Manuel Lafond; Angelo Monti; Blerina Sinaimeri (Discret. Math. Theor. Comput. Sci., 2024)

A Rigorous Framework to Classify the Postduplication Fate of Paralogous Genes. - Reza Kalhor; Guillaume Beslon; Manuel Lafond; Céline Scornavacca (J. Comput. Biol., 2024)

A Fixed-Parameter Tractable Algorithm for Finding Agreement Cherry-Reduced Subnetworks in Level-1 Orchard Networks. - Kaari Landry; Olivier Tremblay Savard; Manuel Lafond (J. Comput. Biol., 2024)

Improved kernelization and fixed-parameter algorithms for bicluster editing. - Manuel Lafond (J. Comb. Optim., 2024)

Permutation-constrained Common String Partitions with Applications. - Manuel Lafond; Binhai Zhu (Algorithmica, 2024)

Predicting horizontal gene transfers with perfect transfer networks. - Alitzel López Sánchez; Manuel Lafond (Algorithms Mol. Biol., 2024)

k-Leaf Powers Cannot Be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5. - Max Dupré la Tour; Manuel Lafond; Ndiamé Ndiaye; Adrian Vetta (ICALP, 2025)

Cluster Editing on Cographs and Related Classes. - Manuel Lafond; Alitzel López Sánchez; Weidong Luo (STACS, 2025)

Preprocessing complexity for some graph problems parameterized by structural parameters. - Manuel Lafond; Weidong Luo (Discret. Appl. Math., 2025)

The longest subsequence-duplicated subsequence and related problems. - Manuel Lafond; Wenfeng Lai; Adiesha Liyanage; Binhai Zhu (Inf. Comput., 2025)

An FPT algorithm for timeline cover. - Riccardo Dondi; Manuel Lafond (J. Comput. Syst. Sci., 2025)

On the complexity of temporal arborescence reconfiguration. - Riccardo Dondi; Manuel Lafond (Theor. Comput. Sci., 2025)

Path partitions of phylogenetic networks. - Manuel Lafond; Vincent Moulton (Theor. Comput. Sci., 2025)

The Parameterized Landscape of Labeled Graph Contractions. - Manuel Lafond; Bertrand Marchand (CoRR, 2025)

Novel Complexity Results for Temporal Separators with Deadlines. - Riccardo Dondi; Manuel Lafond (CoRR, 2025)