1. Fault-Tolerant Approximate Shortest-Path Trees

   • Davide Bilò
   • Luciano Gualà
   • Guido Proietti

   OriginalPaper 15 November 2017 Pages: 3437 - 3460

   

2. The Densest Subgraph Problem with a Convex/Concave Size Function

   • Yasushi Kawase
   • Atsushi Miyauchi

   OriginalPaper 20 December 2017 Pages: 3461 - 3480

   

3. A Polynomial Kernel for Trivially Perfect Editing

   • Pål Grønås Drange
   • Michał Pilipczuk

   OriginalPaper Open access 28 December 2017 Pages: 3481 - 3524

   

4. An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication

   • Carlo Comin
   • Romeo Rizzi

   OriginalPaper 02 January 2018 Pages: 3525 - 3562

   

5. Quantifying Competitiveness in Paging with Locality of Reference

   • Susanne Albers
   • Dario Frascaria

   OriginalPaper Open access 23 January 2018 Pages: 3563 - 3596

   

6. Parameterized Complexity of Length-bounded Cuts and Multicuts

   • Pavel Dvořák
   • Dušan Knop

   OriginalPaper 22 January 2018 Pages: 3597 - 3617

   

7. The Sandwich Problem for Decompositions and Almost Monotone Properties

   • Maria Chudnovsky
   • Celina M. H. de Figueiredo
   • Sophie Spirkl

   OriginalPaper 19 January 2018 Pages: 3618 - 3645

   

8. Canonical Representations for Circular-Arc Graphs Using Flip Sets

   • Maurice Chandoo

   OriginalPaper 23 January 2018 Pages: 3646 - 3672

   

9. Self-Stabilizing Balls and Bins in Batches

   • Petra Berenbrink
   • Tom Friedetzky
   • Chris Wastell

   OriginalPaper 15 February 2018 Pages: 3673 - 3703

   

10. Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications

    • Ali Dehghan
    • Mohammad-Reza Sadeghi
    • Arash Ahadi

    OriginalPaper 07 February 2018 Pages: 3704 - 3727

    

11. Dynamic Path Queries in Linear Space

    • Meng He
    • J. Ian Munro
    • Gelin Zhou

    OriginalPaper 02 February 2018 Pages: 3728 - 3765

    

12. Path Refinement in Weighted Regions

    • Amin Gheibi
    • Anil Maheshwari
    • Christian Scheffer

    OriginalPaper 16 February 2018 Pages: 3766 - 3802

    

13. Quasimetric Embeddings and Their Applications

    • Facundo Mémoli
    • Anastasios Sidiropoulos
    • Vijay Sridhar

    OriginalPaper 13 February 2018 Pages: 3803 - 3824

    

14. Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints

    • Imed Kacem
    • Hans Kellerer

    OriginalPaper Open access 20 February 2018 Pages: 3825 - 3843

    

15. \((k,n-k)\)-Max-Cut: An \(\mathcal{O}^*(2^p)\)-Time Algorithm and a Polynomial Kernel

    • Saket Saurabh
    • Meirav Zehavi

    OriginalPaper 20 February 2018 Pages: 3844 - 3860

    

16. Online Packet Scheduling for CIOQ and Buffered Crossbar Switches

    • Kamal Al-Bawani
    • Matthias Englert
    • Matthias Westermann

    OriginalPaper 05 March 2018 Pages: 3861 - 3888

    

17. Fast Approximation Algorithms for p-Centers in Large \(\delta \)-Hyperbolic Graphs

    • Katherine Edwards
    • W. Sean Kennedy
    • Iraj Saniee

    OriginalPaper 20 March 2018 Pages: 3889 - 3907

    

18. Counting Minimum Weight Arborescences

    • Koyo Hayashi
    • Satoru Iwata

    OriginalPaper 22 March 2018 Pages: 3908 - 3919

    

19. Lift-and-Project Methods for Set Cover and Knapsack

    • Eden Chlamtáč
    • Zachary Friggstad
    • Konstantinos Georgiou

    OriginalPaper 28 March 2018 Pages: 3920 - 3942

    

20. Extreme Witnesses and Their Applications

    • Andrzej Lingas
    • Mia Persson

    OriginalPaper Open access 06 August 2018 Pages: 3943 - 3957

    

21. Editor’s Note

    News 27 August 2018 Pages: 3958 - 3958

22. The Fast Search Number of a Complete k-Partite Graph

    • Yuan Xue
    • Boting Yang
    • Sandra Zilles

    OriginalPaper 21 May 2018 Pages: 3959 - 3981