1: The Kannan-Lov'asz-Simonovits Conjecture
2: Efficient Reassembling of Three-Regular Planar Graphs
3: Theoretical Model of Computation and Algorithms for FPGA-based Hardware Accelerators
4: A note on the integrality gap of the configuration LP for restricted Santa Claus
5: Improved Space-Time Tradeoffs for kSUM
6: On the complexity of the (approximate) nearest colored node problem
7: Improved Time and Space Bounds for Dynamic Range Mode
8: Online Facility Location with Deletions
9: Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
10: Integrality Gap of the Configuration LP for the Restricted Max-Min Fair Allocation
11: A quantum-inspired classical algorithm for recommendation systems
12: A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks
13: A Framework for Vehicle Routing Approximation Schemes in Trees
14: Data-Parallel Hashing Techniques for GPU Architectures
15: Sliding window order statistics in sublinear space
16: Metrical task systems on trees via mirror descent and unfair gluing
17: Fast Exact Algorithms Using Hadamard Product of Polynomials
18: Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering
19: A new graph modelisation for molecule similarity
20: Algorithmic Meta-Theorems for Monotone Submodular Maximization
21: Benchmarking treewidth as a practical component of tensor-network–based quantum simulation
22: Push-Down Trees: Optimal Self-Adjusting Complete Trees
23: Know When to Fold ‘Em: Self-Assembly of Shapes by Folding in Oritatami
24: A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs
25: Algorithms for #BIS-hard problems on expander graphs
26: Fast Modular Subset Sum using Linear Sketching
27: Parameterized Distributed Algorithms
28: 3-wise Independent Random Walks can be Slightly Unbounded
29: Non-Gaussian Component Analysis using Entropy Methods
30: Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem
31: No-regret algorithms for online $k$-submodular maximization
32: Spectral Sparsification of Hypergraphs
33: Maintaning maximal matching with lookahead
34: Optimal Short-Circuit Resilient Formulas
35: Optimal Algorithms for Right-Sizing Data Centers- Extended Version
36: Mean Isoperimetry with Control on Outliers: Exact and Approximation Algorithms
37: Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation
38: On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)
39: An Algorithmic Blend of LPs and Ring Equations for Promise CSPs
40: Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
41: Approximation Algorithms for Clustering via Weighted Impurity Measures
42: How Do Classifiers Induce Agents To Invest Effort Strategically?
43: A matching-based heuristic algorithm for school bus routing problems
44: Token Sliding on Split Graphs
45: A Simple and Space Efficient Segment Tree Implementation
46: Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model
47: SAT encodings for sorting networks, single-exception sorting networks and $\epsilon-$halvers