1: An Introduction to Johnson-Lindenstrauss Transforms
2: Lower Bounds and Improved Algorithms for Asymmetric Streaming Edit Distance and Longest Common Subsequence
3: k-apices of minor-closed graph classes. I. Bounding the obstructions
4: Extending Prolog for Quantified Boolean Horn Formulas
5: On the Cost of Unsuccessful Searches in Search Trees with Two-way Comparisons
6: A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons
7: Parallel In-Place Algorithms: Theory and Practice
8: Wide Network Learning with Differential Privacy
9: Approximation Algorithms for Orthogonal Non-negative Matrix Factorization
10: Improving EFX Guarantees through Rainbow Cycle Number
11: Double Coverage with Machine-Learned Advice
12: Block Elimination Distance
13: Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints
14: Online Adversarial Attacks
15: Optimal Kidney Exchange with Immunosuppressants
16: On Fast Computation of a Circulant Matrix-Vector Product
17: Approximation Algorithms for Socially Fair Clustering
18: Ribbon filter: practically smaller than Bloom and Xor
19: The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
20: A Simple Algorithm for the Constrained Sequence Problems
21: On subgraph complementation to H-free graphs
22: Weisfeiler–Leman and Graph Spectra
23: Computing Subset Feedback Vertex Set via Leafage
24: One for One, or All for All: Equilibria and Optimality of Collaboration in Federated Learning
25: Quantum routing with fast reversals
26: An Almost Optimal Edit Distance Oracle
27: Revisiting Priority $k$-Center: Fairness and Outliers
28: Maximising the total weight of on-time jobs on parallel machines subject to a conflict graph
29: Compressed Communication Complexity of Hamming Distance
30: GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra
31: Decomposable Submodular Function Minimization via Maximum Flow
32: Essentially Tight Kernels for (Weakly) Closed Graphs
33: Fine-Grained Complexity and Algorithms for the Schulze Voting Method
34: Matroid Secretary Is Equivalent to Contention Resolution