1: Online Sorting and Translational Packing of Convex Polygons
2: Lattice-Based Methods Surpass Sum-of-Squares in Clustering
3: fastball: A fast algorithm to sample bipartite graphs with fixed degree sequences
4: Blocking Trails for $f$-factors of Multigraphs
5: Equity Promotion in Online Resource Allocation
6: Online Elicitation of Necessarily Optimal Matchings
7: Faster Algorithms for $k$-Subset Sum and Variations
8: RLBWT Tricks
9: A PTAS for the Min-Max Euclidean Multiple TSP
10: A Simple Algorithm for Graph Reconstruction
11: Greedy Algorithm for Multiway Matching with Bounded Regret
12: Efficient Checking of Temporal Compliance Rules Over Business Process Event Logs
13: Testing Probabilistic Circuits
14: Improved approximation algorithms for two Euclidean k-Center variants
15: Estimating the Longest Increasing Subsequence in Nearly Optimal Time
16: Online minimum matching with uniform metric and random arrivals
17: Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study
18: Stochastic Vertex Cover with Few Queries
19: Robustification of Online Graph Exploration Methods
20: Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem
21: Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for Non-Spherical Gaussian Mixtures
22: Beyond the Longest Letter-duplicated Subsequence Problem
23: Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets
24: Improved Deterministic $(\Delta+1)$-Coloring in Low-Space MPC
25: How Compression and Approximation Affect Efficiency in String Distance Measures
26: Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding
27: The Price of Justified Representation
28: Flow Metrics on Graphs
29: A tight bound for the clique query problem in two rounds
30: Fast computation of distance-generalized cores using sampling
31: Maintaining AUC and $H$-measure over time
32: Temporal Interval Cliques and Independent Sets
33: Parallel Batch-Dynamic $k$d-Trees
34: Approximation algorithms for confidence bands for time series
35: Approximating TSP walks in subcubic graphs
36: Algorithmic Bayesian persuasion with combinatorial actions
37: On sketching approximations for symmetric Boolean CSPs
38: A quick estimate for the volume of a polyhedron
39: Faster-Than-Native Alternatives for x86 VP2INTERSECT Instructions
40: Scheduling Servers with Stochastic Bilinear Rewards
41: Robust Voting Rules from Algorithmic Robust Statistics
42: How to Find a Good Explanation for Clustering?
43: ViQUF: de novo Viral Quasispecies reconstruction using Unitig-based Flow networks
44: Locally Fair Partitioning
45: Factorization and pseudofactorization of weighted graphs
46: Optimizing over an ensemble of neural networks
47: On Approximate Sequencing Policies for Linear Storage Devices
48: Clustering with fair-center representation: parameterized approximation algorithms and heuristics
49: Optimal Fully Dynamic $k$-Centers Clustering
50: Swarm consensus
51: Secretary Matching With Vertex Arrivals and No Rejections
52: Novel Algorithms for Efficient Mining of Connected Induced Subgraphs of a Given Cardinality
53: Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality
54: On fully dynamic constant-factor approximation algorithms for clustering problems
55: Online Matching with High Probability