1. Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems

   • Pierre Fraigniaud
   • Magnús M. Halldórsson
   • Adi Rosén

   OriginalPaper 04 April 2015 Pages: 1205 - 1223

   

2. Maximum Likelihood Analysis of the Ford–Fulkerson Method on Special Graphs

   • Ulrich Laube
   • Markus E. Nebel

   OriginalPaper 10 April 2015 Pages: 1224 - 1266

   

3. Configurations and Minority in the String Consensus Problem

   • Amihood Amir
   • Haim Paryenty
   • Liam Roditty

   OriginalPaper 17 April 2015 Pages: 1267 - 1292

   

4. Outer 1-Planar Graphs

   • Christopher Auer
   • Christian Bachmaier
   • Josef Reislhuber

   OriginalPaper 22 April 2015 Pages: 1293 - 1320

   

5. A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound

   • Sanjit Chatterjee
   • Chethan Kamath

   OriginalPaper 30 April 2015 Pages: 1321 - 1362

   

6. On Resilient Graph Spanners

   • Giorgio Ausiello
   • Paolo G. Franciosa
   • Andrea Ribichini

   OriginalPaper 02 May 2015 Pages: 1363 - 1385

   

7. A ‘Stochastic Safety Radius’ for Distance-Based Tree Reconstruction

   • Olivier Gascuel
   • Mike Steel

   OriginalPaper 06 May 2015 Pages: 1386 - 1403

   

8. Distance Oracles for Time-Dependent Networks

   • Spyros Kontogiannis
   • Christos Zaroliagis

   OriginalPaper 06 May 2015 Pages: 1404 - 1434

   

9. Assigning Channels Via the Meet-in-the-Middle Approach

   • Łukasz Kowalik
   • Arkadiusz Socała

   OriginalPaper Open access 13 May 2015 Pages: 1435 - 1452

   

10. Structural Parameterizations for Boxicity

    • Henning Bruhn
    • Morgan Chopin
    • Oliver Schaudt

    OriginalPaper 04 June 2015 Pages: 1453 - 1472

    

11. Erratum to: Signature Theory in Holographic Algorithms

    • Jin-Yi Cai
    • Pinyan Lu

    Erratum 11 November 2015 Pages: 1473 - 1476