1: A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs
2: Problems hard for treewidth but easy for stable gonality
3: Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions
4: The Complexity of Matching Games: A Survey
5: Hedonic Games and Treewidth Revisited
6: Longest (Sub-)Periodic Subsequence
7: Multiparameter Bernoulli Factories
8: A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem
9: Heuristic computation of exact treewidth
10: An Optimal-Time RLBWT Construction in BWT-runs Bounded Space
11: On the Complexity of Scheduling Problems With a Fixed Number of Parallel Identical Machines
12: The Pareto cover problem
13: Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime
14: Distributed k-Means with Outliers in General Metrics
15: Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks
16: SAT Backdoors: Depth Beats Size
17: Extended MSO Model Checking via Small Vertex Integrity
18: Online Scheduling of Time-Critical Tasks to Minimize the Number of Calibrations
19: A Faster Interior-Point Method for Sum-of-Squares Optimization
20: Efficient Classification of Locally Checkable Problems in Regular Trees
21: Oracle-Efficient Online Learning for Beyond Worst-Case Adversaries
22: The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networks
23: A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with Bounded Tree-width
24: Listing Maximal k-Plexes in Large Real-World Graphs
25: Strong spatial mixing for repulsive point processes
26: An Optimal Algorithm for Product Structure in Planar Graphs
27: Computing list homomorphisms in geometric intersection graphs
28: Sampling Approximately Low-Rank Ising Models: MCMC meets Variational Methods
29: Worst-Case to Average-Case Reductions via Additive Combinatorics
30: Single-Leg Revenue Management with Advice
31: Quantum and Classical Algorithms for Bounded Distance Decoding
32: Sketching Distances in Monotone Graph Classes
33: Learning Predictions for Algorithms with Predictions
34: Sorting Balls and Water: Equivalence and Computational Complexity
35: Scalable Fine-Grained Parallel Cycle Enumeration Algorithms
36: A Quantum Polynomial-Time Solution to The Dihedral Hidden Subgroup Problem
37: Finding shortest non-separating and non-disconnecting paths
38: Tight Bounds for Sketching the Operator Norm, Schatten Norms, and Subspace Embeddings
39: Differentially Private Regression with Unbounded Covariates
40: Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance
41: Learning Low Degree Hypergraphs
42: Online Spanners in Metric Spaces
43: Obtaining Approximately Optimal and Diverse Solutions via Dispersion
44: Efficient computation of oriented vertex and arc colorings of special digraphs
45: Permutation Predictions for Non-Clairvoyant Scheduling
46: Priority Algorithms with Advice for Disjoint Path Allocation Problems