Approximation Algorithm for Vertex Cover with Multiple Covering Constraints Eunpyeong HungMong-Jen Kao OriginalPaper 28 October 2021 Pages: 1 - 12
On Perturbation Resilience of Non-uniform k-Center Sayan Bandyapadhyay OriginalPaper Open access 28 October 2021 Pages: 13 - 36
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees Davide BilòLuciano GualàGuido Proietti OriginalPaper 30 October 2021 Pages: 37 - 59
Approximate Minimum Selection with Unreliable Comparisons Stefano LeucciChih-Hung Liu OriginalPaper Open access 01 November 2021 Pages: 60 - 84
Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions Stéphane DevismesDavid IlcinkasColette Johnen OriginalPaper 05 November 2021 Pages: 85 - 123
Approximating Dynamic Weighted Vertex Cover with Soft Capacities Hao-Ting WeiWing-Kai HonKunihiko Sadakane OriginalPaper 16 November 2021 Pages: 124 - 149
Bounded-Angle Minimum Spanning Trees Ahmad BiniazProsenjit BoseAnil Maheshwari OriginalPaper 17 November 2021 Pages: 150 - 175
Level-Planar Drawings with Few Slopes Guido BrücknerNadine KrisamTamara Mchedlidze OriginalPaper Open access 19 November 2021 Pages: 176 - 196
A Polynomial Kernel for Diamond-Free Editing Yixin CaoAshutosh RaiJunjie Ye OriginalPaper 20 November 2021 Pages: 197 - 215
Agglomerative Clustering of Growing Squares Thom CastermansBettina SpeckmannKevin Verbeek OriginalPaper Open access 20 November 2021 Pages: 216 - 233
Bounding the Inefficiency of Compromise in Opinion Formation Ioannis CaragiannisPanagiotis KanellopoulosAlexandros A. Voudouris OriginalPaper Open access 24 November 2021 Pages: 234 - 271