1: Negative-Weight Single-Source Shortest Paths in Near-linear Time
2: Quantum Local Differential Privacy and Quantum Statistical Query Model
3: Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
4: Differential Privacy Amplification in Quantum and Quantum-inspired Algorithms
5: Unit Perturbations in Budgeted Spanning Tree Problems
6: A Push-Relabel Based Additive Approximation for Optimal Transport
7: Dimension reduction for maximum matchings and the Fastest Mixing Markov Chain
8: Semi-Random Sparse Recovery in Nearly-Linear Time
9: Robustly-reliable learners under poisoning attacks
10: Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains
11: Edge Intersection Graphs of Paths on a Triangular Grid
12: Oriented Diameter of Planar Triangulations
13: Leveraging Initial Hints for Free in Stochastic Linear Bandits
14: Metric Entropy Duality and the Sample Complexity of Outcome Indistinguishability
15: Neighborhood persistency of the linear optimization relaxation of integer linear optimization
16: Tailored vertex ordering for faster triangle listing in large graphs
17: Max Weight Independent Set in graphs with no long claws: An analog of the Gy'arf'as’ path argument
18: Correlated quantization for distributed mean estimation and optimization
19: Quantifying Grover speed-ups beyond asymptotic analysis
20: Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localization
21: Heterogeneous Sparse Matrix-Vector Multiplication via Compressed Sparse Row Format
22: A Tighter Approximation Guarantee for Greedy Minimum Entropy Coupling
23: Parameterized Algorithms for Upward Planarity
24: Algorithms for the Maximum Eulerian Cycle Decomposition Problem
25: Fully Adaptive Composition in Differential Privacy
26: Memory Compression with Quantum Random-Access Gates
27: A Linearithmic Time Locally Optimal Algorithm for the Multiway Number Partition Optimization
28: The spectrum of the Grigoriev-Laurent pseudomoments
29: Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees
30: Moser-Tardos Algorithm with small number of random bits
31: Fully-dynamic $\alpha + 2$ Arboricity Decomposition and Implicit Colouring
32: Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues
33: (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling
34: Distributed Subgraph Finding: Progress and Challenges
35: Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas
36: Local Hadwiger’s Conjecture
37: On the $d$-Claw Vertex Deletion Problem
38: The Role of Interactivity in Structured Estimation