| 36 | -- | 0 | Tamal K. Dey, Tao Hou 0002, Dmitriy Morozov. A Fast Algorithm for Computing Zigzag Representatives |
| 37 | -- | 0 | Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono. A General Technique for Searching in Implicit Sets via Function Inversion |
| 38 | -- | 0 | Elena Grigorescu, Nithish Kumar, Young-San Lin. Approximation Algorithms for Directed Weighted Spanners |
| 39 | -- | 0 | Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis. Parameterized Complexities of Dominating and Independent Set Reconfiguration |
| 40 | -- | 0 | Ofek Gila, Michael T. Goodrich, Robert E. Tarjan. Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent |
| 41 | -- | 0 | Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek. Fast and Simple Sorting Using Partial Information |
| 42 | -- | 0 | Panagiotis Kanellopoulos, Alexandros A. Voudouris. Constrained Truthful Obnoxious Two-Facility Location with Optional Preferences |
| 43 | -- | 0 | Tomer Ezra, Stefano Leonardi 0001, Michal Pawlowski, Matteo Russo, Seeun William Umboh. Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment |
| 44 | -- | 0 | Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis, Hilde Verbeek 0001. Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast |
| 45 | -- | 0 | Haris Aziz 0001, Péter Biró 0001, Gergely Csáji, Ali Pourmiri. Ex-post Stability under Two-Sided Matching: Complexity and Characterization |
| 46 | -- | 0 | Marten Folkertsma, Ian Mertz, Florian Speelman, Quinten Tupker. Fully Characterizing Lossy Catalytic Computation |
| 47 | -- | 0 | Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma. Computing Pivot-Minors |