 | 2009 |
|---|
| 11 |       | Bertrand Estellon,
Frédéric Gardi,
Karim Nouioua:
High-Performance Local Search for Task Scheduling with Human Resource Allocation.
SLS 2009: 1-15 |
| 10 | | 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 |
|---|
| 9 | | Victor Chepoi,
Feodor F. Dragan,
Bertrand Estellon,
Michel Habib,
Yann Vaxès:
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.
Symposium on Computational Geometry 2008: 59-68 |
| 8 | | 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.
Electronic Notes in Discrete Mathematics 31: 231-234 (2008) |
| 7 | | Bertrand Estellon,
Frédéric Gardi,
Karim Nouioua:
Two local search approaches for solving real-life car sequencing problems.
European Journal of Operational Research 191(3): 928-944 (2008) |
| 6 | | 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 |
|---|
| 5 | | Victor Chepoi,
Bertrand Estellon:
Packing and Covering delta -Hyperbolic Spaces by Balls.
APPROX-RANDOM 2007: 59-73 |
| 4 | | Victor Chepoi,
Bertrand Estellon,
Yann Vaxès:
Covering Planar Graphs with a Fixed Number of Balls.
Discrete & Computational Geometry 37(2): 237-244 (2007) |
| 2006 |
|---|
| 3 | | 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) |
| 2005 |
|---|
| 2 | | Victor Chepoi,
Bertrand Estellon,
Yann Vaxès:
Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length.
WADS 2005: 282-293 |
| 1 | | Victor Chepoi,
Bertrand Estellon,
Karim Nouioua,
Yann Vaxès:
Mixed covering of trees and the augmentation problem with odd diameter constraints.
Electronic Notes in Discrete Mathematics 22: 405-408 (2005) |
