Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Manuel Lafond
@article{DBLP:journals/almob/SanchezL24,
author = {Alitzel L{\'{o}}pez S{\'{a}}nchez and
Manuel Lafond},
title = {Predicting horizontal gene transfers with perfect transfer networks},
journal = {Algorithms Mol. Biol.},
volume = {19},
number = {1},
pages = {6},
year = {2024},
url = {https://doi.org/10.1186/s13015-023-00242-2},
doi = {10.1186/S13015-023-00242-2},
timestamp = {Sun, 25 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/SanchezL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recombcg/SanchezL24,
author = {Alitzel L{\'{o}}pez S{\'{a}}nchez and
Manuel Lafond},
editor = {C{\'{e}}line Scornavacca and
Maribel Hern{\'{a}}ndez{-}Rosales},
title = {Galled Perfect Transfer Networks},
booktitle = {Comparative Genomics - 21st International Conference, {RECOMB-CG}
2024, Boston, MA, USA, April 27-28, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14616},
pages = {24--43},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-58072-7\_2},
doi = {10.1007/978-3-031-58072-7\_2},
timestamp = {Wed, 24 Apr 2024 16:58:28 +0200},
biburl = {https://dblp.org/rec/conf/recombcg/SanchezL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-03455,
author = {Bertrand Marchand and
Yoann Anselmetti and
Manuel Lafond and
A{\"{\i}}da Ouangraoua},
title = {Median and Small Parsimony Problems on {RNA} trees},
journal = {CoRR},
volume = {abs/2402.03455},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.03455},
doi = {10.48550/ARXIV.2402.03455},
eprinttype = {arXiv},
eprint = {2402.03455},
timestamp = {Mon, 12 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-03455.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DondiL23,
author = {Riccardo Dondi and
Manuel Lafond},
title = {On the Tractability of Covering a Graph with 2-Clubs},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {992--1028},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01062-3},
doi = {10.1007/S00453-022-01062-3},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DondiL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/SchallerHLSWH23,
author = {David Schaller and
Tom Hartmann and
Manuel Lafond and
Peter F. Stadler and
Nicolas Wieseke and
Marc Hellmuth},
title = {Relative timing information and orthology in evolutionary scenarios},
journal = {Algorithms Mol. Biol.},
volume = {18},
number = {1},
pages = {16},
year = {2023},
url = {https://doi.org/10.1186/s13015-023-00240-4},
doi = {10.1186/S13015-023-00240-4},
timestamp = {Mon, 20 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/SchallerHLSWH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pc/Pastrana-CruzL23,
author = {Andres Pastrana{-}Cruz and
Manuel Lafond},
title = {A lightweight semi-centralized strategy for the massive parallelization
of branching algorithms},
journal = {Parallel Comput.},
volume = {116},
pages = {103024},
year = {2023},
url = {https://doi.org/10.1016/j.parco.2023.103024},
doi = {10.1016/J.PARCO.2023.103024},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pc/Pastrana-CruzL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Lafond23,
author = {Manuel Lafond},
title = {Recognizing \emph{k}-Leaf Powers in Polynomial Time, for Constant
\emph{k}},
journal = {{ACM} Trans. Algorithms},
volume = {19},
number = {4},
pages = {35:1--35:35},
year = {2023},
url = {https://doi.org/10.1145/3614094},
doi = {10.1145/3614094},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Lafond23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/LandryTLS23,
author = {Kaari Landry and
Aivee Teodocio and
Manuel Lafond and
Olivier Tremblay Savard},
title = {Defining Phylogenetic Network Distances Using Cherry Operations},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {20},
number = {3},
pages = {1654--1666},
year = {2023},
url = {https://doi.org/10.1109/TCBB.2022.3162991},
doi = {10.1109/TCBB.2022.3162991},
timestamp = {Thu, 27 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/LandryTLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/LafondLLZ23,
author = {Manuel Lafond and
Wenfeng Lai and
Adiesha Liyanage and
Binhai Zhu},
editor = {Weili Wu and
Jianxiong Guo},
title = {The Longest Subsequence-Repeated Subsequence Problem},
booktitle = {Combinatorial Optimization and Applications - 17th International Conference,
{COCOA} 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14461},
pages = {446--458},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49611-0\_32},
doi = {10.1007/978-3-031-49611-0\_32},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/LafondLLZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DondiL23,
author = {Riccardo Dondi and
Manuel Lafond},
editor = {Neeldhara Misra and
Magnus Wahlstr{\"{o}}m},
title = {An {FPT} Algorithm for Temporal Graph Untangling},
booktitle = {18th International Symposium on Parameterized and Exact Computation,
{IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {285},
pages = {12:1--12:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.12},
doi = {10.4230/LIPICS.IPEC.2023.12},
timestamp = {Wed, 13 Dec 2023 14:08:59 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/DondiL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lagos/LafondL23,
author = {Manuel Lafond and
Weidong Luo},
editor = {Cristina G. Fernandes and
Sergio Rajsbaum},
title = {Preprocessing complexity for some graph problems parameterized by
structural parameters},
booktitle = {Proceedings of the {XII} Latin-American Algorithms, Graphs and Optimization
Symposium, {LAGOS} 2023, Huatulco, Mexico, September 18-22, 2023},
series = {Procedia Computer Science},
volume = {223},
pages = {130--139},
publisher = {Elsevier},
year = {2023},
url = {https://doi.org/10.1016/j.procs.2023.08.222},
doi = {10.1016/J.PROCS.2023.08.222},
timestamp = {Tue, 16 Jan 2024 15:18:39 +0100},
biburl = {https://dblp.org/rec/conf/lagos/LafondL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LafondL23,
author = {Manuel Lafond and
Weidong Luo},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Lombardy and
David Peleg},
title = {Parameterized Complexity of Domination Problems Using Restricted Modular
Partitions},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {61:1--61:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.61},
doi = {10.4230/LIPICS.MFCS.2023.61},
timestamp = {Mon, 28 Aug 2023 15:00:20 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/LafondL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recombcg/KalhorBLS23,
author = {Reza Kalhor and
Guillaume Beslon and
Manuel Lafond and
C{\'{e}}line Scornavacca},
editor = {Katharina Jahn and
Tom{\'{a}}s Vinar},
title = {Classifying the Post-duplication Fate of Paralogous Genes},
booktitle = {Comparative Genomics - 20th International Conference, {RECOMB-CG}
2023, Istanbul, Turkey, April 14-15, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13883},
pages = {1--18},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-36911-7\_1},
doi = {10.1007/978-3-031-36911-7\_1},
timestamp = {Tue, 25 Jul 2023 13:14:28 +0200},
biburl = {https://dblp.org/rec/conf/recombcg/KalhorBLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recombcg/LafondBS23,
author = {Manuel Lafond and
Anne Bergeron and
Krister M. Swenson},
editor = {Katharina Jahn and
Tom{\'{a}}s Vinar},
title = {Two Strikes Against the Phage Recombination Problem},
booktitle = {Comparative Genomics - 20th International Conference, {RECOMB-CG}
2023, Istanbul, Turkey, April 14-15, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13883},
pages = {68--83},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-36911-7\_5},
doi = {10.1007/978-3-031-36911-7\_5},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/recombcg/LafondBS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recombcg/LandrySL23,
author = {Kaari Landry and
Olivier Tremblay Savard and
Manuel Lafond},
editor = {Katharina Jahn and
Tom{\'{a}}s Vinar},
title = {Finding Agreement Cherry-Reduced Subnetworks in Level-1 Networks},
booktitle = {Comparative Genomics - 20th International Conference, {RECOMB-CG}
2023, Istanbul, Turkey, April 14-15, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13883},
pages = {179--195},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-36911-7\_12},
doi = {10.1007/978-3-031-36911-7\_12},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/recombcg/LandrySL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-05937,
author = {Sergey Bereg and
Yuya Higashikawa and
Naoki Katoh and
Manuel Lafond and
Yuki Tokuni and
Binhai Zhu},
title = {The Two-Squirrel Problem and Its Relatives},
journal = {CoRR},
volume = {abs/2302.05937},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.05937},
doi = {10.48550/ARXIV.2302.05937},
eprinttype = {arXiv},
eprint = {2302.05937},
timestamp = {Sun, 19 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-05937.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-06862,
author = {Manuel Lafond and
Wenfeng Lai and
Adiesha Liyanage and
Binhai Zhu},
title = {The Longest Subsequence-Repeated Subsequence Problem},
journal = {CoRR},
volume = {abs/2304.06862},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.06862},
doi = {10.48550/ARXIV.2304.06862},
eprinttype = {arXiv},
eprint = {2304.06862},
timestamp = {Wed, 19 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-06862.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-00033,
author = {Kaari Landry and
Olivier Tremblay Savard and
Manuel Lafond},
title = {Finding agreement cherry-reduced subnetworks in level-1 networks},
journal = {CoRR},
volume = {abs/2305.00033},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.00033},
doi = {10.48550/ARXIV.2305.00033},
eprinttype = {arXiv},
eprint = {2305.00033},
timestamp = {Thu, 04 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-00033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-09117,
author = {Andres Pastrana{-}Cruz and
Manuel Lafond},
title = {A lightweight semi-centralized strategy for the massive parallelization
of branching algorithms},
journal = {CoRR},
volume = {abs/2305.09117},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.09117},
doi = {10.48550/ARXIV.2305.09117},
eprinttype = {arXiv},
eprint = {2305.09117},
timestamp = {Wed, 24 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-09117.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-12655,
author = {Manuel Lafond and
Weidong Luo},
title = {Preprocessing Complexity for Some Graph Problems Parameterized by
Structural Parameters},
journal = {CoRR},
volume = {abs/2306.12655},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.12655},
doi = {10.48550/ARXIV.2306.12655},
eprinttype = {arXiv},
eprint = {2306.12655},
timestamp = {Tue, 27 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-12655.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-00786,
author = {Riccardo Dondi and
Manuel Lafond},
title = {An {FTP} Algorithm for Temporal Graph Untangling},
journal = {CoRR},
volume = {abs/2307.00786},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.00786},
doi = {10.48550/ARXIV.2307.00786},
eprinttype = {arXiv},
eprint = {2307.00786},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-00786.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-02021,
author = {Manuel Lafond and
Weidong Luo},
title = {Parameterized Complexity of Domination Problems Using Restricted Modular
Partitions},
journal = {CoRR},
volume = {abs/2307.02021},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.02021},
doi = {10.48550/ARXIV.2307.02021},
eprinttype = {arXiv},
eprint = {2307.02021},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-02021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-02962,
author = {Alitzel L{\'{o}}pez S{\'{a}}nchez and
Manuel Lafond},
title = {Predicting Horizontal Gene Transfers with Perfect Transfer Networks},
journal = {CoRR},
volume = {abs/2312.02962},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.02962},
doi = {10.48550/ARXIV.2312.02962},
eprinttype = {arXiv},
eprint = {2312.02962},
timestamp = {Thu, 28 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-02962.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/LafondSS22,
author = {Manuel Lafond and
Ben Seamone and
Rezvan Sherkati},
title = {Further results on Hendry's Conjecture},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {24},
number = {2},
year = {2022},
url = {https://doi.org/10.46298/dmtcs.6700},
doi = {10.46298/DMTCS.6700},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmtcs/LafondSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LafondZZ22,
author = {Manuel Lafond and
Binhai Zhu and
Peng Zou},
title = {Computing the Tandem Duplication Distance is NP-Hard},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {1},
pages = {64--91},
year = {2022},
url = {https://doi.org/10.1137/20m1356257},
doi = {10.1137/20M1356257},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/LafondZZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/symmetry/Lafond22,
author = {Manuel Lafond},
title = {Graph Algorithms and Graph Theory-Symmetry Special Issue},
journal = {Symmetry},
volume = {14},
number = {8},
pages = {1748},
year = {2022},
url = {https://doi.org/10.3390/sym14081748},
doi = {10.3390/SYM14081748},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/symmetry/Lafond22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/Lafond22,
author = {Manuel Lafond},
editor = {Pierre Fraigniaud and
Yushi Uno},
title = {How Brokers Can Optimally Abuse Traders},
booktitle = {11th International Conference on Fun with Algorithms, {FUN} 2022,
May 30 to June 3, 2022, Island of Favignana, Sicily, Italy},
series = {LIPIcs},
volume = {226},
pages = {18:1--18:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.FUN.2022.18},
doi = {10.4230/LIPICS.FUN.2022.18},
timestamp = {Mon, 23 May 2022 11:54:04 +0200},
biburl = {https://dblp.org/rec/conf/fun/Lafond22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recombcg/LafondLZZ22,
author = {Manuel Lafond and
Adiesha Liyanage and
Binhai Zhu and
Peng Zou},
editor = {Lingling Jin and
Dannie Durand},
title = {The Complexity of Finding Common Partitions of Genomes with Predefined
Block Sizes},
booktitle = {Comparative Genomics - 19th International Conference, {RECOMB-CG}
2022, La Jolla, CA, USA, May 20-21, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13234},
pages = {105--123},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06220-9\_7},
doi = {10.1007/978-3-031-06220-9\_7},
timestamp = {Mon, 06 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/recombcg/LafondLZZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Lafond22,
author = {Manuel Lafond},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Recognizing {\textless}italic{\textgreater}k{\textless}/italic{\textgreater}-leaf
powers in polynomial time, for constant {\textless}italic{\textgreater}k{\textless}/italic{\textgreater}},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {1384--1410},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.58},
doi = {10.1137/1.9781611977073.58},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/Lafond22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/SanchezL22,
author = {Alitzel L{\'{o}}pez S{\'{a}}nchez and
Manuel Lafond},
editor = {Christina Boucher and
Sven Rahmann},
title = {Predicting Horizontal Gene Transfers with Perfect Transfer Networks},
booktitle = {22nd International Workshop on Algorithms in Bioinformatics, {WABI}
2022, September 5-7, 2022, Potsdam, Germany},
series = {LIPIcs},
volume = {242},
pages = {3:1--3:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.WABI.2022.3},
doi = {10.4230/LIPICS.WABI.2022.3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wabi/SanchezL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-02201,
author = {David Schaller and
Tom Hartmann and
Manuel Lafond and
Nicolas Wieseke and
Marc Hellmuth and
Peter F. Stadler},
title = {Relative Timing Information and Orthology in Evolutionary Scenarios},
journal = {CoRR},
volume = {abs/2212.02201},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.02201},
doi = {10.48550/ARXIV.2212.02201},
eprinttype = {arXiv},
eprint = {2212.02201},
timestamp = {Thu, 08 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-02201.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/AnselmettiELO21,
author = {Yoann Anselmetti and
Nadia El{-}Mabrouk and
Manuel Lafond and
A{\"{\i}}da Ouangraoua},
title = {Gene tree and species tree reconciliation with endosymbiotic gene
transfer},
journal = {Bioinform.},
volume = {37},
number = {Supplement},
pages = {120--132},
year = {2021},
url = {https://doi.org/10.1093/bioinformatics/btab328},
doi = {10.1093/BIOINFORMATICS/BTAB328},
timestamp = {Tue, 21 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/AnselmettiELO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candc/ChateauDL21,
author = {Annie Chateau and
Tom Davot and
Manuel Lafond},
title = {Efficient assembly consensus algorithms for divergent contig sets},
journal = {Comput. Biol. Chem.},
volume = {93},
pages = {107516},
year = {2021},
url = {https://doi.org/10.1016/j.compbiolchem.2021.107516},
doi = {10.1016/J.COMPBIOLCHEM.2021.107516},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/candc/ChateauDL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbcb/SanchezL21,
author = {Alitzel L{\'{o}}pez S{\'{a}}nchez and
Manuel Lafond},
title = {Colorful orthology clustering in bounded-degree similarity graphs},
journal = {J. Bioinform. Comput. Biol.},
volume = {19},
number = {6},
pages = {2140010:1--2140010:15},
year = {2021},
url = {https://doi.org/10.1142/S0219720021400102},
doi = {10.1142/S0219720021400102},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jbcb/SanchezL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CharbitHKLLNSS21,
author = {Pierre Charbit and
Gena Hahn and
Marcin Kaminski and
Manuel Lafond and
Nicolas Lichiardopol and
Reza Naserasr and
Ben Seamone and
Rezvan Sherkati},
title = {Edge clique covers in graphs with independence number two},
journal = {J. Graph Theory},
volume = {97},
number = {2},
pages = {324--339},
year = {2021},
url = {https://doi.org/10.1002/jgt.22657},
doi = {10.1002/JGT.22657},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CharbitHKLLNSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CzyzowiczGKKKLN21,
author = {Jurek Czyzowicz and
Konstantinos Georgiou and
Ryan Killick and
Evangelos Kranakis and
Danny Krizanc and
Manuel Lafond and
Lata Narayanan and
Jaroslav Opatrny and
Sunil M. Shende},
title = {Time-energy tradeoffs for evacuation by two robots in the wireless
model},
journal = {Theor. Comput. Sci.},
volume = {852},
pages = {61--72},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2020.11.014},
doi = {10.1016/J.TCS.2020.11.014},
timestamp = {Fri, 18 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CzyzowiczGKKKLN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alcob/LandryTLS21,
author = {Kaari Landry and
Aivee Teodocio and
Manuel Lafond and
Olivier Tremblay Savard},
editor = {Carlos Mart{\'{\i}}n{-}Vide and
Miguel A. Vega{-}Rodr{\'{\i}}guez and
Travis J. Wheeler},
title = {Novel Phylogenetic Network Distances Based on Cherry Picking},
booktitle = {Algorithms for Computational Biology - 8th International Conference,
AlCoB 2021, Missoula, MT, USA, June 7-11, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12715},
pages = {57--81},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-74432-8\_5},
doi = {10.1007/978-3-030-74432-8\_5},
timestamp = {Wed, 09 Jun 2021 11:58:11 +0200},
biburl = {https://dblp.org/rec/conf/alcob/LandryTLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/LafondZ21,
author = {Manuel Lafond and
Binhai Zhu},
editor = {Thierry Lecroq and
H{\'{e}}l{\`{e}}ne Touzet},
title = {Permutation-Constrained Common String Partitions with Applications},
booktitle = {String Processing and Information Retrieval - 28th International Symposium,
{SPIRE} 2021, Lille, France, October 4-6, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12944},
pages = {47--60},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86692-1\_5},
doi = {10.1007/978-3-030-86692-1\_5},
timestamp = {Tue, 28 Sep 2021 13:29:19 +0200},
biburl = {https://dblp.org/rec/conf/spire/LafondZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-15421,
author = {Manuel Lafond},
title = {Recognizing k-leaf powers in polynomial time, for constant k},
journal = {CoRR},
volume = {abs/2110.15421},
year = {2021},
url = {https://arxiv.org/abs/2110.15421},
eprinttype = {arXiv},
eprint = {2110.15421},
timestamp = {Tue, 02 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-15421.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DobrevKKLMNOS20,
author = {Stefan Dobrev and
Evangelos Kranakis and
Danny Krizanc and
Manuel Lafond and
J{\'{a}}n Manuch and
Lata Narayanan and
Jaroslav Opatrny and
Ladislav Stacho},
title = {Weak Coverage of a Rectangular Barrier},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {721--746},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00611-7},
doi = {10.1007/S00453-019-00611-7},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DobrevKKLMNOS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/ManeLFC20,
author = {Aniket C. Mane and
Manuel Lafond and
Pedro Cipriano Feij{\~{a}}o and
C{\'{e}}dric Chauve},
title = {The distance and median problems in the single-cut-or-join model with
single-gene duplications},
journal = {Algorithms Mol. Biol.},
volume = {15},
number = {1},
pages = {8},
year = {2020},
url = {https://doi.org/10.1186/s13015-020-00169-y},
doi = {10.1186/S13015-020-00169-Y},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/almob/ManeLFC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/DelabreEHLMNC20,
author = {Matt{\'{e}}o Delabre and
Nadia El{-}Mabrouk and
Katharina T. Huber and
Manuel Lafond and
Vincent Moulton and
Emmanuel Noutahi and
Miguel Sautie Castellanos},
title = {Evolution through segmental duplications and losses: a Super-Reconciliation
approach},
journal = {Algorithms Mol. Biol.},
volume = {15},
number = {1},
pages = {12},
year = {2020},
url = {https://doi.org/10.1186/s13015-020-00171-4},
doi = {10.1186/S13015-020-00171-4},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/almob/DelabreEHLMNC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/LafondH20,
author = {Manuel Lafond and
Marc Hellmuth},
title = {Reconstruction of time-consistent species trees},
journal = {Algorithms Mol. Biol.},
volume = {15},
number = {1},
pages = {16},
year = {2020},
url = {https://doi.org/10.1186/s13015-020-00175-0},
doi = {10.1186/S13015-020-00175-0},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/almob/LafondH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcgenomics/BriandDELL20,
author = {Samuel Briand and
Christophe Dessimoz and
Nadia El{-}Mabrouk and
Manuel Lafond and
Gabriela Lobinska},
title = {A generalized Robinson-Foulds distance for labeled trees},
journal = {{BMC} Genom.},
volume = {21},
number = {{S-10}},
year = {2020},
url = {https://doi.org/10.1186/s12864-020-07011-0},
doi = {10.1186/S12864-020-07011-0},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcgenomics/BriandDELL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CordascoGLNRVW20,
author = {Gennaro Cordasco and
Luisa Gargano and
Manuel Lafond and
Lata Narayanan and
Adele A. Rescigno and
Ugo Vaccaro and
Kangkang Wu},
title = {Whom to befriend to influence people},
journal = {Theor. Comput. Sci.},
volume = {810},
pages = {26--42},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2018.05.030},
doi = {10.1016/J.TCS.2018.05.030},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CordascoGLNRVW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/Lafond20,
author = {Manuel Lafond},
editor = {Donghyun Kim and
R. N. Uma and
Zhipeng Cai and
Dong Hoon Lee},
title = {Even Better Fixed-Parameter Algorithms for Bicluster Editing},
booktitle = {Computing and Combinatorics - 26th International Conference, {COCOON}
2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12273},
pages = {578--590},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-58150-3\_47},
doi = {10.1007/978-3-030-58150-3\_47},
timestamp = {Thu, 27 Aug 2020 12:32:24 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/Lafond20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/LafondZZ20,
author = {Manuel Lafond and
Binhai Zhu and
Peng Zou},
editor = {Inge Li G{\o}rtz and
Oren Weimann},
title = {Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching, {CPM} 2020,
June 17-19, 2020, Copenhagen, Denmark},
series = {LIPIcs},
volume = {161},
pages = {22:1--22:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CPM.2020.22},
doi = {10.4230/LIPICS.CPM.2020.22},
timestamp = {Tue, 09 Jun 2020 13:16:04 +0200},
biburl = {https://dblp.org/rec/conf/cpm/LafondZZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LafondZZ20,
author = {Manuel Lafond and
Binhai Zhu and
Peng Zou},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {The Tandem Duplication Distance Is NP-Hard},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {15:1--15:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.15},
doi = {10.4230/LIPICS.STACS.2020.15},
timestamp = {Thu, 05 Mar 2020 10:56:55 +0100},
biburl = {https://dblp.org/rec/conf/stacs/LafondZZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-04778,
author = {Manuel Lafond and
Binhai Zhu and
Peng Zou},
title = {Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms},
journal = {CoRR},
volume = {abs/2002.04778},
year = {2020},
url = {https://arxiv.org/abs/2002.04778},
eprinttype = {arXiv},
eprint = {2002.04778},
timestamp = {Fri, 14 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-04778.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-11271,
author = {Garance Cordonnier and
Manuel Lafond},
title = {Comparing copy-number profiles under multi-copy amplifications and
deletions},
journal = {CoRR},
volume = {abs/2002.11271},
year = {2020},
url = {https://arxiv.org/abs/2002.11271},
eprinttype = {arXiv},
eprint = {2002.11271},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-11271.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-07464,
author = {Manuel Lafond and
Ben Seamone and
Rezvan Sherkati},
title = {Further results on Hendry's Conjecture},
journal = {CoRR},
volume = {abs/2007.07464},
year = {2020},
url = {https://arxiv.org/abs/2007.07464},
eprinttype = {arXiv},
eprint = {2007.07464},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-07464.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-08897,
author = {David Schaller and
Manuel Lafond and
Peter F. Stadler and
Nicolas Wieseke and
Marc Hellmuth},
title = {Indirect Identification of Horizontal Gene Transfer},
journal = {CoRR},
volume = {abs/2012.08897},
year = {2020},
url = {https://arxiv.org/abs/2012.08897},
eprinttype = {arXiv},
eprint = {2012.08897},
timestamp = {Tue, 13 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-08897.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/DondiLS19,
author = {Riccardo Dondi and
Manuel Lafond and
C{\'{e}}line Scornavacca},
title = {Reconciling multiple genes trees via segmental duplications and losses},
journal = {Algorithms Mol. Biol.},
volume = {14},
number = {1},
pages = {7:1--7:19},
year = {2019},
url = {https://doi.org/10.1186/s13015-019-0139-6},
doi = {10.1186/S13015-019-0139-6},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/DondiLS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/LuhmannLTOWC19,
author = {Nina Luhmann and
Manuel Lafond and
Annelyse Th{\'{e}}venin and
A{\"{\i}}da Ouangraoua and
Roland Wittler and
C{\'{e}}dric Chauve},
title = {The {SCJ} Small Parsimony Problem for Weighted Gene Adjacencies},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {16},
number = {4},
pages = {1364--1373},
year = {2019},
url = {https://doi.org/10.1109/TCBB.2017.2661761},
doi = {10.1109/TCBB.2017.2661761},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/LuhmannLTOWC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LafondEHM19,
author = {Manuel Lafond and
Nadia El{-}Mabrouk and
Katharina T. Huber and
Vincent Moulton},
title = {The complexity of comparing multiply-labelled trees by extending phylogenetic-tree
metrics},
journal = {Theor. Comput. Sci.},
volume = {760},
pages = {15--34},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.08.006},
doi = {10.1016/J.TCS.2018.08.006},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LafondEHM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LafondS19,
author = {Manuel Lafond and
C{\'{e}}line Scornavacca},
title = {On the Weighted Quartet Consensus problem},
journal = {Theor. Comput. Sci.},
volume = {769},
pages = {1--17},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.10.005},
doi = {10.1016/J.TCS.2018.10.005},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LafondS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/DondiL19,
author = {Riccardo Dondi and
Manuel Lafond},
editor = {Leszek Antoni Gasieniec and
Jesper Jansson and
Christos Levcopoulos},
title = {On the Tractability of Covering a Graph with 2-Clubs},
booktitle = {Fundamentals of Computation Theory - 22nd International Symposium,
{FCT} 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11651},
pages = {243--257},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-25027-0\_17},
doi = {10.1007/978-3-030-25027-0\_17},
timestamp = {Tue, 17 May 2022 11:54:28 +0200},
biburl = {https://dblp.org/rec/conf/fct/DondiL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CzyzowiczGKKKLN19,
author = {Jurek Czyzowicz and
Konstantinos Georgiou and
Ryan Killick and
Evangelos Kranakis and
Danny Krizanc and
Manuel Lafond and
Lata Narayanan and
Jaroslav Opatrny and
Sunil M. Shende},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Energy Consumption of Group Search on a Line},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {137:1--137:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.137},
doi = {10.4230/LIPICS.ICALP.2019.137},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/CzyzowiczGKKKLN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/CzyzowiczGKKKLN19,
author = {Jurek Czyzowicz and
Konstantinos Georgiou and
Ryan Killick and
Evangelos Kranakis and
Danny Krizanc and
Manuel Lafond and
Lata Narayanan and
Jaroslav Opatrny and
Sunil M. Shende},
editor = {Keren Censor{-}Hillel and
Michele Flammini},
title = {Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless
Model},
booktitle = {Structural Information and Communication Complexity - 26th International
Colloquium, {SIROCCO} 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11639},
pages = {185--199},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24922-9\_13},
doi = {10.1007/978-3-030-24922-9\_13},
timestamp = {Mon, 15 Jul 2019 16:09:50 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/CzyzowiczGKKKLN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/EhresmannLNO19,
author = {Anne{-}Laure Ehresmann and
Manuel Lafond and
Lata Narayanan and
Jaroslav Opatrny},
editor = {Keren Censor{-}Hillel and
Michele Flammini},
title = {Distributed Pattern Formation in a Ring},
booktitle = {Structural Information and Communication Complexity - 26th International
Colloquium, {SIROCCO} 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11639},
pages = {215--229},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24922-9\_15},
doi = {10.1007/978-3-030-24922-9\_15},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/EhresmannLNO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-09714,
author = {Jurek Czyzowicz and
Konstantinos Georgiou and
Ryan Killick and
Evangelos Kranakis and
Danny Krizanc and
Manuel Lafond and
Lata Narayanan and
Jaroslav Opatrny and
Sunil M. Shende},
title = {Energy Consumption of Group Search on a Line},
journal = {CoRR},
volume = {abs/1904.09714},
year = {2019},
url = {http://arxiv.org/abs/1904.09714},
eprinttype = {arXiv},
eprint = {1904.09714},
timestamp = {Fri, 26 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-09714.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-06783,
author = {Jurek Czyzowicz and
Konstantinos Georgiou and
Ryan Killick and
Evangelos Kranakis and
Danny Krizanc and
Manuel Lafond and
Lata Narayanan and
Jaroslav Opatrny and
Sunil M. Shende},
title = {Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless
Model},
journal = {CoRR},
volume = {abs/1905.06783},
year = {2019},
url = {http://arxiv.org/abs/1905.06783},
eprinttype = {arXiv},
eprint = {1905.06783},
timestamp = {Tue, 28 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-06783.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-08856,
author = {Anne{-}Laure Ehresmann and
Manuel Lafond and
Lata Narayanan and
Jaroslav Opatrny},
title = {Distributed Pattern Formation in a Ring},
journal = {CoRR},
volume = {abs/1905.08856},
year = {2019},
url = {http://arxiv.org/abs/1905.08856},
eprinttype = {arXiv},
eprint = {1905.08856},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-08856.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-05266,
author = {Manuel Lafond and
Binhai Zhu and
Peng Zou},
title = {The Tandem Duplication Distance is NP-hard},
journal = {CoRR},
volume = {abs/1906.05266},
year = {2019},
url = {http://arxiv.org/abs/1906.05266},
eprinttype = {arXiv},
eprint = {1906.05266},
timestamp = {Fri, 14 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-05266.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-13123,
author = {Manuel Lafond and
Marc Hellmuth},
title = {Reconstruction of time-consistent species trees},
journal = {CoRR},
volume = {abs/1910.13123},
year = {2019},
url = {http://arxiv.org/abs/1910.13123},
eprinttype = {arXiv},
eprint = {1910.13123},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-13123.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/LafondMS18,
author = {Manuel Lafond and
Mona Meghdari Miardan and
David Sankoff},
title = {Accurate prediction of orthologs in the presence of divergence after
duplication},
journal = {Bioinform.},
volume = {34},
number = {13},
pages = {i366--i375},
year = {2018},
url = {https://doi.org/10.1093/bioinformatics/bty242},
doi = {10.1093/BIOINFORMATICS/BTY242},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/LafondMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/LafondCEO18,
author = {Manuel Lafond and
C{\'{e}}dric Chauve and
Nadia El{-}Mabrouk and
A{\"{\i}}da Ouangraoua},
title = {Gene Tree Construction and Correction Using SuperTree and Reconciliation},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {15},
number = {5},
pages = {1560--1570},
year = {2018},
url = {https://doi.org/10.1109/TCBB.2017.2720581},
doi = {10.1109/TCBB.2017.2720581},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/LafondCEO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ChuangpishitLN18,
author = {Huda Chuangpishit and
Manuel Lafond and
Lata Narayanan},
editor = {Donghyun Kim and
R. N. Uma and
Alexander Zelikovsky},
title = {Editing Graphs to Satisfy Diversity Requirements},
booktitle = {Combinatorial Optimization and Applications - 12th International Conference,
{COCOA} 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11346},
pages = {154--168},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04651-4\_11},
doi = {10.1007/978-3-030-04651-4\_11},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/ChuangpishitLN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/Lafond18,
author = {Manuel Lafond},
editor = {Hiro Ito and
Stefano Leonardi and
Linda Pagli and
Giuseppe Prencipe},
title = {The complexity of speedrunning video games},
booktitle = {9th International Conference on Fun with Algorithms, {FUN} 2018, June
13-15, 2018, La Maddalena, Italy},
series = {LIPIcs},
volume = {100},
pages = {27:1--27:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FUN.2018.27},
doi = {10.4230/LIPICS.FUN.2018.27},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/fun/Lafond18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/KrizancLNOS18,
author = {Danny Krizanc and
Manuel Lafond and
Lata Narayanan and
Jaroslav Opatrny and
Sunil M. Shende},
editor = {Michael A. Bender and
Martin Farach{-}Colton and
Miguel A. Mosteiro},
title = {Satisfying Neighbor Preferences on a Circle},
booktitle = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium,
Buenos Aires, Argentina, April 16-19, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10807},
pages = {727--740},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-77404-6\_53},
doi = {10.1007/978-3-319-77404-6\_53},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/KrizancLNOS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/ManeLFC18,
author = {Aniket C. Mane and
Manuel Lafond and
Pedro Feij{\~{a}}o and
C{\'{e}}dric Chauve},
editor = {Mathieu Blanchette and
A{\"{\i}}da Ouangraoua},
title = {The Rooted {SCJ} Median with Single Gene Duplications},
booktitle = {Comparative Genomics - 16th International Conference, {RECOMB-CG}
2018, Magog-Orford, QC, Canada, October 9-12, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11183},
pages = {28--48},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00834-5\_2},
doi = {10.1007/978-3-030-00834-5\_2},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/ManeLFC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/DelabreEHLMNC18,
author = {Matt{\'{e}}o Delabre and
Nadia El{-}Mabrouk and
Katharina T. Huber and
Manuel Lafond and
Vincent Moulton and
Emmanuel Noutahi and
Miguel Sautie Castellanos},
editor = {Mathieu Blanchette and
A{\"{\i}}da Ouangraoua},
title = {Reconstructing the History of Syntenies Through Super-Reconciliation},
booktitle = {Comparative Genomics - 16th International Conference, {RECOMB-CG}
2018, Magog-Orford, QC, Canada, October 9-12, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11183},
pages = {179--195},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00834-5\_10},
doi = {10.1007/978-3-030-00834-5\_10},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/recomb/DelabreEHLMNC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/DondiLS18,
author = {Riccardo Dondi and
Manuel Lafond and
C{\'{e}}line Scornavacca},
editor = {Laxmi Parida and
Esko Ukkonen},
title = {Reconciling Multiple Genes Trees via Segmental Duplications and Losses},
booktitle = {18th International Workshop on Algorithms in Bioinformatics, {WABI}
2018, August 20-22, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {113},
pages = {5:1--5:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.WABI.2018.5},
doi = {10.4230/LIPICS.WABI.2018.5},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/wabi/DondiLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-05866,
author = {Manuel Lafond and
Nadia El{-}Mabrouk and
Katharina T. Huber and
Vincent Moulton},
title = {The complexity of comparing multiply-labelled trees by extending phylogenetic-tree
metrics},
journal = {CoRR},
volume = {abs/1803.05866},
year = {2018},
url = {http://arxiv.org/abs/1803.05866},
eprinttype = {arXiv},
eprint = {1803.05866},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-05866.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-03988,
author = {Riccardo Dondi and
Manuel Lafond and
C{\'{e}}line Scornavacca},
title = {Reconciling Multiple Genes Trees via Segmental Duplications and Losses},
journal = {CoRR},
volume = {abs/1806.03988},
year = {2018},
url = {http://arxiv.org/abs/1806.03988},
eprinttype = {arXiv},
eprint = {1806.03988},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-03988.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/DondiLE17,
author = {Riccardo Dondi and
Manuel Lafond and
Nadia El{-}Mabrouk},
title = {Approximating the correction of weighted and unweighted orthology
and paralogy relations},
journal = {Algorithms Mol. Biol.},
volume = {12},
number = {1},
pages = {4:1--4:15},
year = {2017},
url = {https://doi.org/10.1186/s13015-017-0096-x},
doi = {10.1186/S13015-017-0096-X},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/DondiLE17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbcb/KuitcheLO17,
author = {Esaie Kuitche and
Manuel Lafond and
A{\"{\i}}da Ouangraoua},
title = {Reconstructing protein and gene phylogenies using reconciliation and
soft-clustering},
journal = {J. Bioinform. Comput. Biol.},
volume = {15},
number = {6},
pages = {1740007:1--1740007:25},
year = {2017},
url = {https://doi.org/10.1142/S0219720017400078},
doi = {10.1142/S0219720017400078},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jbcb/KuitcheLO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ploscb/GambetteIJLPS17,
author = {Philippe Gambette and
Leo van Iersel and
Mark Jones and
Manuel Lafond and
Fabio Pardi and
C{\'{e}}line Scornavacca},
title = {Rearrangement moves on rooted phylogenetic networks},
journal = {PLoS Comput. Biol.},
volume = {13},
number = {8},
year = {2017},
url = {https://doi.org/10.1371/journal.pcbi.1005611},
doi = {10.1371/JOURNAL.PCBI.1005611},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ploscb/GambetteIJLPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DobrevKKLMNOSS17,
author = {Stefan Dobrev and
Evangelos Kranakis and
Danny Krizanc and
Manuel Lafond and
J{\'{a}}n Manuch and
Lata Narayanan and
Jaroslav Opatrny and
Sunil M. Shende and
Ladislav Stacho},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Weak Coverage of a Rectangular Barrier},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {196--208},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_17},
doi = {10.1007/978-3-319-57586-5\_17},
timestamp = {Thu, 24 Mar 2022 11:08:56 +0100},
biburl = {https://dblp.org/rec/conf/ciac/DobrevKKLMNOSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/LafondS17,
author = {Manuel Lafond and
C{\'{e}}line Scornavacca},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jakub Radoszewski and
Wojciech Rytter},
title = {On the Weighted Quartet Consensus Problem},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017,
July 4-6, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {78},
pages = {28:1--28:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CPM.2017.28},
doi = {10.4230/LIPICS.CPM.2017.28},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/cpm/LafondS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/DobrevLNO17,
author = {Stefan Dobrev and
Manuel Lafond and
Lata Narayanan and
Jaroslav Opatrny},
editor = {Christian Scheideler and
Mohammad Taghi Hajiaghayi},
title = {Optimal Local Buffer Management for Information Gathering with Adversarial
Traffic},
booktitle = {Proceedings of the 29th {ACM} Symposium on Parallelism in Algorithms
and Architectures, {SPAA} 2017, Washington DC, USA, July 24-26, 2017},
pages = {265--274},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3087556.3087577},
doi = {10.1145/3087556.3087577},
timestamp = {Tue, 06 Nov 2018 16:59:33 +0100},
biburl = {https://dblp.org/rec/conf/spaa/DobrevLNO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/ChauveJLSW17,
author = {C{\'{e}}dric Chauve and
Mark Jones and
Manuel Lafond and
C{\'{e}}line Scornavacca and
Mathias Weller},
editor = {Gabriele Fici and
Marinella Sciortino and
Rossano Venturini},
title = {Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended
Abstract)},
booktitle = {String Processing and Information Retrieval - 24th International Symposium,
{SPIRE} 2017, Palermo, Italy, September 26-29, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10508},
pages = {129--143},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-67428-5\_12},
doi = {10.1007/978-3-319-67428-5\_12},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spire/ChauveJLSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Lafond17,
author = {Manuel Lafond},
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {On Strongly Chordal Graphs That Are Not Leaf Powers},
booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International
Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10520},
pages = {386--398},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6\_29},
doi = {10.1007/978-3-319-68705-6\_29},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Lafond17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DobrevKKLMNOS17,
author = {Stefan Dobrev and
Evangelos Kranakis and
Danny Krizanc and
Manuel Lafond and
J{\'{a}}n Manuch and
Lata Narayanan and
Jaroslav Opatrny and
Ladislav Stacho},
title = {Weak Coverage of a Rectangular Barrier},
journal = {CoRR},
volume = {abs/1701.07294},
year = {2017},
url = {http://arxiv.org/abs/1701.07294},
eprinttype = {arXiv},
eprint = {1701.07294},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DobrevKKLMNOS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Lafond17,
author = {Manuel Lafond},
title = {On strongly chordal graph that are not leaf powers},
journal = {CoRR},
volume = {abs/1703.08018},
year = {2017},
url = {http://arxiv.org/abs/1703.08018},
eprinttype = {arXiv},
eprint = {1703.08018},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Lafond17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JonesLS17,
author = {Mark Jones and
Manuel Lafond and
C{\'{e}}line Scornavacca},
title = {Consistency of orthology and paralogy constraints in the presence
of gene transfers},
journal = {CoRR},
volume = {abs/1705.01240},
year = {2017},
url = {http://arxiv.org/abs/1705.01240},
eprinttype = {arXiv},
eprint = {1705.01240},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/JonesLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChauveJLSW17,
author = {C{\'{e}}dric Chauve and
Mark Jones and
Manuel Lafond and
C{\'{e}}line Scornavacca and
Mathias Weller},
title = {Constructing a Consensus Phylogeny from a Leaf-Removal Distance},
journal = {CoRR},
volume = {abs/1705.05295},
year = {2017},
url = {http://arxiv.org/abs/1705.05295},
eprinttype = {arXiv},
eprint = {1705.05295},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/ChauveJLSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/LafondDE16,
author = {Manuel Lafond and
Riccardo Dondi and
Nadia El{-}Mabrouk},
title = {The link between orthology relations and gene trees: a correction
perspective},
journal = {Algorithms Mol. Biol.},
volume = {11},
pages = {4},
year = {2016},
url = {https://doi.org/10.1186/s13015-016-0067-7},
doi = {10.1186/S13015-016-0067-7},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/LafondDE16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/LafondNE16,
author = {Manuel Lafond and
Emmanuel Noutahi and
Nadia El{-}Mabrouk},
editor = {Roberto Grossi and
Moshe Lewenstein},
title = {Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation
Cost},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2016,
June 27-29, 2016, Tel Aviv, Israel},
series = {LIPIcs},
volume = {54},
pages = {14:1--14:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CPM.2016.14},
doi = {10.4230/LIPICS.CPM.2016.14},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/cpm/LafondNE16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/LafondNW16,
author = {Manuel Lafond and
Lata Narayanan and
Kangkang Wu},
editor = {Jukka Suomela},
title = {Whom to Befriend to Influence People},
booktitle = {Structural Information and Communication Complexity - 23rd International
Colloquium, {SIROCCO} 2016, Helsinki, Finland, July 19-21, 2016, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9988},
pages = {340--357},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-48314-6\_22},
doi = {10.1007/978-3-319-48314-6\_22},
timestamp = {Tue, 29 Dec 2020 18:39:44 +0100},
biburl = {https://dblp.org/rec/conf/sirocco/LafondNW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/DondiEL16,
author = {Riccardo Dondi and
Nadia El{-}Mabrouk and
Manuel Lafond},
editor = {Martin C. Frith and
Christian N{\o}rgaard Storm Pedersen},
title = {Correction of Weighted Orthology and Paralogy Relations - Complexity
and Algorithmic Results},
booktitle = {Algorithms in Bioinformatics - 16th International Workshop, {WABI}
2016, Aarhus, Denmark, August 22-24, 2016. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9838},
pages = {121--136},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-43681-4\_10},
doi = {10.1007/978-3-319-43681-4\_10},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wabi/DondiEL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LafondS16,
author = {Manuel Lafond and
C{\'{e}}line Scornavacca},
title = {On the Weighted Quartet Consensus problem},
journal = {CoRR},
volume = {abs/1610.00505},
year = {2016},
url = {http://arxiv.org/abs/1610.00505},
eprinttype = {arXiv},
eprint = {1610.00505},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LafondS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LafondCEO16,
author = {Manuel Lafond and
C{\'{e}}dric Chauve and
Nadia El{-}Mabrouk and
A{\"{\i}}da Ouangraoua},
title = {Gene Tree Construction and Correction using SuperTree and Reconciliation},
journal = {CoRR},
volume = {abs/1610.05068},
year = {2016},
url = {http://arxiv.org/abs/1610.05068},
eprinttype = {arXiv},
eprint = {1610.05068},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LafondCEO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CordascoGLNRVW16,
author = {Gennaro Cordasco and
Luisa Gargano and
Manuel Lafond and
Lata Narayanan and
Adele A. Rescigno and
Ugo Vaccaro and
Kangkang Wu},
title = {Whom to befriend to influence people},
journal = {CoRR},
volume = {abs/1611.08687},
year = {2016},
url = {http://arxiv.org/abs/1611.08687},
eprinttype = {arXiv},
eprint = {1611.08687},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CordascoGLNRVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/LafondOE15,
author = {Manuel Lafond and
A{\"{\i}}da Ouangraoua and
Nadia El{-}Mabrouk},
title = {Reconstructing a SuperGeneTree minimizing reconciliation},
journal = {{BMC} Bioinform.},
volume = {16},
number = {{S14}},
pages = {S4},
year = {2015},
url = {https://doi.org/10.1186/1471-2105-16-s14-s4},
doi = {10.1186/1471-2105-16-S14-S4},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcbi/LafondOE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LafondS15,
author = {Manuel Lafond and
Ben Seamone},
title = {Hamiltonian Chordal Graphs are not Cycle Extendable},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {2},
pages = {877--887},
year = {2015},
url = {https://doi.org/10.1137/13094551X},
doi = {10.1137/13094551X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/LafondS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/LafondE15,
author = {Manuel Lafond and
Nadia El{-}Mabrouk},
editor = {Mihai Pop and
H{\'{e}}l{\`{e}}ne Touzet},
title = {Orthology Relation and Gene Tree Correction: Complexity Results},
booktitle = {Algorithms in Bioinformatics - 15th International Workshop, {WABI}
2015, Atlanta, GA, USA, September 10-12, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9289},
pages = {66--79},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48221-6\_5},
doi = {10.1007/978-3-662-48221-6\_5},
timestamp = {Thu, 14 Oct 2021 10:34:16 +0200},
biburl = {https://dblp.org/rec/conf/wabi/LafondE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/LafondCDE14,
author = {Manuel Lafond and
C{\'{e}}dric Chauve and
Riccardo Dondi and
Nadia El{-}Mabrouk},
title = {Polytomy refinement for the correction of dubious duplications in
gene trees},
journal = {Bioinform.},
volume = {30},
number = {17},
pages = {519--526},
year = {2014},
url = {https://doi.org/10.1093/bioinformatics/btu463},
doi = {10.1093/BIOINFORMATICS/BTU463},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/LafondCDE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/LafondSSTE13,
author = {Manuel Lafond and
Magali Semeria and
Krister M. Swenson and
Eric Tannier and
Nadia El{-}Mabrouk},
title = {Gene tree correction guided by orthology},
journal = {{BMC} Bioinform.},
volume = {14},
number = {{S-15}},
pages = {S5},
year = {2013},
url = {https://doi.org/10.1186/1471-2105-14-S15-S5},
doi = {10.1186/1471-2105-14-S15-S5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/LafondSSTE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/IEEEares/AimeurL13,
author = {Esma A{\"{\i}}meur and
Manuel Lafond},
title = {The Scourge of Internet Personal Data Collection},
booktitle = {2013 International Conference on Availability, Reliability and Security,
{ARES} 2013, Regensburg, Germany, September 2-6, 2013},
pages = {821--828},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/ARES.2013.110},
doi = {10.1109/ARES.2013.110},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/IEEEares/AimeurL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/daglib/p/LafondSE13,
author = {Manuel Lafond and
Krister M. Swenson and
Nadia El{-}Mabrouk},
editor = {C{\'{e}}dric Chauve and
Nadia El{-}Mabrouk and
Eric Tannier},
title = {Error Detection and Correction of Gene Trees},
booktitle = {Models and Algorithms for Genome Evolution},
pages = {261--285},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-1-4471-5298-9\_12},
doi = {10.1007/978-1-4471-5298-9\_12},
timestamp = {Tue, 16 May 2017 14:01:34 +0200},
biburl = {https://dblp.org/rec/books/daglib/p/LafondSE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LafondS13,
author = {Manuel Lafond and
Ben Seamone},
title = {Hamiltonian chordal graphs are not cycle extendible},
journal = {CoRR},
volume = {abs/1311.5863},
year = {2013},
url = {http://arxiv.org/abs/1311.5863},
eprinttype = {arXiv},
eprint = {1311.5863},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LafondS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pst/LafondBA12,
author = {Manuel Lafond and
Pierre{-}Olivier Brosseau and
Esma A{\"{\i}}meur},
editor = {Nora Cuppens{-}Boulahia and
Philip Fong and
Joaqu{\'{\i}}n Garc{\'{\i}}a{-}Alfaro and
Stephen Marsh and
Jan{-}Philipp Stegh{\"{o}}fer},
title = {Privacy invasion in business environments},
booktitle = {Tenth Annual International Conference on Privacy, Security and Trust,
{PST} 2012, Paris, France, July 16-18, 2012},
pages = {221--224},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/PST.2012.6297944},
doi = {10.1109/PST.2012.6297944},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pst/LafondBA12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/LafondSE12,
author = {Manuel Lafond and
Krister M. Swenson and
Nadia El{-}Mabrouk},
editor = {Benjamin J. Raphael and
Jijun Tang},
title = {An Optimal Reconciliation Algorithm for Gene Trees with Polytomies},
booktitle = {Algorithms in Bioinformatics - 12th International Workshop, {WABI}
2012, Ljubljana, Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7534},
pages = {106--122},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33122-0\_9},
doi = {10.1007/978-3-642-33122-0\_9},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wabi/LafondSE12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
