| 2026 | ICALP | On the Hardness of Recognizing Graphs of Small Mim-Width and Its Variants. | Max Dupr la Tour, Manuel Lafond, Ndiam Ndiaye |
| 2026 | SODA | Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete. | Max Dupr la Tour, Manuel Lafond, Ndiam Ndiaye |
| 2026 | WABI | Constructing Incompatibility Graphs of Pairs of Trees in Optimal Output-Sensitive Time. | Manuel Lafond |
| 2025 | ICALP | 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 |
| 2025 | STACS | Cluster Editing on Cographs and Related Classes. | Manuel Lafond, Alitzel Lpez Snchez, Weidong Luo |
| 2025 | WADS | Novel Complexity Results for Temporal Separators with Deadlines. | Riccardo Dondi, Manuel Lafond |
| 2025 | WADS | The Parameterized Landscape of Labeled Graph Contractions. | Manuel Lafond, Bertrand Marchand |
| 2024 | WABI | Finding Maximum Common Contractions Between Phylogenetic Networks. | Bertrand Marchand, Nadia Tahiri, Olivier Tremblay-Savard, Manuel Lafond |
| 2024 | WABI | The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees. | Alitzel Lpez Snchez, Jos Antonio Ramrez-Rafael, Alejandro Flores-Lamas, Maribel Hernndez-Rosales, Manuel Lafond |
| 2023 | COCOA | The Longest Subsequence-Repeated Subsequence Problem. | Manuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu |
| 2023 | LAGOS | Preprocessing complexity for some graph problems parameterized by structural parameters. | Manuel Lafond, Weidong Luo |
| 2023 | MFCS | Parameterized Complexity of Domination Problems Using Restricted Modular Partitions. | Manuel Lafond, Weidong Luo |
| 2022 | FUN | How Brokers Can Optimally Abuse Traders. | Manuel Lafond |
| 2022 | SODA | Recognizing <italic>k</italic>-leaf powers in polynomial time, for constant <italic>k</italic>. | Manuel Lafond |
| 2022 | WABI | Predicting Horizontal Gene Transfers with Perfect Transfer Networks. | Alitzel Lpez Snchez, Manuel Lafond |
| 2021 | SPIRE | Permutation-Constrained Common String Partitions with Applications. | Manuel Lafond, Binhai Zhu |
| 2020 | COCOON | Even Better Fixed-Parameter Algorithms for Bicluster Editing. | Manuel Lafond |
| 2020 | CPM | Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms. | Manuel Lafond, Binhai Zhu, Peng Zou |
| 2020 | STACS | The Tandem Duplication Distance Is NP-Hard. | Manuel Lafond, Binhai Zhu, Peng Zou |
| 2019 | FCT | On the Tractability of Covering a Graph with 2-Clubs. | Riccardo Dondi, Manuel Lafond |
| 2019 | ICALP | 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 |
| 2019 | SIROCCO | 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 |
| 2019 | SIROCCO | Distributed Pattern Formation in a Ring. | Anne-Laure Ehresmann, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny |
| 2018 | COCOA | Editing Graphs to Satisfy Diversity Requirements. | Huda Chuangpishit, Manuel Lafond, Lata Narayanan |
| 2018 | FUN | The complexity of speedrunning video games. | Manuel Lafond |
| 2018 | LATIN | Satisfying Neighbor Preferences on a Circle. | Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende |
| 2018 | RECOMB | Reconstructing the History of Syntenies Through Super-Reconciliation. | Matto Delabre, Nadia El-Mabrouk, Katharina T. Huber, Manuel Lafond, Vincent Moulton, Emmanuel Noutahi, Miguel Sautie Castellanos |
| 2018 | RECOMB | The Rooted SCJ Median with Single Gene Duplications. | Aniket C. Mane, Manuel Lafond, Pedro Feijo, Cdric Chauve |
| 2018 | WABI | Reconciling Multiple Genes Trees via Segmental Duplications and Losses. | Riccardo Dondi, Manuel Lafond, Cline Scornavacca |
| 2017 | CIAC | Weak Coverage of a Rectangular Barrier. | Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Jn Manuch, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Ladislav Stacho |
| 2017 | CPM | On the Weighted Quartet Consensus Problem. | Manuel Lafond, Cline Scornavacca |
| 2017 | SPAA | Optimal Local Buffer Management for Information Gathering with Adversarial Traffic. | Stefan Dobrev, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny |
| 2017 | SPIRE | Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract). | Cdric Chauve, Mark Jones, Manuel Lafond, Cline Scornavacca, Mathias Weller |
| 2017 | WG | On Strongly Chordal Graphs That Are Not Leaf Powers. | Manuel Lafond |
| 2016 | CPM | Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost. | Manuel Lafond, Emmanuel Noutahi, Nadia El-Mabrouk |
| 2016 | SIROCCO | Whom to Befriend to Influence People. | Manuel Lafond, Lata Narayanan, Kangkang Wu |
| 2016 | WABI | Correction of Weighted Orthology and Paralogy Relations - Complexity and Algorithmic Results. | Riccardo Dondi, Nadia El-Mabrouk, Manuel Lafond |
| 2015 | WABI | Orthology Relation and Gene Tree Correction: Complexity Results. | Manuel Lafond, Nadia El-Mabrouk |
| 2012 | PST | Privacy invasion in business environments. | Manuel Lafond, Pierre-Olivier Brosseau, Esma Ameur |
| 2012 | WABI | An Optimal Reconciliation Algorithm for Gene Trees with Polytomies. | Manuel Lafond, Krister M. Swenson, Nadia El-Mabrouk |