| 3437 | -- | 3460 | Davide Bilò, Luciano Gualà, Stefano Leucci 0001, Guido Proietti. Fault-Tolerant Approximate Shortest-Path Trees |
| 3461 | -- | 3480 | Yasushi Kawase, Atsushi Miyauchi. The Densest Subgraph Problem with a Convex/Concave Size Function |
| 3481 | -- | 3524 | Pål Grønås Drange, Michal Pilipczuk. A Polynomial Kernel for Trivially Perfect Editing |
| 3525 | -- | 3562 | Carlo Comin, Romeo Rizzi. An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication |
| 3563 | -- | 3596 | Susanne Albers, Dario Frascaria. Quantifying Competitiveness in Paging with Locality of Reference |
| 3597 | -- | 3617 | Pavel Dvorák, Dusan Knop. Parameterized Complexity of Length-bounded Cuts and Multicuts |
| 3618 | -- | 3645 | Maria Chudnovsky, Celina M. H. de Figueiredo, Sophie Spirkl. The Sandwich Problem for Decompositions and Almost Monotone Properties |
| 3646 | -- | 3672 | Maurice Chandoo. Canonical Representations for Circular-Arc Graphs Using Flip Sets |
| 3673 | -- | 3703 | Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel 0001, Chris Wastell. Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins |
| 3704 | -- | 3727 | Ali Dehghan 0001, Mohammad-Reza (Rafsanjani) Sadeghi, Arash Ahadi. Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications |
| 3728 | -- | 3765 | Meng He 0001, J. Ian Munro, Gelin Zhou. Dynamic Path Queries in Linear Space |
| 3766 | -- | 3802 | Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer. Path Refinement in Weighted Regions |
| 3803 | -- | 3824 | Facundo Mémoli, Anastasios Sidiropoulos, Vijay Sridhar. Quasimetric Embeddings and Their Applications |
| 3825 | -- | 3843 | Imed Kacem, Hans Kellerer. Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints |
| 3844 | -- | 3860 | Saket Saurabh 0001, Meirav Zehavi. $$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel |
| 3861 | -- | 3888 | Kamal Al-Bawani, Matthias Englert, Matthias Westermann. Online Packet Scheduling for CIOQ and Buffered Crossbar Switches |
| 3889 | -- | 3907 | Katherine Edwards, W. Sean Kennedy, Iraj Saniee. Fast Approximation Algorithms for p-Centers in Large $$\delta $$ δ -Hyperbolic Graphs |
| 3908 | -- | 3919 | Koyo Hayashi, Satoru Iwata 0001. Counting Minimum Weight Arborescences |
| 3920 | -- | 3942 | Eden Chlamtác, Zachary Friggstad, Konstantinos Georgiou. Lift-and-Project Methods for Set Cover and Knapsack |
| 3943 | -- | 3957 | Andrzej Lingas, Mia Persson. Extreme Witnesses and Their Applications |
| 3958 | -- | 0 | . Editor's Note |
| 3959 | -- | 3981 | Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles. The Fast Search Number of a Complete k-Partite Graph |