1: Minor Sparsifiers and the Distributed Laplacian Paradigm
2: A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs – via half-edges
3: A Tale of Two Efficient and Informative Negative Sampling Distributions
4: The Query Complexity of Local Search and Brouwer in Rounds
5: Climbing LP Algorithms
6: Chunk List: Concurrent Data Structures
7: Simulating Quantum Computations with Tutte Polynomials
8: SetSketch: Filling the Gap between MinHash and HyperLogLog
9: Approximating Maximum Independent Set for Rectangles in the Plane
10: A pessimist’s approach to one-sided matching
11: Solving Cut-Problems in Quadratic Time for Graphs With Bounded Treewidth
12: Synchronization Strings and Codes for Insertions and Deletions – a Survey
13: Text Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations
14: Wasserstein barycenters are NP-hard to compute
15: Binary Dynamic Time Warping in Linear Time
16: Gauss-Legendre Features for Gaussian Process Regression
17: Clan Embeddings into Trees, and Low Treewidth Graphs
18: SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation
19: Split block Bloom filters
20: On the price of explainability for some clustering problems
21: On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions
22: Online Multivalid Learning: Means, Moments, and Prediction Intervals
23: Fine-Grained Complexity of Regular Path Queries
24: Algorithms and Hardness for Multidimensional Range Updates and Queries
25: On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks
26: The Shapley Value of Classifiers in Ensemble Games
27: A Deterministic Parallel APSP Algorithm and its Applications
28: 4 vs 7 sparse undirected unweighted Diameter is SETH-hard at time $n^{4/3}$
29: Planar Reachability Under Single Vertex or Edge Failures