| 0 | -- | 0 | Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald. On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? |
| 0 | -- | 0 | Aditya Jayaprakash, Mohammad R. Salavatipour. Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension |
| 0 | -- | 0 | Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi. Robust Algorithms for TSP and Steiner Tree |
| 0 | -- | 0 | Balázs F. Mezei, Marcin Wrochna, Stanislav Zivný. PTAS for Sparse General-valued CSPs |
| 0 | -- | 0 | Claire Mathieu, Hang Zhou 0001. A PTAS for Capacitated Vehicle Routing on Trees |
| 0 | -- | 0 | Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi. Universal Algorithms for Clustering Problems |
| 0 | -- | 0 | Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak. Approximating Pathwidth for Graphs of Small Treewidth |
| 0 | -- | 0 | Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi. Polynomial Kernel for Interval Vertex Deletion |
| 0 | -- | 0 | Antonios Antoniadis 0001, Christian Coester, Marek Eliás 0001, Adam Polak 0001, Bertrand Simon. Online Metric Algorithms with Untrusted Predictions |
| 0 | -- | 0 | Kyle Fox, Debmalya Panigrahi, Fred Zhang. k-Cut in Hypergraphs via Branching Contractions |