| 595 | -- | 647 | Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski. On the Computational Complexity of Measuring Global Stability of Banking Networks |
| 648 | -- | 674 | Christos Koufogiannakis, Neal E. Young. A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs |
| 675 | -- | 693 | George Christodoulou 0001, Katrina Ligett, Evangelia Pyrga. Contention Resolution under Selfishness |
| 694 | -- | 695 | Kun-Mao Chao, Tsan-sheng Hsu, D. T. Lee. Preface Algorithms and Computation (ISAAC 2012) |
| 696 | -- | 717 | Meng He, J. Ian Munro, Gelin Zhou. A Framework for Succinct Labeled Ordinal Trees over Large Alphabets |
| 718 | -- | 731 | Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh. The Minimum Vulnerability Problem |
| 732 | -- | 749 | Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky. Strong Conflict-Free Coloring for Intervals |