1: Coreset for Robust Geometric Median: Eliminating Size Dependency on Outliers
2: Reviving Thorup’s Shortcut Conjecture
3: Hedgegraph Polymatroids
4: Most Juntas Saturate the Hardcore Lemma
5: Can Like Attract Like? A Study of Homonymous Gathering in Networks
6: Fast Dimensionality Reduction from $\ell_2$ to $\ell_p$
7: Perturbation Bounds for Low-Rank Inverse Approximations under Noise
8: ${s,t}$-Separating Principal Partition Sequence of Submodular Functions
9: Spectral Perturbation Bounds for Low-Rank Approximation with Applications to Privacy
10: Exact zCDP Characterizations for Fundamental Differentially Private Mechanisms
11: Online 3-Taxi on General Metrics
12: The Strong Birthday Problem Revisited
13: Space-Efficient k-Mismatch Text Indexes
14: Posterior Sampling by Combining Diffusion Models with Annealed Langevin Dynamics
15: Tensor decomposition beyond uniqueness, with an application to the minrank problem
16: Tight Differentially Private PCA via Matrix Coherence
17: On Purely Private Covariance Estimation
18: Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms
19: Green Bin Packing
20: Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
21: Unbounded-width CSPs are Untestable in a Sublinear Number of Queries
22: A Simple Deterministic Reduction From Gomory-Hu Tree to Maxflow and Expander Decomposition