1. Fibonacci index and stability number of graphs: a polyhedral study

   • Véronique Bruyère
   • Hadrien Mélot

   OriginalPaper 21 May 2009 Pages: 207 - 228

2. Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases

   • Serafino Cicerone
   • Gianlorenzo D’Angelo
   • Alfredo Navarra

   OriginalPaper 19 August 2009 Pages: 229 - 257

3. A 6.55 factor primal-dual approximation algorithm for the connected facility location problem

   • Hyunwoo Jung
   • Mohammad Khairul Hasan
   • Kyung-Yong Chwa

   OriginalPaper 21 May 2009 Pages: 258 - 271

4. Flows with unit path capacities and related packing and covering problems

   • Maren Martens
   • Martin Skutella

   OriginalPaper 21 May 2009 Pages: 272 - 293

5. Multiple hypernode hitting sets and smallest two-cores with targets

   • Peter Damaschke

   OriginalPaper 29 May 2009 Pages: 294 - 306

6. On recovering syntenic blocks from comparative maps

   • Zhixiang Chen
   • Bin Fu
   • Binhai Zhu

   OriginalPaper 29 May 2009 Pages: 307 - 318