default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBertrand Estellon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
[j12]Victor Chepoi, Bertrand Estellon, Guyslain Naves
:
Packing and Covering with Balls on Busemann Surfaces. Discret. Comput. Geom. 57(4): 985-1011 (2017)- 2013
- [j11]Bertrand Estellon, Frédéric Gardi:
Car sequencing is NP-hard: a short proof. J. Oper. Res. Soc. 64(10): 1503-1504 (2013) - 2012
- [j10]Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang Xiang:
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. Algorithmica 62(3-4): 713-732 (2012) - 2011
- [j9]Thierry Benoist, Bertrand Estellon, Frédéric Gardi, Romain Megel, Karim Nouioua:
LocalSolver 1.x: a black-box local-search solver for 0-1 programming. 4OR 9(3): 299-316 (2011) - [j8]Thierry Benoist, Frédéric Gardi, Antoine Jeanjean, Bertrand Estellon:
Randomized Local Search for Real-Life Inventory Routing. Transp. Sci. 45(3): 381-398 (2011) - 2008
- [j7]Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès:
Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. Electron. Notes Discret. Math. 31: 231-234 (2008) - [j6]Bertrand Estellon, Frédéric Gardi, Karim Nouioua:
Two local search approaches for solving real-life car sequencing problems. Eur. J. Oper. Res. 191(3): 928-944 (2008) - [j5]Victor Chepoi, Bertrand Estellon, Yann Vaxès:
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length. Theor. Comput. Sci. 401(1-3): 131-143 (2008) - 2007
- [j4]Victor Chepoi, Bertrand Estellon, Yann Vaxès:
Covering Planar Graphs with a Fixed Number of Balls. Discret. Comput. Geom. 37(2): 237-244 (2007) - 2006
- [j3]Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès:
Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. Algorithmica 45(2): 209-226 (2006) - [j2]Bertrand Estellon, Frédéric Gardi, Karim Nouioua:
Large neighborhood improvements for solving car sequencing problems. RAIRO Oper. Res. 40(4): 355-379 (2006) - 2005
- [j1]Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès:
Mixed covering of trees and the augmentation problem with odd diameter constraints. Electron. Notes Discret. Math. 22: 405-408 (2005)
Conference and Workshop Papers
- 2009
- [c5]Bertrand Estellon, Frédéric Gardi, Karim Nouioua:
High-Performance Local Search for Task Scheduling with Human Resource Allocation. SLS 2009: 1-15 - [c4]Thierry Benoist, Bertrand Estellon, Frédéric Gardi, Antoine Jeanjean:
High-Performance Local Search for Solving Real-Life Inventory Routing Problems. SLS 2009: 105-109 - 2008
- [c3]Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès:
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. SCG 2008: 59-68 - 2007
- [c2]Victor Chepoi, Bertrand Estellon:
Packing and Covering delta -Hyperbolic Spaces by Balls. APPROX-RANDOM 2007: 59-73 - 2005
- [c1]Victor Chepoi, Bertrand Estellon, Yann Vaxès:
Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length. WADS 2005: 282-293
Informal and Other Publications
- 2015
- [i1]Victor Chepoi, Bertrand Estellon, Guyslain Naves:
Packing and covering with balls on Busemann surfaces. CoRR abs/1508.00778 (2015)
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-04-24 22:48 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:
