| 1467 | -- | 1489 | Mohammad Ali Abam, Mark de Berg, Sina Farahzad, Mir Omid Haji Mirsadeghi, Morteza Saghafian. Preclustering Algorithms for Imprecise Points |
| 1490 | -- | 1510 | Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol. Multidimensional Period Recovery |
| 1511 | -- | 1525 | Zeev Nutov. Approximating k-Connected m-Dominating Sets |
| 1526 | -- | 1547 | Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná 0001, Aneta Pokorná. 5)-Free Graphs |
| 1548 | -- | 1570 | Pratibha Choudhary. Polynomial Time Algorithms for Tracking Path Problems |
| 1571 | -- | 1572 | Johannes Lengler, Frank Neumann 0001. Editorial |
| 1573 | -- | 1602 | Denis Antipov, Benjamin Doerr, Vitalii Karavaev. A Rigorous Runtime Analysis of the (1 + (λ , λ )) GA on Jump Functions |
| 1603 | -- | 1658 | Pietro S. Oliveto, Dirk Sudholt, Carsten Witt. Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm |
| 1659 | -- | 1693 | Benjamin Doerr. Does Comma Selection Help to Cope with Local Optima? |
| 1694 | -- | 1723 | Amirhossein Rajabi, Carsten Witt. Self-Adjusting Evolutionary Algorithms for Multimodal Optimization |
| 1724 | -- | 1761 | Denis Antipov, Maxim Buzdalov 0001, Benjamin Doerr. Fast Mutation in Crossover-Based Algorithms |
| 1762 | -- | 1793 | Maxim Buzdalov 0001, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov. Fixed-Target Runtime Analysis |