1. New Online Algorithms for Story Scheduling in Web Advertising

   • Susanne Albers
   • Achim Passen

   OriginalPaper Open access 22 March 2018 Pages: 1 - 25

   

2. Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs

   • Neeldhara Misra
   • Fahad Panolan
   • Saket Saurabh

   OriginalPaper 05 April 2018 Pages: 26 - 46

   

3. On Almost Monge All Scores Matrices

   • Amir Carmel
   • Dekel Tsur
   • Michal Ziv-Ukelson

   OriginalPaper 27 March 2018 Pages: 47 - 68

   

4. Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation

   • Therese Biedl
   • Timothy M. Chan
   • Ziting Yu

   OriginalPaper 22 March 2018 Pages: 69 - 97

   

5. The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases

   • Julien Lesca
   • Michel Minoux
   • Patrice Perny

   OriginalPaper 30 March 2018 Pages: 98 - 123

   

6. Network Pollution Games

   • Eleftherios Anastasiadis
   • Xiaotie Deng
   • Jinshan Zhang

   OriginalPaper Open access 02 April 2018 Pages: 124 - 166

   

7. A Simple Projection Algorithm for Linear Programming Problems

   • Tomonari Kitahara
   • Noriyoshi Sukegawa

   OriginalPaper 03 April 2018 Pages: 167 - 178

   

8. Sparse Selfreducible Sets and Nonuniform Lower Bounds

   • Harry Buhrman
   • Leen Torenvliet
   • Nikolay Vereshchagin

   OriginalPaper 19 June 2018 Pages: 179 - 200

   

9. Parameterized Complexity of Asynchronous Border Minimization

   • Robert Ganian
   • Martin Kronegger
   • Alexandru Popa

   OriginalPaper 15 May 2018 Pages: 201 - 223

   

10. An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face

    • Cédric Bentz

    OriginalPaper 19 April 2018 Pages: 224 - 237

    

11. Impact of Knowledge on Election Time in Anonymous Networks

    • Yoann Dieudonné
    • Andrzej Pelc

    OriginalPaper 25 April 2018 Pages: 238 - 288

    

12. An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains

    • Joseph S. B. Mitchell
    • Valentin Polishchuk
    • Haitao Wang

    OriginalPaper 04 May 2018 Pages: 289 - 316

    

13. Linear Search by a Pair of Distinct-Speed Robots

    • Evangelos Bampas
    • Jurek Czyzowicz
    • Dominik Pająk

    OriginalPaper Open access 07 May 2018 Pages: 317 - 342

    

14. Minimum-Cost b-Edge Dominating Sets on Trees

    • Takehiro Ito
    • Naonori Kakimura
    • Yoshio Okamoto

    OriginalPaper 10 May 2018 Pages: 343 - 366

    

15. Structural Results on Matching Estimation with Applications to Streaming

    • Marc Bury
    • Elena Grigorescu
    • Samson Zhou

    OriginalPaper 14 May 2018 Pages: 367 - 392

    

16. Assortment Planning with Nested Preferences: Dynamic Programming with Distributions as States?

    • Danny Segev

    OriginalPaper 09 May 2018 Pages: 393 - 417

17. Correction to: Counting Minimum Weight Arborescences

    • Koyo Hayashi
    • Satoru Iwata

    Correction 04 October 2018 Pages: 418 - 418