1. Binary Search in Graphs Revisited

   • Argyrios Deligkas
   • George B. Mertzios
   • Paul G. Spirakis

   OriginalPaper Open access 22 August 2018 Pages: 1757 - 1780

   

2. Online Algorithms for Maximum Cardinality Matching with Edge Arrivals

   • Niv Buchbinder
   • Danny Segev
   • Yevgeny Tkach

   OriginalPaper 27 August 2018 Pages: 1781 - 1799

   

3. O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities

   • Mong-Jen Kao
   • Hai-Lun Tu
   • D. T. Lee

   OriginalPaper 22 August 2018 Pages: 1800 - 1817

   

4. Characterizing and Recognizing 4-Map Graphs

   • Franz J. Brandenburg

   OriginalPaper 27 August 2018 Pages: 1818 - 1843

   

5. Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph

   • Viresh Patel
   • Guus Regts

   OriginalPaper Open access 05 September 2018 Pages: 1844 - 1858

6. The k-Server Problem with Advice in d Dimensions and on the Sphere

   • Elisabet Burjons
   • Dennis Komm
   • Marcel Schöngens

   OriginalPaper 19 September 2018 Pages: 1859 - 1880

   

7. Edge-Orders

   • Lena Schlipf
   • Jens M. Schmidt

   OriginalPaper 24 September 2018 Pages: 1881 - 1900

   

8. Deterministic Leader Election Takes \(\Theta (D + \log n)\) Bit Rounds

   • A. Casteigts
   • Y. Métivier
   • A. Zemmari

   OriginalPaper 27 September 2018 Pages: 1901 - 1920

9. Building an Optimal Point-Location Structure in \(O( sort (n))\) I/Os

   • Xiaocheng Hu
   • Cheng Sheng
   • Yufei Tao

   OriginalPaper 28 September 2018 Pages: 1921 - 1937

   

10. Online Dominating Set

    • Joan Boyar
    • Stephan J. Eidenbenz
    • Kim S. Larsen

    OriginalPaper 25 September 2018 Pages: 1938 - 1964

    

11. Dynamic Graph Stream Algorithms in o(n) Space

    • Zengfeng Huang
    • Pan Peng

    OriginalPaper Open access 25 September 2018 Pages: 1965 - 1987

    

12. Streaming Pattern Matching with d Wildcards

    • Shay Golan
    • Tsvi Kopelowitz
    • Ely Porat

    OriginalPaper 13 October 2018 Pages: 1988 - 2015

    

13. When Can Graph Hyperbolicity be Computed in Linear Time?

    • Till Fluschnik
    • Christian Komusiewicz
    • Nimrod Talmon

    OriginalPaper 13 October 2018 Pages: 2016 - 2045

    

14. On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings

    • Michael A. Bekos
    • Henry Förster
    • Michael Kaufmann

    OriginalPaper 22 October 2018 Pages: 2046 - 2071

    

15. Succinct Summing over Sliding Windows

    • Ran Ben Basat
    • Gil Einziger
    • Yaron Kassner

    OriginalPaper 01 November 2018 Pages: 2072 - 2091

    

16. Computing Dense Tensor Decompositions with Optimal Dimension Trees

    • Oguz Kaya
    • Yves Robert

    OriginalPaper 22 October 2018 Pages: 2092 - 2121