Slides from my talks
2026
- The o-minus metric to compare phylogenetic networks, The Lorentz Center workshop 2026 on Uniting Phylogenetic Network Research
- Setting the Complexity of Recognizing Leaf Powers, SIAM DM26
- FO model checking on graphs via the twin-width parameter, Sherbrooke Seminars on Fundamental Research in Computer Science (not my work, me explaining twin-width to undergrads)
2025
- The Parameterized Landscape of Labeled Contractions, University of Bergen Seminars in Algorithm
- Cluster Editing on Cographs and Related Classes, STACS 2025
- Novel Complexity Results for Temporal Separators with Deadlines, WADS 2025
2024
- Classifying The Post-Duplication Fate Of Paralogous Genes, Quest for Orthologs Consortium Meeting of 2024
- Finding Maximum Common Contractions Between Phylogenetic Networks, ICERM 2024 meeting on From Phylogenetics to Phylogenomics: Mathematical and Statistical Challenges in the Era of Big Data
2023
- Parameterized Graph Algorithms Using Restricted Modular Partitions , Canadian Mathematical Society (CMS) Winter Meeting of 2023
- On The Characterization Of Pairwise Comparability Graphs, The Montreal Graph Theory Workshop of 2023
- Preprocessing Complexity For Some Graph Problems Parameterized By Structural Parameters, LAGOS2023
- Perfect Transfer Networks, Workshop on Algorithms and Software in Phylogenetics in Singapore
2022
- Recognizing k-leaf Powers in Polynomial Time, for Constant k, SODA 2022
- Recognizing k-leaf Powers in Polynomial Time, for Constant k, in-depth presentation of that k-leaf power result, IBS DIMAG Virtual Discrete Math Colloquium, 2022
- The Complexity of Finding Common Partitions of Genomes with Predefined Block Sizes, RECOMB-CG2022
- How Brokers Can Optimally Abuse Traders, FUN2022
- Reconstructing Phylogenies from Ordinal Distance Information, IML Frontiers in Molecular Evolution 2022
2021
- Permutation Constrained Common String Partitions With Applications, SPIRE 2021
- Reconciliation Between Gene Trees And Species Trees In The Phylogenomics Era, Seminars on Algorithms and Complexity in Phylogenetics, 2021
- Théorie Des Graphes et Évolution : Une Caractérisation Des Graphes D’Orthologie, UdeS Club-Math, 2021
2020
- The tandem duplication distance is NP hard, STACS 2020
- Algorithmic Challenges in Reconstructing Copy-Number Evolution, LIRMM invited speaker, 2020
- Even better fixed-parameter algorithms for bicluster editing, COCOON 2020
2019
- Théorie des graphes et évolution: les puissances de feuilles, UdeS Club mathématiques 2019
- Will we ever find a characterization of leaf powers?, 9th Slovenian International Conference on Graph Theory, 2019
- Comparing copy-number profiles under multi-copy amplifications and deletions, RECOMB-CG2019
2018
- Accurate prediction of orthologs in the presence of divergence after duplication, ISMB 2018
- Reconciling multiple gene trees via segmental duplications and losses, WABI2018
- The Complexity of Speedrunning Video Games, FUN2018
- Editing graphs to satisfy degree requirements, COCOA2018
2017
- On strongly chordal graphs that are not leaf powers, talk given at WG 2017
- On the weighted quartet consistency problem, talk given at CPM 2017
- Optimal Local Buffer Management for Information Gathering with Adversarial Traffic, talk given at SPAA 2017
- Algorithms for the validation and correction of orthology relations, invited talk at the MonBUG seminar (2017)