1: Faster Algorithms for Agnostically Learning Disjunctions and their Implications
2: On Learning Parallel Pancakes with Mostly Uniform Weights
3: Prize-Collecting Forest with Submodular Penalties: Improved Approximation
4: Adaptivity Gaps for Stochastic Probing with Subadditive Functions
5: On the Price of Differential Privacy for Hierarchical Clustering
6: Smooth Calibration and Decision Making
7: Quantum Speedup for Sampling Random Spanning Trees
8: Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
9: Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
10: A Mysterious Connection Between Tolerant Junta Testing and Agnostically Learning Conjunctions
11: A Theory of Spectral CSP Sparsification
12: Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
13: Linear Time Subsequence and Supersequence Regex Matching
14: Near-optimal Hypergraph Sparsification in Insertion-only and Bounded-deletion Streams
15: Universal Online Contention Resolution with Preselected Order
16: Fully Scalable MPC Algorithms for Euclidean k-Center
17: An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
18: Hardness of Median and Center in the Ulam Metric
19: Multiplicative Spanners in Minor-Free Graphs
20: Improved Streaming Edge Coloring
21: Estimating Random-Walk Probabilities in Directed Graphs
22: Streaming algorithms for products of probabilities
23: Sorting as Gradient Flow on the Permutohedron
24: From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
25: Traffic-Oblivious Multi-Commodity Flow Network Design
26: Graph modification of bounded size to minor-closed classes as fast as vertex deletion
27: Approximating Optimal Labelings for Temporal Connectivity
28: Identifying Approximate Minimizers under Stochastic Uncertainty
29: Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
30: Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation
31: Knapsack on Graphs with Relaxed Neighborhood Constraints
32: Simple Universally Optimal Dijkstra
33: Dynamic Approximate Maximum Matching in the Distributed Vertex Partition Model
34: Edge-weighted Online Stochastic Matching Under Jaillet-Lu LP
35: Morphisms and BWT-run Sensitivity
36: Dynamic Membership for Regular Tree Languages
37: The Case for External Graph Sketching
38: Linear-Time Multilevel Graph Partitioning via Edge Sparsification
39: A general framework for finding diverse solutions via network flow and its applications
40: Pushing the frontiers of subexponential FPT time for Feedback Vertex Set
41: Online Metric TSP
42: Realization of Temporally Connected Graphs Based on Degree Sequences
43: Fitting Tree Metrics and Ultrametrics in Data Streams
44: Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number
45: Preserving Distances in Faulty Colored Graphs
46: Searching in trees with k-up-modular weight functions
47: PHast – Perfect Hashing made fast
48: An Optimal $3$-Fault-Tolerant Connectivity Oracle
49: Improving the Threshold for Finding Rank-1 Matrices in a Subspace
50: The Marco Polo Problem: A Combinatorial Approach to Geometric Localization
51: Efficient Tree Generation for Globally Optimal Decisions under Probabilistic Outcomes
52: Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
53: Optimal Secure Coded Distributed Computation over all Fields
54: Fully Dynamic Algorithms for Transitive Reduction
55: Solving Partial Dominating Set and Related Problems Using Twin-Width
56: Efficient Matching of Some Fundamental Regular Expressions with Backreferences
57: Treewidth Parameterized by Feedback Vertex Number
58: Computing Distances on Graph Associahedra is Fixed-parameter Tractable
59: On constrained intersection representations of graphs and digraphs
60: Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures
61: Heavy-Tailed Privacy: The Symmetric alpha-Stable Privacy Mechanism
62: Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets
63: Boundaried Kernelization
64: Online Distributed Queue Length Estimation
65: Lower bounds on collective additive spanners
66: Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
67: Minimum Cost Nowhere-zero Flows and Cut-balanced Orientations
68: Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT
69: Entrywise Approximate Matrix Inversion
70: Fast and memory-efficient BWT construction of repetitive texts using Lyndon grammars
71: The Trichotomy of Regular Property Testing
72: (Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
73: Optimal Static Fully Indexable Dictionaries
74: Dynamic r-index: An Updatable Self-Index for Highly Repetitive Strings
75: Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
76: Faithful universal graphs for minor-closed classes
77: Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries
78: On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
79: Near-Optimal Minimum Cuts in Hypergraphs at Scale
80: Faster All-Pairs Optimal Electric Car Routing