François Delbot

17 papers B 1C 1Journal 11Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Partition of graphs with maximum degree ratio.
Ann. Oper. Res.
Valentin Bouquet, François Delbot, Christophe Picouleau
2024 J jnl
On the complexity of Dominating Set for graphs with fixed diameter.
Theor. Comput. Sci.
Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis
2023 J jnl
On the complexity of Dominating Set for graphs with fixed diameter.
CoRR
Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis
2022 — conf
Experimental Comparison of Metaheuristics for Feature Selection in Machine Learning in the Medical Context.
AIAI (2)
Thibault Anani, François Delbot, Jean-François Pradat-Peyre
2021 J jnl
On the vertices belonging to all, some, none minimum dominating set.
Discret. Appl. Math.
Valentin Bouquet, François Delbot, Christophe Picouleau
2020 — conf
Manifold Learning for Innovation Funding: Identification of Potential Funding Recipients.
AIAI (1)
Vincent Grollemund, Gaétan Le Chat, Jean-François Pradat-Peyre, François Delbot
2020 J jnl
On Minimum Dominating Sets in cubic and (claw, H)-free graphs.
CoRR
Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis
2019 J jnl
On the vertices belonging to all, some, none minimum dominating set.
CoRR
Valentin Bouquet, François Delbot, Christophe Picouleau
2018 — conf
Minimum Dominating Set and Maximum Independent Set for Evaluation of EU Funding Polices in Collaboration Networks.
OR
Valentin Bouquet, Kymble Christophe, François Delbot, Gaétan Le Chat, Jean-François Pradat-Peyre
2014 B conf
Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems.
OPODIS
François Delbot, Christian Laforest, Stephane Rovedakis
2014 J jnl
Self-stabilizing algorithms for Connected Vertex Cover and Clique decomposition problems.
CoRR
François Delbot, Christian Laforest, Stephane Rovedakis
2013 C conf
New Approximation Algorithms for the Vertex Cover Problem.
IWOCA
François Delbot, Christian Laforest, Raksmey Phan
2011 J jnl
Analyse du nombre de perturbations lors du maintien d'un arbre de connexion de faible diamètre.
Tech. Sci. Informatiques
Etienne Birmelé, François Delbot, Christian Laforest, Nicolas Thibault
2010 J jnl
Analytical and experimental comparison of six algorithms for the vertex cover problem.
ACM J. Exp. Algorithmics
François Delbot, Christian Laforest
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).
François Delbot
2009 J jnl
Mean analysis of an online algorithm for the vertex cover problem.
Inf. Process. Lett.
Etienne Birmelé, François Delbot, Christian Laforest
2008 J jnl
A better list heuristic for vertex cover.
Inf. Process. Lett.
François Delbot, Christian Laforest