1. Preclustering Algorithms for Imprecise Points

   • Mohammad Ali Abam
   • Mark de Berg
   • Morteza Saghafian

   OriginalPaper 09 February 2022 Pages: 1467 - 1489

   

2. Multidimensional Period Recovery

   • Amihood Amir
   • Ayelet Butman
   • Dina Sokol

   OriginalPaper 14 February 2022 Pages: 1490 - 1510

   

3. Approximating k-Connected m-Dominating Sets

   • Zeev Nutov

   OriginalPaper 16 February 2022 Pages: 1511 - 1525

   

4. On 3-Coloring of (\(2P_4,C_5\))-Free Graphs

   • Vít Jelínek
   • Tereza Klimošová
   • Aneta Pokorná

   OriginalPaper Open access 15 February 2022 Pages: 1526 - 1547

   

5. Polynomial Time Algorithms for Tracking Path Problems

   • Pratibha Choudhary

   OriginalPaper Open access 08 February 2022 Pages: 1548 - 1570

   

6. Editorial

   • Johannes Lengler
   • Frank Neumann

   Editorial 11 May 2022 Pages: 1571 - 1572

7. A Rigorous Runtime Analysis of the \((1 + (\lambda , \lambda ))\) GA on Jump Functions

   • Denis Antipov
   • Benjamin Doerr
   • Vitalii Karavaev

   OriginalPaper 15 January 2022 Pages: 1573 - 1602

   

8. Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm

   • Pietro S. Oliveto
   • Dirk Sudholt
   • Carsten Witt

   OriginalPaper Open access 23 December 2021 Pages: 1603 - 1658

   

9. Does Comma Selection Help to Cope with Local Optima?

   • Benjamin Doerr

   OriginalPaper 10 January 2022 Pages: 1659 - 1693

   

10. Self-Adjusting Evolutionary Algorithms for Multimodal Optimization

    • Amirhossein Rajabi
    • Carsten Witt

    OriginalPaper 16 February 2022 Pages: 1694 - 1723

    

11. Fast Mutation in Crossover-Based Algorithms

    • Denis Antipov
    • Maxim Buzdalov
    • Benjamin Doerr

    OriginalPaper 25 March 2022 Pages: 1724 - 1761

    

12. Fixed-Target Runtime Analysis

    • Maxim Buzdalov
    • Benjamin Doerr
    • Dmitry Vinokurov

    OriginalPaper 03 November 2021 Pages: 1762 - 1793