1. A New Vertex Coloring Heuristic and Corresponding Chromatic Number

   • Manouchehr Zaker

   OriginalPaper 21 February 2020 Pages: 2395 - 2414

   

2. An Efficient Sum Query Algorithm for Distance-Based Locally Dominating Functions

   • Ziyun Huang
   • Jinhui Xu

   OriginalPaper 04 March 2020 Pages: 2415 - 2431

   

3. On the Tractability of Optimization Problems on H-Graphs

   • Fedor V. Fomin
   • Petr A. Golovach
   • Jean-Florent Raymond

   OriginalPaper Open access 11 March 2020 Pages: 2432 - 2473

   

4. The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures

   • Refael Hassin
   • R. Ravi
   • Danny Segev

   OriginalPaper 11 March 2020 Pages: 2474 - 2501

5. An Efficient Exhaustive Search Algorithm for the Escherization Problem

   • Yuichi Nagata
   • Shinji Imahori

   OriginalPaper 23 March 2020 Pages: 2502 - 2534

   

6. A \(3+\varOmega (1)\) Lower Bound for Page Migration

   • Akira Matsubayashi

   OriginalPaper 23 March 2020 Pages: 2535 - 2563

   

7. Queue Layouts of Planar 3-Trees

   • Jawaherul Md. Alam
   • Michael A. Bekos
   • Sergey Pupyrev

   OriginalPaper Open access 23 March 2020 Pages: 2564 - 2585

   

8. Independent Set Reconfiguration Parameterized by Modular-Width

   • Rémy Belmonte
   • Tesshu Hanaka
   • Yota Otachi

   OriginalPaper 24 March 2020 Pages: 2586 - 2605

   

9. The Complexity of Tree Partitioning

   • Zhao An
   • Qilong Feng
   • Ge Xia

   OriginalPaper 28 March 2020 Pages: 2606 - 2643

   

10. Parameterized Multi-Scenario Single-Machine Scheduling Problems

    • Danny Hermelin
    • George Manoussakis
    • Liron Yedidsion

    OriginalPaper 28 March 2020 Pages: 2644 - 2667

11. On the Approximability of the Stable Matching Problem with Ties of Size Two

    • Robert Chiang
    • Kanstantsin Pashkovich

    OriginalPaper 30 March 2020 Pages: 2668 - 2686

    

12. Compression of Dynamic Graphs Generated by a Duplication Model

    • Krzysztof Turowski
    • Abram Magner
    • Wojciech Szpankowski

    OriginalPaper Open access 03 April 2020 Pages: 2687 - 2707