default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Delbot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Valentin Bouquet
, François Delbot, Christophe Picouleau, Stéphane Rovedakis:
On the complexity of Dominating Set for graphs with fixed diameter. Theor. Comput. Sci. 1001: 114561 (2024)- 2023
- [i4]Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis:
On the complexity of Dominating Set for graphs with fixed diameter. CoRR abs/2304.09701 (2023) - 2022
- [c5]Thibault Anani, François Delbot, Jean-François Pradat-Peyre:
Experimental Comparison of Metaheuristics for Feature Selection in Machine Learning in the Medical Context. AIAI (2) 2022: 194-205 - 2021
- [j5]Valentin Bouquet, François Delbot, Christophe Picouleau:
On the vertices belonging to all, some, none minimum dominating set. Discret. Appl. Math. 288: 9-19 (2021) - 2020
- [c4]Vincent Grollemund, Gaétan Le Chat, Jean-François Pradat-Peyre, François Delbot:
Manifold Learning for Innovation Funding: Identification of Potential Funding Recipients. AIAI (1) 2020: 119-127 - [i3]Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis:
On Minimum Dominating Sets in cubic and (claw, H)-free graphs. CoRR abs/2002.12232 (2020)
2010 – 2019
- 2019
- [i2]Valentin Bouquet, François Delbot, Christophe Picouleau:
On the vertices belonging to all, some, none minimum dominating set. CoRR abs/1909.02843 (2019) - 2018
- [c3]Valentin Bouquet, Kymble Christophe, François Delbot, Gaétan Le Chat, Jean-François Pradat-Peyre:
Minimum Dominating Set and Maximum Independent Set for Evaluation of EU Funding Polices in Collaboration Networks. OR 2018: 243-249 - 2014
- [c2]François Delbot, Christian Laforest, Stephane Rovedakis:
Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems. OPODIS 2014: 307-322 - [i1]François Delbot, Christian Laforest, Stephane Rovedakis:
Self-stabilizing algorithms for Connected Vertex Cover and Clique decomposition problems. CoRR abs/1408.2116 (2014) - 2013
- [c1]François Delbot, Christian Laforest, Raksmey Phan:
New Approximation Algorithms for the Vertex Cover Problem. IWOCA 2013: 438-442 - 2011
- [j4]Etienne Birmelé, François Delbot, Christian Laforest, Nicolas Thibault:
Analyse du nombre de perturbations lors du maintien d'un arbre de connexion de faible diamètre. Tech. Sci. Informatiques 30(7): 781-808 (2011) - 2010
- [j3]François Delbot, Christian Laforest:
Analytical and experimental comparison of six algorithms for the vertex cover problem. ACM J. Exp. Algorithmics 15 (2010)
2000 – 2009
- 2009
- [b1]François Delbot:
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). University of Évry Val d'Essonne, France, 2009 - [j2]Etienne Birmelé, François Delbot, Christian Laforest:
Mean analysis of an online algorithm for the vertex cover problem. Inf. Process. Lett. 109(9): 436-439 (2009) - 2008
- [j1]François Delbot, Christian Laforest:
A better list heuristic for vertex cover. Inf. Process. Lett. 107(3-4): 125-127 (2008)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-03 00:59 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:
