1: The Geometry of the space of Discrete Coalescent Trees
2: Almost Optimal Inapproximability of Multidimensional Packing Problems
3: Cantor Mapping Technique
4: Sketching Merge Trees for Scientific Data Visualization
5: Fair Sampling Error Analysis on NISQ Devices
6: Shortest non-separating st-path on chordal graphs
7: Beyond Helly graphs: the diameter problem on absolute retracts
8: Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push
9: Enumeration Algorithms for Conjunctive Queries with Projection
10: Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration
11: Strictly In-Place Algorithms for Permuting and Inverting Permutations
12: Learning with Comparison Feedback: Online Estimation of Sample Statistics
13: Locality Sensitive Hashing for Efficient Similar Polygon Retrieval
14: Envy-free matchings with cost-controlled quotas
15: Lattice reduction by cubification
16: Number Parsing at a Gigabyte per Second
17: Diverse Collections in Matroids and Graphs
18: Improved Hierarchical Clustering on Massive Datasets with Broad Guarantees
19: A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
20: Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries
21: Practical Fully Dynamic Minimum Cut Algorithms
22: Distributed storage algorithms with optimal tradeoffs
23: Improving Run Length Encoding by Preprocessing
24: Spectral Clustering Oracles in Sublinear Time