1. Approximation Algorithm for Vertex Cover with Multiple Covering Constraints

   • Eunpyeong Hung
   • Mong-Jen Kao

   OriginalPaper 28 October 2021 Pages: 1 - 12

   

2. On Perturbation Resilience of Non-uniform k-Center

   • Sayan Bandyapadhyay

   OriginalPaper Open access 28 October 2021 Pages: 13 - 36

   

3. Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees

   • Davide Bilò
   • Luciano Gualà
   • Guido Proietti

   OriginalPaper 30 October 2021 Pages: 37 - 59

   

4. Approximate Minimum Selection with Unreliable Comparisons

   • Stefano Leucci
   • Chih-Hung Liu

   OriginalPaper Open access 01 November 2021 Pages: 60 - 84

   

5. Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions

   • Stéphane Devismes
   • David Ilcinkas
   • Colette Johnen

   OriginalPaper 05 November 2021 Pages: 85 - 123

   

6. Approximating Dynamic Weighted Vertex Cover with Soft Capacities

   • Hao-Ting Wei
   • Wing-Kai Hon
   • Kunihiko Sadakane

   OriginalPaper 16 November 2021 Pages: 124 - 149

   

7. Bounded-Angle Minimum Spanning Trees

   • Ahmad Biniaz
   • Prosenjit Bose
   • Anil Maheshwari

   OriginalPaper 17 November 2021 Pages: 150 - 175

   

8. Level-Planar Drawings with Few Slopes

   • Guido Brückner
   • Nadine Krisam
   • Tamara Mchedlidze

   OriginalPaper Open access 19 November 2021 Pages: 176 - 196

   

9. A Polynomial Kernel for Diamond-Free Editing

   • Yixin Cao
   • Ashutosh Rai
   • Junjie Ye

   OriginalPaper 20 November 2021 Pages: 197 - 215

   

10. Agglomerative Clustering of Growing Squares

    • Thom Castermans
    • Bettina Speckmann
    • Kevin Verbeek

    OriginalPaper Open access 20 November 2021 Pages: 216 - 233

    

11. Bounding the Inefficiency of Compromise in Opinion Formation

    • Ioannis Caragiannis
    • Panagiotis Kanellopoulos
    • Alexandros A. Voudouris

    OriginalPaper Open access 24 November 2021 Pages: 234 - 271