1. Linear-Space Data Structures for Range Minority Query in Arrays

   • Timothy M. Chan
   • Stephane Durocher
   • Bryan T. Wilkinson

   OriginalPaper 15 April 2014 Pages: 901 - 913

   

2. Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective

   • Paola Bonizzoni
   • Riccardo Dondi
   • Italo Zoppis

   OriginalPaper 12 April 2014 Pages: 914 - 939

   

3. A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP

   • Keith Edwards
   • Eric McDermid

   OriginalPaper 03 May 2014 Pages: 940 - 968

   

4. A Comparison of Performance Measures for Online Algorithms

   • Joan Boyar
   • Sandy Irani
   • Kim S. Larsen

   OriginalPaper 10 May 2014 Pages: 969 - 994

   

5. Augmenting Graphs to Minimize the Diameter

   • Fabrizio Frati
   • Serge Gaspers
   • Luke Mathieson

   OriginalPaper 16 May 2014 Pages: 995 - 1010

   

6. Register Loading via Linear Programming

   • Gruia Calinescu
   • Minming Li

   OriginalPaper 30 May 2014 Pages: 1011 - 1032

   

7. A Linear-Time Algorithm for Testing Outer-1-Planarity

   • Seok-Hee Hong
   • Peter Eades
   • Yusuke Suzuki

   OriginalPaper 29 May 2014 Pages: 1033 - 1054

   

8. Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks

   • Gianlorenzo D’Angelo
   • Gabriele Di Stefano
   • Karol Suchan

   OriginalPaper 31 May 2014 Pages: 1055 - 1096

   

9. Space–Time Trade-offs for Stack-Based Algorithms

   • Luis Barba
   • Matias Korman
   • Rodrigo I. Silveira

   OriginalPaper 23 August 2014 Pages: 1097 - 1129

   

10. The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases

    • Leah Epstein
    • Asaf Levin
    • Gerhard J. Woeginger

    OriginalPaper 30 May 2014 Pages: 1130 - 1171