Manuel Lafond
Orcid: 0000-0002-5305-7372
According to our database1,
Manuel Lafond
authored at least 89 papers
between 2012 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2012
2014
2016
2018
2020
2022
2024
0
5
10
15
1
1
9
7
3
6
8
4
2
6
1
2
1
2
4
7
3
1
3
2
5
4
3
1
1
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2025
2024
Algorithms Mol. Biol., December, 2024
Algorithmica, December, 2024
J. Comb. Optim., July, 2024
A Fixed-Parameter Tractable Algorithm for Finding Agreement Cherry-Reduced Subnetworks in Level-1 Orchard Networks.
J. Comput. Biol., 2024
J. Comput. Biol., 2024
Discret. Math. Theor. Comput. Sci., 2024
<i>k</i>-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5.
CoRR, 2024
Proceedings of the 24th International Workshop on Algorithms in Bioinformatics, 2024
Proceedings of the 24th International Workshop on Algorithms in Bioinformatics, 2024
Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024
Proceedings of the Comparative Genomics - 21st International Conference, 2024
2023
Algorithms Mol. Biol., December, 2023
ACM Trans. Algorithms, October, 2023
IEEE ACM Trans. Comput. Biol. Bioinform., 2023
A lightweight semi-centralized strategy for the massive parallelization of branching algorithms.
Parallel Comput., 2023
Proceedings of the Comparative Genomics - 20th International Conference, 2023
Proceedings of the Comparative Genomics - 20th International Conference, 2023
Proceedings of the Comparative Genomics - 20th International Conference, 2023
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023
Preprocessing complexity for some graph problems parameterized by structural parameters.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023
Proceedings of the Combinatorial Optimization and Applications, 2023
2022
Recognizing <italic>k</italic>-leaf powers in polynomial time, for constant <italic>k</italic>.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the Comparative Genomics - 19th International Conference, 2022
Proceedings of the 11th International Conference on Fun with Algorithms, 2022
2021
Theor. Comput. Sci., 2021
J. Bioinform. Comput. Biol., 2021
Comput. Biol. Chem., 2021
Bioinform., 2021
Proceedings of the Algorithms for Computational Biology - 8th International Conference, 2021
2020
CoRR, 2020
The distance and median problems in the single-cut-or-join model with single-gene duplications.
Algorithms Mol. Biol., 2020
Evolution through segmental duplications and losses: a Super-Reconciliation approach.
Algorithms Mol. Biol., 2020
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020
2019
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics.
Theor. Comput. Sci., 2019
IEEE ACM Trans. Comput. Biol. Bioinform., 2019
Algorithms Mol. Biol., 2019
Proceedings of the Structural Information and Communication Complexity, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
2018
IEEE ACM Trans. Comput. Biol. Bioinform., 2018
Bioinform., 2018
Proceedings of the Comparative Genomics - 16th International Conference, 2018
Proceedings of the Comparative Genomics - 16th International Conference, 2018
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
Proceedings of the 9th International Conference on Fun with Algorithms, 2018
Proceedings of the Combinatorial Optimization and Applications, 2018
2017
Reconstructing protein and gene phylogenies using reconciliation and soft-clustering.
J. Bioinform. Comput. Biol., 2017
CoRR, 2017
Approximating the correction of weighted and unweighted orthology and paralogy relations.
Algorithms Mol. Biol., 2017
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017
Proceedings of the String Processing and Information Retrieval, 2017
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017
2016
Algorithms Mol. Biol., 2016
Correction of Weighted Orthology and Paralogy Relations - Complexity and Algorithmic Results.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016
Proceedings of the Structural Information and Communication Complexity, 2016
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016
2015
BMC Bioinform., December, 2015
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015
2014
Bioinform., 2014
2013
Proceedings of the 2013 International Conference on Availability, Reliability and Security, 2013
Proceedings of the Models and Algorithms for Genome Evolution, 2013
2012
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012
Proceedings of the Tenth Annual International Conference on Privacy, Security and Trust, 2012