Composable Coresets for Determinant Maximization: Greedy is Almost Optimal. - Siddharth Gollapudi; Sepideh Mahabadi; Varun Sivashankar (NeurIPS, 2023)

Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters. - Siddharth Gollapudi; Neel Karia; Varun Sivashankar; Ravishankar Krishnaswamy; Nikit Begwani; Swapnil Raz; Yiyong Lin 001; Yin Zhang; Neelam Mahapatro; Premkumar Srinivasan; Amit Singh 003; Harsha Vardhan Simhadri (WWW, 2023)

Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints. - Varun Suriyanarayana; Varun Sivashankar; Siddharth Gollapudi; David B. Shmoys (SODA, 2024)

Learning-Augmented Frequent Directions. - Anders Aamand; Justin Y. Chen; Siddharth Gollapudi; Sandeep Silwal; Hao Wu (ICLR, 2025)

Improved Approximations for Hard Graph Problems using Predictions. - Anders Aamand; Justin Y. Chen; Siddharth Gollapudi; Sandeep Silwal; Hao Wu (CoRR, 2025)