1: X3: Lossless Data Compressor
2: Inexact Graph Matching Using Centrality Measures
3: The Complexity of Dynamic Least-Squares Regression
4: Asymptotic Experiments with Data Structures: Bipartite Graph Matchings and Covers
5: Optimal Vertex Connectivity Oracles
6: Classifying Subset Feedback Vertex Set for $H$-Free Graphs
7: A New Modeling of Classical Folds in Computational Origami
8: Efficient Enumeration Algorithms for Annotated Grammars
9: Submodular Maximization with Limited Function Access
10: Technical Report: Bundling Linked Data Structures for Linearizable Range Queries
11: Erd\H{o}s-Selfridge Theorem for Nonmonotone CNFs
12: Binary Fuse Filters: Fast and Smaller Than Xor Filters
13: Dynamic Suffix Array with Polylogarithmic Queries and Updates
14: An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations
15: Deterministic metric $1$-median selection with very few queries
16: Standard Vs Uniform Binary Search and Their Variants in Learned Static Indexing: The Case of the Searching on Sorted Data Benchmarking Software Platform
17: Parallel Flow-Based Hypergraph Partitioning
18: What Does Dynamic Optimality Mean in External Memory?
19: Testing matrix product states
20: SQUAD: Combining Sketching and Sampling Is Better than Either for Per-item Quantile Estimation
21: Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems
22: No self-concordant barrier interior point method is strongly polynomial
23: Fixation Maximization in the Positional Moran Process
24: k-Center Clustering with Outliers in Sliding Windows
25: BFS based distributed algorithm for parallel local directed sub-graph enumeration