1: Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives
2: Holiest Minimum-Cost Paths and Flows in Surface Graphs
3: Operator Scaling via Geodesically Convex Optimization, Invariant Theory and Polynomial Identity Testing
4: Query Shortest Paths Amidst Growing Discs
5: A Euclidean Algorithm for Binary Cycles with Minimal Variance
6: Tight Query Complexity Lower Bounds for PCA via Finite Sample Deformed Wigner Law
7: NegPSpan: efficient extraction of negative sequential patterns with embedding constraints
8: A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\log n\log\Delta / \log^2\log\Delta)$ Rounds
9: Losing Treewidth by Separating Subsets
10: A PTAS for subset TSP in minor-free graphs
11: Pigeonring: A Principle for Faster Thresholded Similarity Search
12: Optimal streaming and tracking distinct elements with high probability
13: Missing Slice Recovery for Tensors Using a Low-rank Model in Embedded Space
14: Simple dynamic algorithms for Maximal Independent Set and other problems
15: On Undetected Redundancy in the Burrows-Wheeler Transform
16: The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
17: A Framework for Searching in Graphs in the Presence of Errors
18: Red-Black Trees with Constant Update Time
19: Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams
20: Improved Approximation for Tree Augmentation: Saving by Rewiring
21: A Subquadratic Approximation Scheme for Partition
22: BFS Enumeration for Breaking Symmetries in Graphs
23: Reconstructing Point Sets from Distance Distributions
24: Approximating Hamiltonian dynamics with the Nystr"om method
25: Distributed Maximal Independent Set on Scale-Free Networks
26: $\varepsilon$-Coresets for Clustering (with Outliers) in Doubling Metrics
27: Tight Lower Bounds for List Edge Coloring