1: Toward Scalable Algorithms for the Unsplittable Shortest Path Routing Problem
2: Near-Perfect Recovery in the One-Dimensional Latent Space Model
3: A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
4: Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lov'asz Local Lemma
5: Runtime Analysis of Evolutionary Algorithms via Symmetry Arguments
6: Fully Dynamic Algorithm for Constrained Submodular Optimization
7: Fair Classification with Noisy Protected Attributes: A Framework with Provable Guarantees
8: Classification Under Misspecification: Halfspaces, Generalized Linear Models, and Connections to Evolvability
9: A New Integer Programming Formulation of the Graphical Traveling Salesman Problem
10: Hedging in games: Faster convergence of external and swap regrets
11: Online Page Migration with ML Advice
12: Constrained episodic reinforcement learning in concave-convex and knapsack settings
13: Optimal-Time Queries on BWT-runs Compressed Indexes
14: On Coresets For Regularized Regression
15: Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation
16: Node Embeddings and Exact Low-Rank Representations of Complex Networks
17: The nearest-colattice algorithm
18: Noisy polynomial interpolation modulo prime powers
19: An Asymptotically Optimal Algorithm for Online Stacking
20: Introducing Structure to Expedite Quantum Search
21: Sliding Window Algorithms for k-Clustering Problems
22: Tailoring r-index for metagenomics
23: Composite Logconcave Sampling with a Restricted Gaussian Oracle
24: Efficient Partial Snapshot Implementations
25: Accelerating linear solvers for Stokes problems with C++ metaprogramming
26: Treewidth versus clique number. I. Graph classes with a forbidden structure
27: A General Framework for Analyzing Stochastic Dynamics in Learning Algorithms
28: Pointer Graph Networks
29: Learning Halfspaces with Tsybakov Noise
30: Optimally Deceiving a Learning Leader in Stackelberg Games
31: CoinPress: Practical Private Mean and Covariance Estimation
32: Randomized Consensus with Regular Registers
33: List Learning with Attribute Noise
34: Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
35: Robust Sub-Gaussian Principal Component Analysis and Width-Independent Schatten Packing
36: A Unified Analysis of Stochastic Gradient Methods for Nonconvex Federated Optimization
37: Distance-based phylogenetic inference from typing data: a unifying view
38: Sallow: a heuristic algorithm for treedepth decompositions
39: An Adaptive Approach to Recoverable Mutual Exlcusion
40: SMS in PACE 2020
41: Fourier Sparse Leverage Scores and Approximate Kernel Learning
42: On Packing Low-Diameter Spanning Trees
43: Balanced Allocation on Hypergraphs
44: When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear-Time
45: Total Coloring for some classes of Cayley graphs
46: Group Fairness for Knapsack Problems
47: Global Attention Improves Graph Networks Generalization
48: Vehicle Redistribution in Ride-Sourcing Markets using Convex Minimum Cost Flows