On the Computational Complexity of Measuring Global Stability of Banking Networks Piotr BermanBhaskar DasGuptaMarek Karpinski OriginalPaper 26 March 2013 Pages: 595 - 647
A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs Christos KoufogiannakisNeal E. Young OriginalPaper 28 March 2013 Pages: 648 - 674
Contention Resolution under Selfishness George ChristodoulouKatrina LigettEvangelia Pyrga OriginalPaper 11 April 2013 Pages: 675 - 693
Preface Algorithms and Computation (ISAAC 2012) Kun-Mao ChaoTsan-Sheng HsuD. T. Lee EditorialNotes 29 August 2014 Pages: 694 - 695
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets Meng HeJ. Ian MunroGelin Zhou OriginalPaper 08 July 2014 Pages: 696 - 717
The Minimum Vulnerability Problem Sepehr AssadiEhsan Emamjomeh-ZadehHamid Zarrabi-Zadeh OriginalPaper 29 August 2014 Pages: 718 - 731
Strong Conflict-Free Coloring for Intervals Panagiotis CheilarisLuisa GarganoShakhar Smorodinsky OriginalPaper 27 August 2014 Pages: 732 - 749
