1. Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization

   • Fu-Hong Liu
   • Hsiang-Hsuan Liu
   • Prudence W. H. Wong

   OriginalPaper 18 June 2020 Pages: 3415 - 3457

   

2. Fault Tolerant Approximate BFS Structures with Additive Stretch

   • Merav Parter
   • David Peleg

   OriginalPaper 28 July 2020 Pages: 3458 - 3491

   

3. Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs

   • Gregor Matl
   • Stanislav Živný

   OriginalPaper 24 June 2020 Pages: 3492 - 3520

   

4. The Power of Linear-Time Data Reduction for Maximum Matching

   • George B. Mertzios
   • André Nichterlein
   • Rolf Niedermeier

   OriginalPaper Open access 06 July 2020 Pages: 3521 - 3565

   

5. Subgraph Isomorphism on Graph Classes that Exclude a Substructure

   • Hans L. Bodlaender
   • Tesshu Hanaka
   • Tom C. van der Zanden

   OriginalPaper 02 July 2020 Pages: 3566 - 3587

   

6. Enumerating k-Arc-Connected Orientations

   • Sarah Blind
   • Kolja Knauer
   • Petru Valicov

   OriginalPaper 03 August 2020 Pages: 3588 - 3603

   

7. On Scheduling Coflows

   • Saba Ahmadi
   • Samir Khuller
   • Sheng Yang

   OriginalPaper 15 July 2020 Pages: 3604 - 3629

   

8. An Adversarial Model for Scheduling with Testing

   • Christoph Dürr
   • Thomas Erlebach
   • Julie Meißner

   OriginalPaper 10 July 2020 Pages: 3630 - 3675

   

9. On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms

   • Dogan Corus
   • Pietro S. Oliveto

   OriginalPaper Open access 15 July 2020 Pages: 3676 - 3706

   

10. Dynamic and Internal Longest Common Substring

    • Amihood Amir
    • Panagiotis Charalampopoulos
    • Jakub Radoszewski

    OriginalPaper Open access 15 July 2020 Pages: 3707 - 3743