Skip to content

Sepideh Mahabadi

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

22

Venues

8

Active years

2013–2026

Best venue rank

A*

Where they publish

Papers

22 indexed papers, newest first.

YearVenueTitleAuthors
2026ICALPThe Expiration Streaming Model: Diameter, k-Center, Counting, Sampling, and Friends.Lotte Blank, Sergio Cabello, Mohammad Taghi Hajiaghayi, Robert Krauthgamer, Sepideh Mahabadi, Andr Nusser, Jeff M. Phillips, Jonas Sauer
2026ICALPOnline Steiner Forest with Recourse.Yaowei Long, Sepideh Mahabadi, Sherry Sarkar, Jakub Tarnawski
2026SODASublinear Metric Steiner Forest via Maximal Independent Set.Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
2025ICALPGuessing Efficiently for Constrained Subspace Approximation.Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu, Ali Vakilian, David P. Woodruff
2025ICALPA 0.51-Approximation of Maximum Matching in Sublinear n^{1.5} Time.Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski
2025ICMLGraph-Based Algorithms for Diverse Similarity Search.Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, Sepideh Mahabadi, Vikas C. Raykar, Kirankumar Shiragur, Haike Xu
2024ICALPStreaming Algorithms for Connectivity Augmentation.Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
2024ICLREfficiently Computing Similarities to Private Datasets.Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski
2023ICMLApproximation Algorithms for Fair Range Clustering.Sdjro Salomon Hotegni, Sepideh Mahabadi, Ali Vakilian
2020FOCSTowards Better Approximation of Graph Crossing Number.Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan
2020ICMLIndividual Fairness for k-Clustering.Sepideh Mahabadi, Ali Vakilian
2020SODAComposable Core-sets for Determinant Maximization Problems via Spectral Spanners.Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei
2020STOCNon-adaptive adaptive sampling on turnstile streams.Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou
2019ICMLComposable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm.Sepideh Mahabadi, Piotr Indyk, Shayan Oveis Gharan, Alireza Rezaei
2018ICALPApproximate Sparse Linear Regression.Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi
2018SODASet Cover in Sub-linear Time.Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
2018STOCNonlinear dimension reduction via outer Bi-Lipschitz extensions.Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn
2017SODAProximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search.Sariel Har-Peled, Sepideh Mahabadi
2016PODSTowards Tight Bounds for the Streaming Set Cover Problem.Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
2015SODAApproximate Nearest Line Search in High Dimensions.Sepideh Mahabadi
2014PODSComposable core-sets for diversity and coverage maximization.Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni
2013WWWReal-time recommendation of diverse related articles.Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi