1. Local Computation Algorithms for Graphs of Non-constant Degrees

   • Reut Levi
   • Ronitt Rubinfeld
   • Anak Yodpinyanee

   OriginalPaper 02 February 2016 Pages: 971 - 994

   

2. Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games

   • Carlo Comin
   • Romeo Rizzi

   OriginalPaper 02 February 2016 Pages: 995 - 1021

   

3. Strip Planarity Testing for Embedded Planar Graphs

   • Patrizio Angelini
   • Giordano Da Lozzo
   • Fabrizio Frati

   OriginalPaper 08 February 2016 Pages: 1022 - 1059

   

4. An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths

   • Piotr Micek
   • Veit Wiechert

   OriginalPaper Open access 09 February 2016 Pages: 1060 - 1070

   

5. Extending Partial Representations of Proper and Unit Interval Graphs

   • Pavel Klavík
   • Jan Kratochvíl
   • Tomáš Vyskočil

   OriginalPaper 25 February 2016 Pages: 1071 - 1104

   

6. A Constant Factor Approximation Algorithm for the Storage Allocation Problem

   • Reuven Bar-Yehuda
   • Michael Beder
   • Dror Rawitz

   OriginalPaper 03 March 2016 Pages: 1105 - 1127

   

7. Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation

   • Yusuke Kobayashi
   • Sho Toyooka

   OriginalPaper 10 March 2016 Pages: 1128 - 1142

   

8. Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games

   • Ioannis Caragiannis
   • Angelo Fanelli
   • Nick Gravin

   OriginalPaper 10 March 2016 Pages: 1143 - 1158

   

9. A Generalization of Multiple Choice Balls-into-Bins: Tight Bounds

   • Gahyun Park

   OriginalPaper 17 March 2016 Pages: 1159 - 1193

   

10. Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet

    • Tomasz Kociumaka
    • Jakub Radoszewski
    • Wojciech Rytter

    OriginalPaper Open access 21 March 2016 Pages: 1194 - 1215

    

11. A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands

    • Rajesh Chitnis
    • Hossein Esfandiari
    • Saeed Seddighin

    OriginalPaper 29 March 2016 Pages: 1216 - 1239

    

12. Optimal Program-Size Complexity for Self-Assembled Squares at Temperature 1 in 3D

    • David Furcy
    • Samuel Micka
    • Scott M. Summers

    OriginalPaper 31 March 2016 Pages: 1240 - 1282

    

13. Finding Dominating Induced Matchings in \(P_8\)-Free Graphs in Polynomial Time

    • Andreas Brandstädt
    • Raffaele Mosca

    OriginalPaper 25 April 2016 Pages: 1283 - 1302