International conferences

• ESA2007, Eilat, Israel,
  
  A practical efficient fptas for the 0-1 multi-objective knapsack problem.

• WEA 2007, Rome, Italie,
  
  An efficient implementation for the 0-1 multi-objective knapsack problem.

• COCOON 2006, Taipei, Taiwan,
  
  Approximating min-max (regret) versions of some polynomial problems.

• EURO 2006, Reykjavik, Islande,
  
  On the Complexity of Global Constraint Satisfaction.
  
  Complexity of the min-max (regret) versions of cut problems

• ISAAC 2005, Sanya, Hainan, Chine,
  
  On the Complexity of Global Constraint Satisfaction.
  
  Complexity of the min-max (regret) versions of cut problems

• ESA 2005, Mallorca, Espagne,
  
  Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack.

• COCOON 2005, Kunming, Yunnan, Chine,
  
  Complexity and approximation of satisfactory partition problems.

• ISORA 2005, Lhasa, Tibet, Chine,
  
  Pseudo-polynomial time algorithms for min-max and min-max regret problems.

• SOFSEM 2005, Liptovsky Jan, Slovaquie,
  
  Greedy differential approximations for Min Set Cover.

• ISAAC 2004, Hong Kong, Chine,
  
  PolyAPX and PTAS-completeness in standard and differential approximation.

• ISAAC 2003, Kyoto, Japon,
  
  On the existence and determination of satisfactory partitions in a graph.

• MFCS 2003, Bratislava, Slovaquie,
  
  Completeness in differential approximation classes.

• CIAC 2003, Rome, Italie,
  
  Differential Approximation for some Vehicle Routing Problems.

• SWAT 2002, Turku, Finlande,
  
  Approximability of Dense Instances of Nearest Codeword Problem.

• ECCO 2002, Lugano, Suisse,
  
  Generalized Minimum Spanning Tree.

• Balkan Conference on Operation Research 2002, Thessaloniki, Grèce,
  
  Differential approximation for satisfiability and related problems.

• FRANCORO 2001, Québec, Canada,
  
  Partition satisfaisante d'un graphe.

• FCT 1999, Iasi, Roumanie,
  
  polynomial time approximation scheme for dense Min 2Sat.

• ICALP 1998, Aalborg, Danemark,
  
  Efficient approximation algorithms for the Subset-Sums Equality problem.

• STACS 1998, Paris, France,
  
  On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs.

• ICANNGA 1995, Alès, France,
  
  A genetic algorithm for the maximal clique problem.