1. Is Submodularity Testable?

   • C. Seshadhri
   • Jan Vondrák

   OriginalPaper 21 November 2012 Pages: 1 - 25

2. Robust Algorithms for Preemptive Scheduling

   • Leah Epstein
   • Asaf Levin

   OriginalPaper 21 November 2012 Pages: 26 - 57

   

3. Shortest Path Problems on a Polyhedral Surface

   • Atlas F. Cook IV
   • Carola Wenk

   OriginalPaper 28 November 2012 Pages: 58 - 77

   

4. Approximating Fixation Probabilities in the Generalized Moran Process

   • Josep Díaz
   • Leslie Ann Goldberg
   • Paul G. Spirakis

   OriginalPaper 28 November 2012 Pages: 78 - 91

5. Compact Navigation and Distance Oracles for Graphs with Small Treewidth

   • Arash Farzan
   • Shahin Kamali

   OriginalPaper 28 November 2012 Pages: 92 - 116

   

6. Counting or Producing All Fixed Cardinality Transversals

   • Marcel Wild

   OriginalPaper 29 November 2012 Pages: 117 - 129

   

7. Augmenting Edge-Connectivity between Vertex Subsets

   • Toshimasa Ishii
   • Kazuhisa Makino

   OriginalPaper 04 December 2012 Pages: 130 - 147

   

8. On the Least Trimmed Squares Estimator

   • David M. Mount
   • Nathan S. Netanyahu
   • Angela Y. Wu

   OriginalPaper 04 December 2012 Pages: 148 - 183

   

9. Analysis of Agglomerative Clustering

   • Marcel R. Ackermann
   • Johannes Blömer
   • Christian Sohler

   OriginalPaper 12 December 2012 Pages: 184 - 215

   

10. Enumerating Minimal Subset Feedback Vertex Sets

    • Fedor V. Fomin
    • Pinar Heggernes
    • Yngve Villanger

    OriginalPaper 15 December 2012 Pages: 216 - 231

    

11. Efficient Fully-Compressed Sequence Representations

    • Jérémy Barbay
    • Francisco Claude
    • Yakov Nekrich

    OriginalPaper 15 December 2012 Pages: 232 - 268