1: Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs
2: Deterministic subgraph detection in broadcast CONGEST
3: Inverse Lyndon words and Inverse Lyndon factorizations of words
4: A scalable solution to the nearest neighbor search problem through local-search methods on neighbor graphs
5: Optimal-Time Text Indexing in BWT-runs Bounded Space
6: Tiny Groups Tackle Byzantine Adversaries
7: Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs
8: Gaussian Variant of Freivalds’ Algorithm for Efficient and Reliable Matrix Product Verification
9: A Faster Construction of Greedy Consensus Trees
10: The Logarithmic Funnel Heap: An Efficient Priority Queue For Extremely Large Sets
11: Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs
12: Fast Regression with an $\ell_\infty$ Guarantee
13: Saving Critical Nodes with Firefighters is FPT
14: Succinct Partial Sums and Fenwick Trees
15: Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applications