1. Mind the Gap!

   • Amihood Amir
   • Tsvi Kopelowitz
   • B. Riva Shalom

   OriginalPaper 13 November 2018 Pages: 2123 - 2157

   

2. Approximate Span Programs

   • Tsuyoshi Ito
   • Stacey Jeffery

   OriginalPaper 14 November 2018 Pages: 2158 - 2195

   

3. Hierarchical Partial Planarity

   • Patrizio Angelini
   • Michael A. Bekos

   OriginalPaper 29 November 2018 Pages: 2196 - 2221

   

4. Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks

   • Zengfeng Huang
   • Ke Yi
   • Qin Zhang

   OriginalPaper 11 December 2018 Pages: 2222 - 2243

   

5. Optimization with Demand Oracles

   • Ashwinkumar Badanidiyuru
   • Shahar Dobzinski
   • Sigal Oren

   OriginalPaper 11 December 2018 Pages: 2244 - 2269

6. Improved Parameterized Algorithms for Network Query Problems

   • Ron Y. Pinter
   • Hadas Shachnai
   • Meirav Zehavi

   OriginalPaper 18 December 2018 Pages: 2270 - 2316

   

7. An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams

   • Cecilia Bohler
   • Rolf Klein
   • Chih-Hung Liu

   OriginalPaper 18 December 2018 Pages: 2317 - 2345

   

8. Covering Uncertain Points in a Tree

   • Haitao Wang
   • Jingru Zhang

   OriginalPaper 22 January 2019 Pages: 2346 - 2376

   

9. A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs

   • Khaled Elbassioni
   • Kazuhisa Makino
   • Waleed Najy

   OriginalPaper 08 January 2019 Pages: 2377 - 2429

   

10. Computing \(L_1\) Shortest Paths Among Polygonal Obstacles in the Plane

    • Danny Z. Chen
    • Haitao Wang

    OriginalPaper 08 January 2019 Pages: 2430 - 2483

    

11. Clustered Planarity with Pipes

    • Patrizio Angelini
    • Giordano Da Lozzo

    OriginalPaper 30 January 2019 Pages: 2484 - 2526

    

12. Universal Slope Sets for 1-Bend Planar Drawings

    • Patrizio Angelini
    • Michael A. Bekos
    • Fabrizio Montecchiani

    OriginalPaper 08 January 2019 Pages: 2527 - 2556

    

13. New and Simple Algorithms for Stable Flow Problems

    • Ágnes Cseh
    • Jannik Matuschke

    OriginalPaper 08 January 2019 Pages: 2557 - 2591

    

14. Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm

    • Samir Khuller
    • Sheng Yang

    OriginalPaper 25 February 2019 Pages: 2592 - 2605

    

15. On the Complexity Landscape of Connected f-Factor Problems

    • R. Ganian
    • N. S. Narayanaswamy
    • M. S. Ramanujan

    OriginalPaper 30 January 2019 Pages: 2606 - 2632

    

16. Longest Common Substring with Approximately k Mismatches

    • Tomasz Kociumaka
    • Jakub Radoszewski
    • Tatiana Starikovskaya

    OriginalPaper Open access 16 February 2019 Pages: 2633 - 2652