1. On the Computational Complexity of Measuring Global Stability of Banking Networks

   • Piotr Berman
   • Bhaskar DasGupta
   • Marek Karpinski

   OriginalPaper 26 March 2013 Pages: 595 - 647

   

2. A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs

   • Christos Koufogiannakis
   • Neal E. Young

   OriginalPaper 28 March 2013 Pages: 648 - 674

   

3. Contention Resolution under Selfishness

   • George Christodoulou
   • Katrina Ligett
   • Evangelia Pyrga

   OriginalPaper 11 April 2013 Pages: 675 - 693

   

4. Preface Algorithms and Computation (ISAAC 2012)

   • Kun-Mao Chao
   • Tsan-Sheng Hsu
   • D. T. Lee

   EditorialNotes 29 August 2014 Pages: 694 - 695

5. A Framework for Succinct Labeled Ordinal Trees over Large Alphabets

   • Meng He
   • J. Ian Munro
   • Gelin Zhou

   OriginalPaper 08 July 2014 Pages: 696 - 717

   

6. The Minimum Vulnerability Problem

   • Sepehr Assadi
   • Ehsan Emamjomeh-Zadeh
   • Hamid Zarrabi-Zadeh

   OriginalPaper 29 August 2014 Pages: 718 - 731

   

7. Strong Conflict-Free Coloring for Intervals

   • Panagiotis Cheilaris
   • Luisa Gargano
   • Shakhar Smorodinsky

   OriginalPaper 27 August 2014 Pages: 732 - 749