1. An extension of Stein-Lovász theorem and some of its applications

   • Guang-Siang Lee

   OriginalPaper 05 October 2011 Pages: 1 - 18

2. The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs

   • Jean Cardinal
   • Erik D. Demaine
   • Oren Weimann

   OriginalPaper 07 October 2011 Pages: 19 - 46

3. Edge lifting and total domination in graphs

   • Wyatt J. Desormeaux
   • Teresa W. Haynes
   • Michael A. Henning

   OriginalPaper 19 October 2011 Pages: 47 - 59

4. A 6/5-approximation algorithm for the maximum 3-cover problem

   • Ioannis Caragiannis
   • Gianpiero Monaco

   OriginalPaper 12 November 2011 Pages: 60 - 77

5. Edge-colouring of joins of regular graphs II

   • Caterina De Simone
   • Anna Galluccio

   OriginalPaper 19 October 2011 Pages: 78 - 90

6. The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle

   • H. Karami
   • R. Khoeilar
   • S. M. Sheikholeslami

   OriginalPaper 19 October 2011 Pages: 91 - 98

7. Computational risk management techniques for fixed charge network flow problems with uncertain arc failures

   • Alexey Sorokin
   • Vladimir Boginski
   • Panos M. Pardalos

   OriginalPaper 21 October 2011 Pages: 99 - 122

8. Two-stage proportionate flexible flow shop to minimize the makespan

   • Byung-Cheon Choi
   • Kangbok Lee

   OriginalPaper 30 November 2011 Pages: 123 - 134

9. A new two-party bargaining mechanism

   • Y. H. Gu
   • M. Goh
   • G. C. Tang

   OriginalPaper 03 November 2011 Pages: 135 - 163