1: Absent Subsequences in Words
2: The Approximation Ratio of the $k$-Opt Heuristic for the Euclidean Traveling Salesman Problem
3: Approximations for Allocating Indivisible Items with Concave-Additive Valuations
4: Optimization problems in graphs with locational uncertainty
5: Moving intervals for packing and covering
6: Properly learning decision trees in almost polynomial time
7: Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows
8: Multi-Queues Can Be State-of-the-Art Priority Schedulers
9: Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
10: Convergence properties of optimal transport-based temporal networks
11: Computing Graph Descriptors on Edge Streams
12: Quantum algorithm for structure learning of Markov Random Fields
13: Optimization and Sampling Under Continuous Symmetry: Examples and Lie Theory
14: Retraction: Improved Approximation Schemes for Dominating Set Problems in Unit Disk Graphs
15: Finding Colorful Paths in Temporal Graphs
16: Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems
17: Developing Mathematical Oracle Functions for Grover Quantum Search Algorithm
18: Symmetric Norm Estimation and Regression on Sliding Windows
19: RAMA: A Rapid Multicut Algorithm on GPU
20: Improving The Floyd-Warshall All Pairs Shortest Paths Algorithm
21: Fast Succinct Retrieval and Approximate Membership using Ribbon
22: Stretching Your Data With Taffy Filters
23: On the query complexity of connectivity with global queries
24: Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
25: Impatient PPSZ – a Faster algorithm for CSP
26: Simple Worst-Case Optimal Adaptive Prefix-Free Coding