1: On the Parameterized Complexity of the $s$-Club Cluster Edge Deletion Problem
2: Weisfeiler and Leman Go Walking: Random Walk Kernels Revisited
3: From Width-Based Model Checking to Width-Based Automated Theorem Proving
4: The k-Server with Preferences Problem
5: HyperLogLogLog: Cardinality Estimation With One Log More
6: Approximating CSPs with Outliers
7: Holonomic equations and efficient random generation of binary trees
8: ENS-t-SNE: Embedding Neighborhoods Simultaneously t-SNE
9: The Laplacian Paradigm in the Broadcast Congested Clique
10: Federated singular value decomposition for high dimensional data
11: Competitive Algorithms for Block-Aware Caching
12: Approximate Euclidean lengths and distances beyond Johnson-Lindenstrauss
13: Hardness of Maximum Likelihood Learning of DPPs
14: Substring Complexities on Run-length Compressed Strings
15: Lyapunov function approach for approximation algorithm design and analysis: with applications in submodular maximization
16: Uniformly Bounded Regret in Dynamic Fair Allocation
17: Unbiased and Efficient Sampling of Dependency Trees
18: Deterministic Massively Parallel Algorithms for Ruling Sets
19: SAT Preprocessors and Symmetry
20: The complexity of blocking (semi)total dominating sets with edge contractions
21: Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding
22: A Universal Error Measure for Input Predictions Applied to Online Graph Problems
23: A parameterized approximation algorithm for the Multiple Allocation $k$-Hub Center
24: Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient
25: Cost-efficient Gaussian Tensor Network Embeddings for Tensor-structured Inputs
26: More Recent Advances in (Hyper)Graph Partitioning
27: Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws
28: QUIC-FL: Quick Unbiased Compression for Federated Learning
29: Fast Causal Orientation Learning in Directed Acyclic Graphs
30: Quantum Augmented Dual Attack
31: Group-invariant max filtering
32: Adaptive Massively Parallel Algorithms for Cut Problems
33: Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost
34: Provably Auditing Ordinary Least Squares in Low Dimensions
35: Differentially Private Covariance Revisited
36: Travelling Salesman Problem: Parallel Implementations & Analysis
37: Fair Labeled Clustering
38: An efficient polynomial-time approximation scheme for parallel multi-stage open shops
39: How to Compose Shortest Paths