| 2123 | -- | 2157 | Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom. Mind the Gap! - Online Dictionary Matching with One Gap |
| 2158 | -- | 2195 | Tsuyoshi Ito, Stacey Jeffery. Approximate Span Programs |
| 2196 | -- | 2221 | Patrizio Angelini, Michael A. Bekos. Hierarchical Partial Planarity |
| 2222 | -- | 2243 | Zengfeng Huang, Ke Yi, Qin Zhang 0001. Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks |
| 2244 | -- | 2269 | Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren. Optimization with Demand Oracles |
| 2270 | -- | 2316 | Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi. Improved Parameterized Algorithms for Network Query Problems |
| 2317 | -- | 2345 | Cecilia Bohler, Rolf Klein, Chih-Hung Liu. An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams |
| 2346 | -- | 2376 | Haitao Wang 0001, Jingru Zhang. Covering Uncertain Points in a Tree |
| 2377 | -- | 2429 | Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy. A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs |
| 2430 | -- | 2483 | Danny Z. Chen, Haitao Wang 0001. 1 Shortest Paths Among Polygonal Obstacles in the Plane |
| 2484 | -- | 2526 | Patrizio Angelini, Giordano Da Lozzo. Clustered Planarity with Pipes |
| 2527 | -- | 2556 | Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani. Universal Slope Sets for 1-Bend Planar Drawings |
| 2557 | -- | 2591 | Ágnes Cseh, Jannik Matuschke. New and Simple Algorithms for Stable Flow Problems |
| 2592 | -- | 2605 | Samir Khuller, Sheng Yang. Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm |
| 2606 | -- | 2632 | Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan. On the Complexity Landscape of Connected f-Factor Problems |
| 2633 | -- | 2652 | Tomasz Kociumaka, Jakub Radoszewski, Tatiana A. Starikovskaya. Longest Common Substring with Approximately k Mismatches |