1: Online Search With a Hint
2: Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks
3: Localized Topological Simplification of Scalar Data
4: Sorting an Array Using the Topological Sort of a Corresponding Comparison Graph
5: On the computational tractability of a geographic clustering problem arising in redistricting
6: Obtuse Lattice Bases
7: Document Similarity from Vector Space Densities
8: Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the F"uredi, Kahn, and Seymour Conjecture
9: Fully-Dynamic Submodular Cover with Bounded Recourse
10: Structural Iterative Rounding for Generalized $k$-Median Problems
11: Towards constant-factor approximation for chordal / distance-hereditary vertex deletion
12: Nearest Neighbor Search for Hyperbolic Embeddings
13: Reconstructing the Dynamic Sea Surface from Tide Gauge Records Using Optimal Data-Dependent Triangulations
14: Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms
15: Differentially private $k$-means clustering via exponential mechanism and max cover
16: Circular Trace Reconstruction
17: Zuckerli: A New Compressed Representation for Graphs
18: New Results and Bounds on Online Facility Assignment Problem
19: Approximating $(k,\ell)$-Median Clustering for Polygonal Curves
20: Physarum-Inspired Multi-Commodity Flow Dynamics
21: Fast Byzantine Gathering with Visibility in Graphs
22: Optimal Load Balanced Demand Distribution under Overload Penalties
23: Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs
24: Efficient Algorithms to Mine Maximal Span-Trusses From Temporal Graphs
25: Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
26: Smoothed analysis of the condition number under low-rank perturbations
27: Fair and Useful Cohort Selection
28: Faster motif counting via succinct color coding and adaptive sampling
29: Efficient Network Reliability Computation in Uncertain Graphs
30: Access-Adaptive Priority Search Tree
31: On Communication Compression for Distributed Optimization on Heterogeneous Data
32: Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices
33: Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing
34: Explicit near-fully X-Ramanujan graphs
35: A Tensor Network based Decision Diagram for Representation of Quantum Circuits
36: A Framework for Private Matrix Analysis
37: The Mixture Graph-A Data Structure for Compressing, Rendering, and Querying Segmentation Histograms
38: Multi-Way Number Partitioning: an Information-Theoretic View
39: Space efficient merging of de Bruijn graphs and Wheeler graphs
40: On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes
41: Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems
42: Ray Tracing Structured AMR Data Using ExaBricks
43: Achieving anonymity via weak lower bound constraints for k-median and k-means