1. Global Strong Defensive Alliances of Sierpiński-Like Graphs

   • Chien-Hung Lin
   • Jia-Jie Liu
   • Yue-Li Wang

   OriginalPaper 29 August 2012 Pages: 365 - 385

   

2. Static Strategies for Worksharing with Unrecoverable Interruptions

   • Anne Benoit
   • Yves Robert
   • Frédéric Vivien

   OriginalPaper 30 September 2012 Pages: 386 - 423

   

3. Nonpreemptive Coordination Mechanisms for Identical Machines

   • Konstantinos Kollias

   OriginalPaper 03 October 2012 Pages: 424 - 440

4. On the Complexity of Pareto-Optimal Nash and Strong Equilibria

   • Martin Hoefer
   • Alexander Skopalik

   OriginalPaper 25 October 2012 Pages: 441 - 453

   

5. Unbalanced Graph Partitioning

   • Angsheng Li
   • Peng Zhang

   OriginalPaper 09 November 2012 Pages: 454 - 466

   

6. The Complexity of Computing Minimal Unidirectional Covering Sets

   • Dorothea Baumeister
   • Felix Brandt
   • Jörg Rothe

   OriginalPaper 18 November 2012 Pages: 467 - 502

   

7. Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series

   • Eric Allender
   • V. Arvind
   • Meena Mahajan

   Commentary 02 May 2013 Pages: 503 - 506