| 1 | -- | 12 | Eunpyeong Hung, Mong-Jen Kao. Approximation Algorithm for Vertex Cover with Multiple Covering Constraints |
| 13 | -- | 36 | Sayan Bandyapadhyay. On Perturbation Resilience of Non-uniform k-Center |
| 37 | -- | 59 | Davide Bilò, Luciano Gualà, Stefano Leucci 0001, Guido Proietti. Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees |
| 60 | -- | 84 | Stefano Leucci 0001, Chih-Hung Liu 0001. Approximate Minimum Selection with Unreliable Comparisons |
| 85 | -- | 123 | Stéphane Devismes, David Ilcinkas, Colette Johnen. Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions |
| 124 | -- | 149 | Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane. Approximating Dynamic Weighted Vertex Cover with Soft Capacities |
| 150 | -- | 175 | Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari. Bounded-Angle Minimum Spanning Trees |
| 176 | -- | 196 | Guido Brückner, Nadine Davina Krisam, Tamara Mchedlidze. Level-Planar Drawings with Few Slopes |
| 197 | -- | 215 | Yixin Cao 0001, Ashutosh Rai 0001, R. B. Sandeep, Junjie Ye. A Polynomial Kernel for Diamond-Free Editing |
| 216 | -- | 233 | Thom Castermans, Bettina Speckmann, Frank Staals, Kevin Verbeek. Agglomerative Clustering of Growing Squares |
| 234 | -- | 271 | Ioannis Caragiannis, Panagiotis Kanellopoulos, Alexandros A. Voudouris. Bounding the Inefficiency of Compromise in Opinion Formation |