Parameterized Dynamic Cluster Editing Junjie LuoHendrik MolterRolf Niedermeier OriginalPaper Open access 25 July 2020 Pages: 1 - 44
Iterative Partial Rounding for Vertex Cover with Hard Capacities Mong-Jen Kao OriginalPaper 03 August 2020 Pages: 45 - 71
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions Céline ChevalierFabien LaguillaumieDamien Vergnaud OriginalPaper 30 July 2020 Pages: 72 - 115
Flip Distances Between Graph Orientations Oswin AichholzerJean CardinalBirgit Vogtenhuber OriginalPaper Open access 27 July 2020 Pages: 116 - 143
Building a Nest by an Automaton Jurek CzyzowiczDariusz DereniowskiAndrzej Pelc OriginalPaper Open access 25 July 2020 Pages: 144 - 176
Learning Privately with Labeled and Unlabeled Examples Amos BeimelKobbi NissimUri Stemmer OriginalPaper 03 August 2020 Pages: 177 - 215
List 3-Coloring Graphs with No Induced \(P_6+rP_3\) Maria ChudnovskyShenwei HuangMingxian Zhong OriginalPaper 30 July 2020 Pages: 216 - 251
Distance and Routing Labeling Schemes for Cube-Free Median Graphs Victor ChepoiArnaud LabourelSébastien Ratel OriginalPaper 14 September 2020 Pages: 252 - 296
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem Robert GanianFabian KluteSebastian Ordyniak OriginalPaper Open access 19 August 2020 Pages: 297 - 336
Tight Bounds for Online Coloring of Basic Graph Classes Susanne AlbersSebastian Schraink OriginalPaper Open access 25 August 2020 Pages: 337 - 360
Polynomial Treedepth Bounds in Linear Colorings Jeremy KunMichael P. O’BrienBlair D. Sullivan OriginalPaper Open access 03 September 2020 Pages: 361 - 386
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata Sándor P. FeketeRobert GmyrArne Schmidt OriginalPaper Open access 04 September 2020 Pages: 387 - 412