1: Burning graphs through farthest-first traversal
2: Vertex Sparsification for Edge Connectivity in Polynomial Time
3: Integer Programming and Incidence Treedepth
4: Bridging the Gap Between Tree and Connectivity Augmentation: Unified and Stronger Approaches
5: The Variable-Processor Cup Game
6: Comb inequalities for typical Euclidean TSP instances
7: Better Fewer but Better: Community Search with Outliers
8: New Results for the $k$-Secretary Problem
9: Improved Online Algorithms for Knapsack and GAP in the Random Order Model
10: Best Fit Bin Packing with Random Order Revisited
11: Train Tracks with Gaps: Applying the Probabilistic Method to Trains
12: Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates
13: Searching, Sorting, and Cake Cutting in Rounds
14: Transaction Fee Mechanism Design for the Ethereum Blockchain: An Economic Analysis of EIP-1559
15: Huskysort
16: Electric Vehicle Charging Station Search in Stochastic Environments
17: Local Routing in a Tree Metric 1-Spanner
18: Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms
19: Leveraging Unknown Structure in Quantum Query Algorithms
20: The Model Counting Competition 2020
21: Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit
22: Distributed algorithms for fractional coloring
23: Optimal labelling schemes for adjacency, comparability, and reachability
24: Computing Crisp Simulations and Crisp Directed Simulations for Fuzzy Graph-Based Structures
25: On Parameterized Complexity of Binary Networked Public Goods Game
26: Competition analysis on the over-the-counter credit default swap market
27: Robustly Learning Mixtures of $k$ Arbitrary Gaussians
28: Iterated Linear Optimization
29: Online $k$-Taxi via Double Coverage and Time-Reverse Primal-Dual
30: Average-Case Integrality Gap for Non-Negative Principal Component Analysis
31: Near-Optimal Algorithms for Point-Line Covering Problems
32: An O(n) time algorithm for finding Hamilton cycles with high probability
33: On Line Sum Optimization
34: Constant round distributed domination on graph classes with bounded expansion
35: Polynomial-time trace reconstruction in the low deletion rate regime
36: The Secretary Problem with Distributions
37: r-Gathering Problems on Spiders:Hardness, FPT Algorithms, and PTASes
38: Biclustering and Boolean Matrix Factorization in Data Streams
39: Majority Opinion Diffusion in Social Networks: An Adversarial Approach
40: Low depth algorithms for quantum amplitude estimation
41: FPRAS Approximation of the Matrix Permanent in Practice
42: Stronger Calibration Lower Bounds via Sidestepping
43: A Proof of the MV Matching Algorithm
44: LCS Graph Kernel Based on Wasserstein Distance in Longest Common Subsequence Metric Space