| 2923 | -- | 2961 | Anselm Haak, Arne Meier, Om Prakash 0002, B. V. Raghavendra Rao. Parameterised Counting in Logspace |
| 2962 | -- | 3002 | Júlio Araújo 0001, Julien Bensmail, Victor A. Campos, Frédéric Havet, Ana Karolinna Maia, Nicolas Nisse, Ana Silva 0001. On Finding the Best and Worst Orientations for the Metric Dimension |
| 3003 | -- | 3023 | Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri. A General Framework for Enumerating Equivalence Classes of Solutions |
| 3024 | -- | 3057 | Philip N. Klein, Claire Mathieu, Hang Zhou 0001. Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs |
| 3058 | -- | 3087 | Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum. A Polynomial Kernel for 3-Leaf Power Deletion |
| 3088 | -- | 3109 | Waldo Gálvez, Fabrizio Grandoni 0001, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan 0001, Malin Rau. A Tight (3/2+ε )-Approximation for Skewed Strip Packing |
| 3110 | -- | 3143 | Yoann Dieudonné, Andrzej Pelc, Franck Petit. Almost Universal Anonymous Rendezvous in the Plane |
| 3144 | -- | 3167 | Amit Deshpande 0001, Rameshwar Pratap. p Subspace Approximation and (k, p)-Clustering |
| 3168 | -- | 3213 | Harold N. Gabow. Blocking Trails for f-factors of Multigraphs |
| 3214 | -- | 3289 | Harold N. Gabow. A Weight-Scaling Algorithm for f-Factors of Multigraphs |
| 3290 | -- | 3322 | Felicia Lucke, Daniël Paulusma, Bernard Ries. Finding Matching Cuts in H-Free Graphs |
| 3323 | -- | 0 | Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya. Publisher Correction: Longest Common Substring with Approximately k Mismatches |