1: Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work
2: Travelling salesman paths on Demidenko matrices
3: Approximating Nash Social Welfare under Rado Valuations
4: On Approximability of Clustering Problems Without Candidate Centers
5: Optimal Task Assignment to Heterogeneous Federated Learning Devices
6: Efficient Time and Space Representation of Uncertain Event Data
7: Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs
8: From Trees to Continuous Embeddings and Back: Hyperbolic Hierarchical Clustering
9: Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging
10: The Sparse Vector Technique, Revisited
11: Splay trees on trees
12: Decremental APSP in Directed Graphs Versus an Adaptive Adversary
13: Efficient Estimation of Graph Trussness
14: Tight Approximation Guarantees for Concave Coverage Problems
15: A Weight-scaling Algorithm for $f$-factors of Multigraphs
16: Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure
17: Neighborhood Matters: Influence Maximization in Social Networks with Limited Access
18: Improved Submodular Secretary Problem with Shortlists
19: Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier
20: Burning Geometric Graphs
21: Privately Answering Counting Queries with Generalized Gaussian Mechanisms
22: Inapproximability for Local Correlation Clustering and Dissimilarity Hierarchical Clustering
23: Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers
24: A Fully Polynomial Time Approximation Scheme for the Replenishment Storage Problem
25: A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise
26: No quantum speedup over gradient descent for non-smooth convex optimization
27: Generalized Cuckoo Hashing with a Stash, Revisited
28: Fast DecreaseKey Heaps with worst-case variants
29: Optimal bounds for approximate counting
30: Subspace Embeddings Under Nonlinear Transformations
31: A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs
32: How to send a real number using a single bit (and some shared randomness)
33: A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem
34: A Note on Exponential-Time Algorithms for Linearwidth
35: The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem
36: A faster algorithm for finding Tarski fixed points
37: InstaHide: Instance-hiding Schemes for Private Distributed Learning
38: Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
39: Learning a mixture of two subspaces over finite fields
40: On Additive Approximate Submodularity
41: Dynamic Query Evaluation Over Structures with Low Degree
42: GRETA: Graph-based Real-time Event Trend Aggregation
43: An Improvement of Reed’s Treewidth Approximation
44: Structured Logconcave Sampling with a Restricted Gaussian Oracle
45: New Verification Schemes for Frequency-Based Functions on Data Streams
46: Recognizing (Unit) Interval Graphs by Zigzag Graph Searches
47: Fairness in Influence Maximization through Randomization