Vincent Berry
Orcid: 0000-0001-7271-4027Affiliations:
- LIRMM Montpellier, France
According to our database1,
Vincent Berry
authored at least 40 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
Is it Worth Migrating a Monolith to Microservices? An Experience Report on Performance, Availability and Energy Usage.
Proceedings of the IEEE International Conference on Web Services, 2024
2022
Proceedings of the 2022 Working Group Reports on Innovation and Technology in Computer Science Education, 2022
Proceedings of the ITiCSE 2022: Innovation and Technology in Computer Science Education, Dublin, Ireland, July 8, 2022
Proceedings of the ITiCSE 2022: Innovation and Technology in Computer Science Education, Dublin, Ireland, July 8, 2022
2021
PLoS Comput. Biol., 2021
2020
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020
2018
2016
2013
J. Bioinform. Comput. Biol., 2013
Algorithms Mol. Biol., 2013
2012
Accounting for Gene Tree Uncertainties Improves Gene Trees and Reconciliation Inference.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012
2011
Inf. Comput., 2011
Briefings Bioinform., 2011
2010
IEEE ACM Trans. Comput. Biol. Bioinform., 2010
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers.
Proceedings of the Comparative Genomics - International Workshop, 2010
2009
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems.
Discret. Appl. Math., 2009
Proceedings of the Language and Automata Theory and Applications, 2009
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
BMC Bioinform., 2008
Algorithmica, 2008
2007
Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort.
Eur. J. Oper. Res., 2007
2006
Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006
2005
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
2004
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004
2001
Adv. Appl. Math., 2001
2000
Theor. Comput. Sci., 2000
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
1999
Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999
Proceedings of the Algorithms, 1999
1995
Évaluation répartie asynchrone de (certaines) requêtes DATALOG.
Proceedings of the JFPLC'95, 1995
1994
Distinguer les variables distinguées.
Proceedings of the JFPLC'94, 1994
1993
Generating Goals and Their Use In Recursive Query Processing.
Proceedings of the Logic Programming, 1993