1: Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
2: Colorful Minors
3: A Fast Coloring Oracle for Average Case Hypergraphs
4: Distributionally Robust Optimization with Adversarial Data Contamination
5: Access Control for Information-Theoretically Secure Key-Document Stores
6: Solving Random Planted CSPs below the $n^{k/2}$ Threshold
7: Solving Linear Programs with Differential Privacy
8: Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
9: FPT Parameterisations of Fractional and Generalised Hypertree Width
10: Faster algorithms for k-Orthogonal Vectors in low dimension
11: Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
12: Finding Order-Preserving Subgraphs
13: Improved sampling algorithms and Poincar'e inequalities for non-log-concave distributions
14: Fully Dynamic Euclidean k-Means
15: Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
16: On Tight Robust Coresets for $k$-Medians Clustering
17: Permutation patterns in streams
18: Scheduling on Identical Machines with Setup Time and Unknown Execution Time
19: Compressed data structures for Heegaard splittings
20: Multipass Linear Sketches for Geometric LP-Type Problems
21: Finite Pinwheel Scheduling: the k-Visits Problem
22: Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure
23: Kernelization for list $H$-coloring for graphs with small vertex cover
24: Pathfinding in Self-Deleting Graphs
25: Weighted $k$-Server Admits an Exponentially Competitive Algorithm
26: FastReChain: Highly Responsive and Low-Overhead Centralized Route Scheduling in Clos Datacenter Networks
27: A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
28: Online Block Packing
29: Max-Cut with Multiple Cardinality Constraints
30: Fast Approximate Rank Determination and Selection with Group Testing
31: An EPTAS for multiprocessor scheduling with rejection under a machine cost constraint
32: Computing and Bounding Equilibrium Concentrations in Athermic Chemical Systems
33: Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
34: Analysis of Langevin midpoint methods using an anticipative Girsanov theorem
35: Waiting is worth it and can be improved with predictions
36: Cut-Matching Games for Bipartiteness Ratio of Undirected Graphs
37: A 1/2-Approximation for Budgeted $k$-Submodular Maximization
38: Efficient Semi-External Breadth-First Search
39: The Price of Diversity of the Traveling Salesman Problem
40: Maintaining Routing Structures under Deletions via Self-Pruning
41: Kernelization for $H$-Coloring
42: Online Rounding for Set Cover under Subset Arrivals
43: Computational-Statistical Tradeoffs from NP-hardness
44: Efficiently Constructing Sparse Navigable Graphs
45: Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
46: Strassen $2\times2$ Matrix Multiplication from a 3-dimensional Volume Form
47: Combinatorics of Palindromes
48: Tight Bounds for Answering Adaptively Chosen Concentrated Queries
49: Treedepth Inapproximability and Exponential ETH Lower Bound
50: Improved girth approximation in weighted undirected graphs
51: Quantum Pattern Matching with Wildcards
52: FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
53: Optimal antimatroid sorting
54: Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
55: An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
56: Weighted Matching in a Poly-Streaming Model
57: Topological Social Choice: Designing a Noise-Robust Polar Distance for Persistence Diagrams
58: Tighter Lower Bounds for Single Source Personalized PageRank
59: Quantum State Preparation Based on LimTDD
60: New Algorithms for #2-SAT and #3-SAT
61: Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set
62: Characterizing and Testing Configuration Stability in Two-Dimensional Threshold Cellular Automata
63: $k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
64: Dvorak-Dell-Grohe-Rattan theorem via an asymptotic argument
65: A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation
66: Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts
67: Probing EFX via PMMS: (Non-)Existence Results in Discrete Fair Division
68: Better Models and Algorithms for Learning Ising Models from Dynamics
69: On Algorithmic Robustness of Corrupted Markov Chains
70: Predict, Reposition, and Allocate: A Greedy and Flow-Based Architecture for Sustainable Urban Food Delivery
71: A Myhill-Nerode Type Characterization of 2detLIN Languages
72: Language Generation in the Limit: Noise, Loss, and Feedback
73: 1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP
74: Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling
75: Certificate-Sensitive Subset Sum: Realizing Instance Complexity
76: An $n^{O(\log\log n)}$ time approximation scheme for capacitated VRP in the Euclidean plane
77: Fast Algorithms for Graph Arboricity and Related Problems
78: On zeros and algorithms for disordered systems: mean-field spin glasses
79: Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound