1: Reconfiguring k-path vertex covers
2: Lock-Free Hopscotch Hashing
3: On the Complexity of BWT-runs Minimization via Alphabet Reordering
4: Estimating Normalizing Constants for Log-Concave Distributions: Algorithms and Lower Bounds
5: Balancing Covariates in Randomized Experiments with the Gram-Schmidt Walk Design
6: On dynamic succinct graph representations
7: Pliability and Approximating Max-CSPs
8: Structural Parameterizations for Equitable Coloring
9: Local Search for Group Closeness Maximization on Big Graphs
10: Fully-dynamic Planarity Testing in Polylogarithmic Time
11: Space Efficient Construction of Lyndon Arrays in Linear Time
12: Worst-Case Analysis for Randomly Collected Data
13: Adaptivity in Adaptive Submodularity
14: A Polynomial Kernel for Paw-Free Editing
15: Universal Communication, Universal Graphs, and Graph Labeling
16: Ar{\i}kan meets Shannon: Polar codes with near-optimal convergence to channel capacity
17: Interaction is necessary for distributed learning with privacy or communication constraints
18: GraCT: A Grammar-based Compressed Index for Trajectory Data
19: Dv2v: A Dynamic Variable-to-Variable Compressor
20: A polynomial kernel for $3$-leaf power deletion
21: Information carefull worstcase DecreaseKey heaps with simple nonMeld variant
22: Revisiting the Approximate Carath'eodory Problem via the Frank-Wolfe Algorithm
23: Fast Stochastic Peer Selection in Proof-of-Stake Protocols
24: Prediction of Bottleneck Points for Manipulation Planning in Cluttered Environment using a 3D Convolutional Neural Network
25: On Robustness to Adversarial Examples and Polynomial Optimization
26: Online Stochastic Matching with Edge Arrivals
27: Efficient Fair Principal Component Analysis
28: FPT Algorithms for Diverse Collections of Hitting Sets
29: Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses
30: Nested Dataflow Algorithms for Dynamic Programming Recurrences with more than O(1) Dependency
31: Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
32: A Polynomial Kernel for Funnel Arc Deletion Set
33: Rounding Dynamic Matchings Against an Adaptive Adversary
34: Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries
35: Multi-Purpose Aerial Drones for Network Coverage and Package Delivery
36: Strong Self-Concordance and Sampling
37: Enumerative Data Compression with Non-Uniquely Decodable Codes
38: Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six
39: Recent Advances in Algorithmic High-Dimensional Robust Statistics
40: Online Second Price Auction with Semi-bandit Feedback Under the Non-Stationary Setting
41: Graph Spanners in the Message-Passing Model
42: ${-1,0,1}$-APSP and (min,max)-Product Problems