| 0 | -- | 0 | Nicola Prezza. Optimal Substring Equality Queries with Applications to Sparse Text Indexing |
| 0 | -- | 0 | Timothy M. Chan, R. Ryan Williams. Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky |
| 0 | -- | 0 | Anders Roy Christiansen, Mikko Berggren Ettienne, Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza. Optimal-Time Dictionary-Compressed Indexes |
| 0 | -- | 0 | Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi. r |
| 0 | -- | 0 | Antje Bjelde, Jan Hackfeld, Yann Disser, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Miriam Schlöter, Kevin Schewior, Leen Stougie. Tight Bounds for Online TSP on the Line |
| 0 | -- | 0 | Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001, Magnus Wahlström. Randomized Contractions Meet Lean Decompositions |
| 0 | -- | 0 | Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger. Fine-grained Complexity Analysis of Two Classic TSP Variants |
| 0 | -- | 0 | Sariel Har-Peled, Mitchell Jones. Journey to the Center of the Point Set |
| 0 | -- | 0 | Heng Guo 0001, Chao Liao, Pinyan Lu, Chihao Zhang 0001. Zeros of Holant Problems: Locations and Algorithms |
| 0 | -- | 0 | David G. Harris. Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma |