1: On Linearizability and the Termination of Randomized Algorithms
2: Group-Harmonic and Group-Closeness Maximization – Approximation and Engineering
3: Iteratively reweighted greedy set cover
4: A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
5: Recursive Random Contraction Revisited
6: Quantum advantage for differential equation analysis
7: Eccentricity queries and beyond using Hub Labels
8: Isometric embeddings in trees and their use in the diameter problem
9: A Local Search Framework for Experimental Design
10: Algorithmic pure states for the negative spherical perceptron
11: Around the diameter of AT-free graphs
12: Log(Graph): A Near-Optimal High-Performance Graph Representation
13: Active Sampling Count Sketch (ASCS) for Online Sparse Estimation of a Trillion Scale Covariance Matrix
14: To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations
15: Glauber dynamics for colourings of chordal graphs and graphs of bounded treewidth
16: Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry-Breaking Problems
17: Distance problems within Helly graphs and $k$-Helly graphs
18: A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems
19: Online Edge Coloring Algorithms via the Nibble Method
20: Monitoring the edges of a graph using distances
21: Estimating Sparse Discrete Distributions Under Local Privacy and Communication Constraints
22: Approximability results for the $p$-centdian and the converse centdian problems
23: The clustered selected-internal Steiner tree problem
24: Differentially Private ADMM Algorithms for Machine Learning
25: Generalized Sorting with Predictions