François Delbot

According to our database1, François Delbot authored at least 13 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the complexity of Dominating Set for graphs with fixed diameter.
Theor. Comput. Sci., 2024

2022
Experimental Comparison of Metaheuristics for Feature Selection in Machine Learning in the Medical Context.
Proceedings of the Artificial Intelligence Applications and Innovations, 2022

2021
On the vertices belonging to all, some, none minimum dominating set.
Discret. Appl. Math., 2021

2020
On Minimum Dominating Sets in cubic and (claw, H)-free graphs.
CoRR, 2020

Manifold Learning for Innovation Funding: Identification of Potential Funding Recipients.
Proceedings of the Artificial Intelligence Applications and Innovations, 2020

2018
Minimum Dominating Set and Maximum Independent Set for Evaluation of EU Funding Polices in Collaboration Networks.
Proceedings of the Operations Research Proceedings 2018, 2018

2014
Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013
New Approximation Algorithms for the Vertex Cover Problem.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2011
Analyse du nombre de perturbations lors du maintien d'un arbre de connexion de faible diamètre.
Tech. Sci. Informatiques, 2011

2010
Analytical and experimental comparison of six algorithms for the vertex cover problem.
ACM J. Exp. Algorithmics, 2010

2009
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 dynamiques. (Beyond the worst case evaluation: Comparison and average evaluation of optimization processes in the case of the vertex cover problem and trees connecting groups).
PhD thesis, 2009

Mean analysis of an online algorithm for the vertex cover problem.
Inf. Process. Lett., 2009

2008
A better list heuristic for vertex cover.
Inf. Process. Lett., 2008


  Loading...