1. Computing and Combinatorics

   • Zhipeng Cai
   • Alexander Zelikovsky

   EditorialNotes 11 July 2016 Pages: 865 - 866

2. Approximating Maximum Agreement Forest on Multiple Binary Trees

   • Jianer Chen
   • Feng Shi
   • Jianxin Wang

   OriginalPaper 02 November 2015 Pages: 867 - 889

   

3. Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation

   • Meena Mahajan
   • B. V. Raghavendra Rao
   • Karteek Sreenivasaiah

   OriginalPaper 24 December 2015 Pages: 890 - 909

   

4. Diffuse Reflection Radius in a Simple Polygon

   • Eli Fox-Epstein
   • Csaba D. Tóth
   • Andrew Winslow

   OriginalPaper 17 July 2015 Pages: 910 - 931

   

5. Preface-S.I.: LATIN 2014

   • Alfredo Viola

   EditorialNotes 14 July 2016 Pages: 932 - 934

6. A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters

   • Panagiotis Cheilaris
   • Elena Khramtcova
   • Evanthia Papadopoulou

   OriginalPaper 28 January 2016 Pages: 935 - 960

   

7. Conjugacy in Baumslag’s Group, Generic Case Complexity, and Division in Power Circuits

   • Volker Diekert
   • Alexei G. Myasnikov
   • Armin Weiß

   OriginalPaper 19 January 2016 Pages: 961 - 988

   

8. Counting and Generating Permutations in Regular Classes

   • Nicolas Basset

   OriginalPaper 11 March 2016 Pages: 989 - 1034

   

9. 2-Xor Revisited: Satisfiability and Probabilities of Functions

   • Élie de Panafieu
   • Danièle Gardy
   • Markus Kuba

   OriginalPaper 11 February 2016 Pages: 1035 - 1076

   

10. Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds

    • Nikhil Bansal
    • Tim Oosterwijk
    • Ruben van der Zwaan

    OriginalPaper Open access 19 January 2016 Pages: 1077 - 1096

    

11. Biased Predecessor Search

    • Prosenjit Bose
    • Rolf Fagerberg
    • Pat Morin

    OriginalPaper 28 March 2016 Pages: 1097 - 1105

12. Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability

    • Antoine Genitrini
    • Cécile Mailler

    OriginalPaper 12 January 2016 Pages: 1106 - 1138

    

13. A Randomized \(\mathrm {O}(\log n)\)-Competitive Algorithm for the Online Connected Facility Location Problem

    • Mário César San Felice
    • David P. Williamson
    • Orlando Lee

    OriginalPaper 20 January 2016 Pages: 1139 - 1157

    

14. Guest Editor’s Foreword

    • Hee-Kap Ahn
    • Chan-Su Shin

    EditorialNotes 17 October 2016 Pages: 1158 - 1159

15. Dynamic Algorithms for Multimachine Interval Scheduling Through Analysis of Idle Intervals

    • Alex Gavryushkin
    • Bakhadyr Khoussainov
    • Jiamou Liu

    OriginalPaper 27 April 2016 Pages: 1160 - 1180

    

16. On the Computational Complexity of Vertex Integrity and Component Order Connectivity

    • Pål Grønås Drange
    • Markus Dregi
    • Pim van ’t Hof

    OriginalPaper 04 February 2016 Pages: 1181 - 1202

    

17. A Short Implicant of a CNF Formula with Many Satisfying Assignments

    • Daniel Kane
    • Osamu Watanabe

    OriginalPaper 01 February 2016 Pages: 1203 - 1223

    

18. Faster Algorithms for Computing the R* Consensus Tree

    • Jesper Jansson
    • Wing-Kin Sung
    • Siu-Ming Yiu

    OriginalPaper 27 January 2016 Pages: 1224 - 1244

    

19. An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution

    • Ei Ando
    • Shuji Kijima

    OriginalPaper 18 November 2015 Pages: 1245 - 1263

    

20. The Power and Limitations of Static Binary Search Trees with Lazy Finger

    • Prosenjit Bose
    • Karim Douïeb
    • Stefan Langerman

    OriginalPaper 06 October 2016 Pages: 1264 - 1275