1: Algorithms for Stable Matching and Clustering in a Grid
2: Matrix Scaling and Balancing via Box Constrained Newton’s Method and Interior Point Methods
3: Much Faster Algorithms for Matrix Scaling
4: Testing hereditary properties of ordered graphs and matrices
5: Exploring an Infinite Space with Finite Memory Scouts
6: A Framework for the Secretary Problem on the Intersection of Matroids
7: Solving Zero-sum Games using Best Response Oracles with Applications to Search Games
8: 0/1/all CSPs, Half-Integral $A$-path Packing, and Linear-Time FPT Algorithms
9: Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching
10: The Kth Traveling Salesman Problem is Pseudopolynomial when TSP is polynomial
11: Voronoi diagrams on planar graphs, and computing the diameter in deterministic $\tilde{O}(n^{5/3})$ time
12: Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in $O(\log^3 n)$ Worst Case Update Time
13: Minor-matching hypertree width
14: On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks
15: Tight Lower Bounds for Differentially Private Selection
16: Weighted k-Server Bounds via Combinatorial Dichotomies
17: Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices
18: Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices
19: Approximating Optimization Problems using EAs on Scale-Free Networks
20: Optimal strategies for weighted ray search
21: A Matrix Expander Chernoff Bound
22: Robustly Learning a Gaussian: Getting Optimal Error, Efficiently
23: Approximating the Largest Root and Applications to Interlacing Families
24: On the Quantitative Hardness of CVP
25: Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
26: Hybridizing Non-dominated Sorting Algorithms: Divide-and-Conquer Meets Best Order Sort
27: Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
28: Point Sweep Coverage on Path
29: Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data
30: Fast Similarity Sketching
31: Encoding Cardinality Constraints using Generalized Selection Networks