1: Splaying Preorders and Postorders
2: A Foundation for Proving Splay is Dynamically Optimal
3: Seedless Graph Matching via Tail of Degree Distribution for Correlated Erdos-Renyi Graphs
4: Parameterized inapproximability for Steiner Orientation by Gap Amplification
5: Recovery Guarantees for Compressible Signals with Adversarial Noise
6: Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
7: Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
8: Binary Decision Diagrams: from Tree Compaction to Sampling
9: Designing Perfect Simulation Algorithms using Local Correctness
10: Some Black-box Reductions for Objective-robust Discrete Optimization Problems Based on their LP-Relaxations
11: A Quantum-inspired Algorithm for General Minimum Conical Hull Problems
12: Labelings vs. Embeddings: On Distributed Representations of Distances
13: Lossless Prioritized Embeddings
14: On The Termination of a Flooding Process
15: Step-by-Step Community Detection in Volume-Regular Graphs
16: Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression
17: The Complexity of Partial Function Extension for Coverage Functions
18: Improved Algorithms for Time Decay Streams
19: Efficient computation of the Jacobi symbol
20: Approximating Constraint Satisfaction Problems on High-Dimensional Expanders
21: Formal verification of trading in financial markets
22: The simultaneous conjugacy problem in the symmetric group
23: On the m-eternal Domination Number of Cactus Graphs
24: Sensitive Distance and Reachability Oracles for Large Batch Updates
25: Metric Dimension Parameterized by Treewidth
26: Makespan Minimization with OR-Precedence Constraints
27: Stack sorting with restricted stacks
28: Finding First and Most-Beautiful Queens by Integer Programming
29: A Constant Factor Approximation for Capacitated Min-Max Tree Cover
30: A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families
31: Data Structures Meet Cryptography: 3SUM with Preprocessing
32: Sparse Recovery for Orthogonal Polynomial Transforms
33: Cluster deletion revisited
34: Quantum Computing: Lecture Notes
35: An Algorithm and Estimates for the Erd\H{o}s-Selfridge Function (work in progress)
36: On Approximate Range Mode and Range Selection
37: The Competitive Ratio of Threshold Policies for Online Unit-density Knapsack Problems
38: Domain Compression and its Application to Randomness-Optimal Distributed Goodness-of-Fit
39: An Iterative Vertex Enumeration Method for Objective Space Based Vector Optimization Algorithms
40: NN-sort: Neural Network based Data Distribution-aware Sorting
41: The Generalized Trust Region Subproblem: solution complexity and convex hull results
42: Complexity of Modification Problems for Reciprocal Best Match Graphs
43: A Constant Approximation for Colorful k-Center
44: Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio