| Machine learning in amyotrophic lateral sclerosis: achievements, pitfalls, and future directions V Grollemund, PF Pradat, G Querin, F Delbot, G Le Chat, JF Pradat-Peyre, ... Frontiers in neuroscience 13, 438192, 2019 | 124 | 2019 |
| Development and validation of a 1-year survival prognosis estimation model for Amyotrophic Lateral Sclerosis using manifold learning algorithm UMAP V Grollemund, GL Chat, MS Secchi-Buhour, F Delbot, JF Pradat-Peyre, ... Scientific reports 10 (1), 13378, 2020 | 54 | 2020 |
| A better list heuristic for vertex cover F Delbot, C Laforest Information Processing Letters 107 (3-4), 125--127, 2008 | 38 | 2008 |
| Manifold learning for amyotrophic lateral sclerosis functional loss assessment: Development and validation of a prognosis model V Grollemund, G Le Chat, MS Secchi-Buhour, F Delbot, JF Pradat-Peyre, ... Journal of neurology 268 (3), 825-850, 2021 | 30 | 2021 |
| Analytical and experimental comparison of six algorithms for the vertex cover problem F Delbot, C Laforest Journal of Experimental Algorithmics (JEA) 15, 1.1-1.27, 2010 | 22 | 2010 |
| Mean analysis of an online algorithm for the vertex cover problem E Birmelé, F Delbot, C Laforest Information Processing Letters 109 (9), 436-439, 2009 | 11 | 2009 |
| New approximation algorithms for the vertex cover problem F Delbot, C Laforest, R Phan Combinatorial Algorithms: 24th International Workshop, IWOCA 2013, Rouen …, 2013 | 10 | 2013 |
| Self-stabilizing algorithms for connected vertex cover and clique decomposition problems F Delbot, C Laforest, S Rovedakis Principles of Distributed Systems: 18th International Conference, OPODIS …, 2014 | 8 | 2014 |
| Hardness results and approximation algorithms for discrete optimization problems with conditional and unconditional forbidden vertices F Delbot, C Laforest, R Phan LIP6-Laboratoire d'Informatique de Paris 6; LIMOS; Univerisité Paris X …, 2016 | 7 | 2016 |
| Graphs with forbidden and required vertices F Delbot, C Laforest, R Phan ALGOTEL 2015—17èmes Rencontres Francophones sur les Aspects Algorithmiques …, 2015 | 7 | 2015 |
| On the vertices belonging to all, some, none minimum dominating set V Bouquet, F Delbot, C Picouleau Discrete Applied Mathematics 288, 9-19, 2021 | 4 | 2021 |
| Au delà de l'évaluation en pire cas: comparaison et évaluation en moyenne de processus d'optimisation pour le problème du vertex cover et des arbres de connexion de groupes … F Delbot Université d'Evry-Val d'Essonne, 2009 | 4 | 2009 |
| New Approximation Algorithms for The Vertex Cover Problem and Variants F Delbot, C Laforest, R Phan | 3 | 2013 |
| Partition of graphs with maximum degree ratio V Bouquet, F Delbot, C Picouleau arXiv preprint arXiv:2007.12434, 2020 | 2 | 2020 |
| Évaluation en moyenne d'un algorithme pour la mise à jour d'un arbre de connexion F Delbot, C Laforest, N Thibault 9ème Rencontres Francophones sur les Aspects Algorithmiques des …, 2007 | 2 | 2007 |
| Experimental Comparison of Metaheuristics for Feature Selection in Machine Learning in the Medical Context T Anani, F Delbot, JF Pradat-Peyre IFIP International Conference on Artificial Intelligence Applications and …, 2022 | 1 | 2022 |
| On Minimum Dominating Sets in cubic and (claw, H)-free graphs V Bouquet, F Delbot, C Picouleau, S Rovedakis arXiv preprint arXiv:2002.12232, 2020 | 1 | 2020 |
| Manifold learning for innovation funding: identification of potential funding recipients V Grollemund, GL Chat, JF Pradat-Peyre, F Delbot Artificial Intelligence Applications and Innovations: 16th IFIP WG 12.5 …, 2020 | 1 | 2020 |
| Minimum Dominating Set and Maximum Independent Set for evaluation of EU funding polices in collaboration networks V Bouquet, K Christophe, F Delbot, GL Chat, JF Pradat-Peyre Operations Research Proceedings 2018: Selected Papers of the Annual …, 2019 | 1 | 2019 |
| Comparaison de 4 algorithmes pour le probleme du vertex cover F Delbot, C Laforest Journées Graphes et Algorithmes, 2010 | 1 | 2010 |
Jean-François Pradat-PeyreUniv. Paris Nanterre & Sorbonne Université (LIP6)Dirección de correo verificada de parisnanterre.fr
