1: Computing the original eBWT faster, simpler, and with less memory
2: First Approximation for Uniform Lower and Upper Bounded Facility Location Problem avoiding violation in Lower Bounds
3: Efficient Inference via Universal LSH Kernel
4: Practical Near Neighbor Search via Group Testing
5: Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set
6: On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem
7: Diversity-aware $k$-median : Clustering with fair center representation
8: Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems
9: Graph coarsening: From scientific computing to machine learning
10: Robust Regression Revisited: Acceleration and Improved Estimation Rates
11: Better Algorithms for Individually Fair $k$-Clustering
12: A Bloom Filter Survey: Variants for Different Domain Applications
13: Noisy Adaptive Group Testing via Noisy Binary Search
14: Forced pairs in A-Stick graphs
15: Weighted Random Sampling on GPUs
16: Finding single-source shortest $p$-disjoint paths: fast computation and sparse preservers
17: Large W limit of the knapsack problem
18: Polarization in Geometric Opinion Dynamics
19: Certifying solution geometry in random CSPs: counts, clusters and balance
20: Breaking the $O(n)$-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees
21: Adaptive Relaxations for Multistage Robust Optimization
22: Linear Space Streaming Lower Bounds for Approximating CSPs
23: Optimal Fine-grained Hardness of Approximation of Linear Equations
24: The Complexity of Boolean Conjunctive Queries with Intersection Joins
25: Johnson-Lindenstrauss Embeddings with Kronecker Structure
26: The Price of Tolerance in Distribution Testing
27: Littlestone Classes are Privately Online Learnable
28: Threshold-Based Quantum Optimization
29: Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing
30: Improved Approximation Algorithms for Individually Fair Clustering
31: Generalized max-flows and min-cuts in simplicial complexes
32: $\alpha$-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms
33: Linear-Time Approximation Scheme for k-Means Clustering of Affine Subspaces
34: Scheduling on uniform and unrelated machines with bipartite incompatibility graphs
35: Fractionally Subadditive Maximization under an Incremental Knapsack Constraint
36: The Reward-Penalty-Selection Problem
37: Differentially Private Algorithms for Graphs Under Continual Observation
38: Additive Sparsification of CSPs