1: Pandora’s Box Problem Over Time
2: Minimizing the Number of Roles in Bottom-Up Role-Mining using Maximal Biclique Enumeration
3: New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling
4: Efficient Retrieval with Learned Similarities
5: Twin-Width Meets Feedback Edges and Vertex Integrity
6: Online String Attractors
7: Scheduling on a Stochastic Number of Machines
8: Comparing Algorithms for Loading Classical Datasets into Quantum Memory
9: Robust Mixture Learning when Outliers Overwhelm Small Groups
10: Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment
11: Shortest Path Separators in Unit Disk Graphs
12: Color Refinement for Relational Structures
13: Trickle-Down in Localization Schemes and Applications
14: Efficient Detection of Commutative Factors in Factor Graphs
15: Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones
16: Hardness and Approximability of Dimension Reduction on the Probability Simplex
17: Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
18: Canadian Traveller Problems in Temporal Graphs
19: A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time
20: A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
21: Inference of rankings planted in random tournaments
22: Hardness of sampling solutions from the Symmetric Binary Perceptron
23: Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets
24: Simple Grid Polygon Online Exploration Revisited
25: Distance Reconstruction of Sparse Random Graphs
26: The Power of Graph Sparsification in the Continual Release Model
27: Improving Online Algorithms via ML Predictions
28: All-Pairs Suffix-Prefix on Dynamic Set of Strings
29: The Existential Theory of the Reals as a Complexity Class: A Compendium
30: $k$-Center Clustering in Distributed Models
31: Multi-View Structural Graph Summaries
32: Fast computation of the period and of the shortest cover of a string using its Character-Distance-Sampling representation
33: Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
34: A Model for Combinatorial Dictionary Learning and Inference
35: Reconstruction of geometric random graphs with the Simple algorithm
36: Rollercoasters with Plateaus
37: On Computing the Smallest Suffixient Set
38: On Approximating the Weighted Region Problem in Square Tessellations
39: Obstacle-Aware Length-Matching Routing for Any-Direction Traces in Printed Circuit Board
40: On the geometry of $k$-SAT solutions: what more can PPZ and Sch"oning’s algorithms do?