| 2395 | -- | 2413 | Kyle Fox, Xinyi Li. Approximating the Geometric Edit Distance |
| 2414 | -- | 2461 | Frank Kammer, Johannes Meintrup, Andrej Sajenko. Space-Efficient Vertex Separators for Treewidth |
| 2462 | -- | 2479 | Mirmahdi Rahgoshay, Mohammad R. Salavatipour. Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment |
| 2480 | -- | 2532 | Clemens Heuberger, Daniel Krenn, Gabriel F. Lipnik. Asymptotic Analysis of q-Recursive Sequences |
| 2533 | -- | 2555 | Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse. The Largest Connected Subgraph Game |
| 2556 | -- | 2580 | Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani. Universal Slope Sets for Upward Planar Drawings |
| 2581 | -- | 2596 | Yoshifumi Sakai, Shunsuke Inenaga. A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length |
| 2597 | -- | 2621 | Thomas Bosman, Martijn van Ee, Yang Jiao, Alberto Marchetti-Spaccamela, R. Ravi 0001, Leen Stougie. Approximation Algorithms for Replenishment Problems with Fixed Turnover Times |
| 2622 | -- | 2641 | Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh 0001. Fast Exact Algorithms for Survivable Network Design with Uniform Requirements |
| 2642 | -- | 2666 | Guozhen Rong, Yixin Cao 0001, Jian-xin Wang 0001, Zhifeng Wang. Graph Searches and Their End Vertices |
| 2667 | -- | 2701 | Karthekeyan Chandrasekaran, Weihang Wang 0002. p-Norm Multiway Cut |
| 2702 | -- | 2734 | Surender Baswana, Shiv Kumar Gupta, Till Knollmann. Mincut Sensitivity Data Structures for the Insertion of an Edge |
| 2735 | -- | 2766 | Dominik Köppl, Simon J. Puglisi, Rajeev Raman. Fast and Simple Compact Hashing via Bucketing |
| 2767 | -- | 2784 | Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo. Component Order Connectivity in Directed Graphs |