1: The Stellar decomposition: A compact representation for simplicial complexes and beyond
2: A Lower Bound Technique for Communication in BSP
3: Fair Personalization
4: Fast Heuristic Algorithm for Multi-scale Hierarchical Community Detection
5: Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs
6: Dynamic clustering to minimize the sum of radii
7: On the Min-Max-Delay Problem: NP-completeness, Algorithm, and Integrality Gap
8: Accelerated Stochastic Power Iteration
9: Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four
10: A Local-Search Algorithm for Steiner Forest
11: Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration
12: A succinct data structure for self-indexing ternary relations
13: Compressed Representation of Dynamic Binary Relations with Applications
14: A characterization of testable hypergraph properties
15: A branch-and-bound algorithm for the minimum radius $k$-enclosing ball problem
16: Round Compression for Parallel Matching Algorithms
17: Fast exact algorithms for some connectivity problems parametrized by clique-width
18: Finding the most parsimonious or likely tree in a network with respect to an alignment
19: Enumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices
20: Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP
21: Stochastic Packing Integer Programs with Few Queries
22: Batched QR and SVD Algorithms on GPUs with Applications in Hierarchical Matrix Compression
23: Triangle packing in (sparse) tournaments: approximation and kernelization
24: Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions
25: Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
26: Approximation Schemes for Clustering with Outliers
27: Topological Sorting under Regular Constraints
28: Lempel-Ziv: a “one-bit catastrophe” but not a tragedy
29: How hard is it to satisfy (almost) all roommates?
30: A Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time
31: Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?
32: Satiation in Fisher Markets and Approximation of Nash Social Welfare
33: Competitive Algorithms for Generalized k-Server in Uniform Metrics
34: Computing the number of induced copies of a fixed graph in a bounded degree graph