Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization Fu-Hong LiuHsiang-Hsuan LiuPrudence W. H. Wong OriginalPaper 18 June 2020 Pages: 3415 - 3457
Fault Tolerant Approximate BFS Structures with Additive Stretch Merav ParterDavid Peleg OriginalPaper 28 July 2020 Pages: 3458 - 3491
Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs Gregor MatlStanislav Živný OriginalPaper 24 June 2020 Pages: 3492 - 3520
The Power of Linear-Time Data Reduction for Maximum Matching George B. MertziosAndré NichterleinRolf Niedermeier OriginalPaper Open access 06 July 2020 Pages: 3521 - 3565
Subgraph Isomorphism on Graph Classes that Exclude a Substructure Hans L. BodlaenderTesshu HanakaTom C. van der Zanden OriginalPaper 02 July 2020 Pages: 3566 - 3587
Enumerating k-Arc-Connected Orientations Sarah BlindKolja KnauerPetru Valicov OriginalPaper 03 August 2020 Pages: 3588 - 3603
On Scheduling Coflows Saba AhmadiSamir KhullerSheng Yang OriginalPaper 15 July 2020 Pages: 3604 - 3629
An Adversarial Model for Scheduling with Testing Christoph DürrThomas ErlebachJulie Meißner OriginalPaper 10 July 2020 Pages: 3630 - 3675
On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms Dogan CorusPietro S. Oliveto OriginalPaper Open access 15 July 2020 Pages: 3676 - 3706
Dynamic and Internal Longest Common Substring Amihood AmirPanagiotis CharalampopoulosJakub Radoszewski OriginalPaper Open access 15 July 2020 Pages: 3707 - 3743