1: A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
2: The Complexity of Distributed Edge Coloring with Small Palettes
3: Graphettes: Constant-time determination of graphlet and orbit identity including (possibly disconnected) graphlets up to size 8
4: Quasi-PTAS for Scheduling with Precedences using LP Hierarchies
5: Streaming Periodicity with Mismatches
6: Linear algebraic analogues of the graph isomorphism problem and the Erd\H{o}s-R'enyi model
7: A fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over $\mathbb{Z}/p\mathbb{Z}$
8: Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width
9: Sample Efficient Estimation and Recovery in Sparse FFT via Isolation on Average
10: Generalized Uniformity Testing
11: Polylogarithmic approximation for minimum planarization (almost)
12: New Approximations for Coalitional Manipulation in General Scoring Rules
13: Online Primal-Dual Algorithms with Configuration Linear Programs
14: The covertime of a biased random walk on $G_{n,p}$
15: Balanced Allocation Through Random Walk
16: SOCRATES: A System For Scalable Graph Analytics
17: Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times under Non-Availability or Deadline Constraints
18: Finding Subcube Heavy Hitters in Analytics Data Streams
19: When data mining meets optimization: A case study on the quadratic assignment problem
20: The streaming $k$-mismatch problem
21: Optimizing Revenue over Data-driven Assortments
22: An Optimal Realization Algorithm for Bipartite Graphs with Degrees in Prescribed Intervals
23: Online Service with Delay
24: Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor
25: An FPT algorithm for planar multicuts with sources and sinks on the outer face
26: Kirchhoff Index As a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms
27: Quantum state certification
28: Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
29: Practical Minimum Cut Algorithms
30: Scalable Kernelization for Maximum Independent Sets
31: Optimally Gathering Two Robots
32: Preconditioned Spectral Clustering for Stochastic Block Partition Streaming Graph Challenge