A New Vertex Coloring Heuristic and Corresponding Chromatic Number Manouchehr Zaker OriginalPaper 21 February 2020 Pages: 2395 - 2414
An Efficient Sum Query Algorithm for Distance-Based Locally Dominating Functions Ziyun HuangJinhui Xu OriginalPaper 04 March 2020 Pages: 2415 - 2431
On the Tractability of Optimization Problems on H-Graphs Fedor V. FominPetr A. GolovachJean-Florent Raymond OriginalPaper Open access 11 March 2020 Pages: 2432 - 2473
The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures Refael HassinR. RaviDanny Segev OriginalPaper 11 March 2020 Pages: 2474 - 2501
An Efficient Exhaustive Search Algorithm for the Escherization Problem Yuichi NagataShinji Imahori OriginalPaper 23 March 2020 Pages: 2502 - 2534
A \(3+\varOmega (1)\) Lower Bound for Page Migration Akira Matsubayashi OriginalPaper 23 March 2020 Pages: 2535 - 2563
Queue Layouts of Planar 3-Trees Jawaherul Md. AlamMichael A. BekosSergey Pupyrev OriginalPaper Open access 23 March 2020 Pages: 2564 - 2585
Independent Set Reconfiguration Parameterized by Modular-Width Rémy BelmonteTesshu HanakaYota Otachi OriginalPaper 24 March 2020 Pages: 2586 - 2605
The Complexity of Tree Partitioning Zhao AnQilong FengGe Xia OriginalPaper 28 March 2020 Pages: 2606 - 2643
Parameterized Multi-Scenario Single-Machine Scheduling Problems Danny HermelinGeorge ManoussakisLiron Yedidsion OriginalPaper 28 March 2020 Pages: 2644 - 2667
On the Approximability of the Stable Matching Problem with Ties of Size Two Robert ChiangKanstantsin Pashkovich OriginalPaper 30 March 2020 Pages: 2668 - 2686
Compression of Dynamic Graphs Generated by a Duplication Model Krzysztof TurowskiAbram MagnerWojciech Szpankowski OriginalPaper Open access 03 April 2020 Pages: 2687 - 2707
