Sublinear Metric Steiner Forest via Maximal Independent Set
Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
Symposium on Discrete Algorithms (SODA) | January 2026
Sepideh Mahabadi
Senior Researcher
论文与出版物
-
-
-
-
Improved Algorithms for Fair Matroid Submodular Maximization
Sepideh Mahabadi, Sherry Sarkar, Jakub Tarnawski
NeurIPS 2025 | December 2025
-
Streaming Algorithms for Network Design
Chandra Chekuri, Rhea Jain, Sepideh Mahabadi, Ali Vakilian
International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) | August 2025
-
A 0.51-Approximation of Maximum Matching in Sublinear n^1.5 Time
Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski
ICALP 2025 | July 2025
-
Graph-Based Algorithms for Diverse Similarity Search
Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, Sepideh Mahabadi, Vikas C. Raykar, Kiran Shiragur, Haike Xu
ICML 2025 | July 2025
-
Guessing Efficiently for Constrained Subspace Approximation
Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu, Ali Vakilian, David Woodruff
International Colloquium on Automata, Languages, and Programming (ICALP) | July 2025
-
Sublinear Metric Steiner Tree via Improved Bounds for Set Cover
Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
Innovations in Theoretical Computer Science (ITCS) | January 2025
-
-
-
Streaming Algorithms for Connectivity Augmentation
Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
International Colloquium on Automata, Languages, and Programming (ICALP) | July 2024
-
Efficiently Computing Similarities to Private Datasets
Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski
ICLR 2024 | May 2024
-
-
-
Composable Coresets for Determinant Maximization: Greedy is Almost Optimal
Siddharth Gollapudi, Sepideh Mahabadi, Varun Sivashankar
NeurIPS 2023 | December 2023
-
Core-sets for Fair and Diverse Data Summarization
Sepideh Mahabadi, Stojan Trajanovski
NeurIPS 2023 | December 2023
-
Differentially Private Approximate Near Neighbor Counting in High Dimensions
Alexandr Andoni, Piotr Indyk, Sepideh Mahabadi, Shyam Narayanan
NeurIPS 2023 | December 2023
Spotlight Presentation
-
Tight Bounds for Volumetric Spanners and Applications
Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian
NeurIPS 2023 | December 2023
-
Improved Diversity Maximization Algorithms for Matching and Pseudoforest
Sepideh Mahabadi, Shyam Narayanan
APPROX | September 2023
-
Approximation Algorithms for Fair Range Clustering
Sèdjro S. Hotegni, Sepideh Mahabadi, Ali Vakilian
ICML | July 2023
-
-
-
Composable Coresets for Constrained Determinant Maximization and Beyond
Sepideh Mahabadi, Thuy-Duong Vuong
November 2022
-
Adaptive Sketches for Robust Regression with Importance Sampling
Sepideh Mahabadi, David P. Woodruff, Samson Zhou
RANDOM | September 2022
-
Sampling Near Neighbors in Search for Fairness
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
Communications of the ACM (CACM) | August 2022
-
-
-
Sublinear Metric Steiner Forest via Maximal Independent Set
Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
Symposium on Discrete Algorithms (SODA) | January 2026
-
Improved Algorithms for Fair Matroid Submodular Maximization
Sepideh Mahabadi, Sherry Sarkar, Jakub Tarnawski
NeurIPS 2025 | December 2025
-
Streaming Algorithms for Network Design
Chandra Chekuri, Rhea Jain, Sepideh Mahabadi, Ali Vakilian
International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) | August 2025
-
A 0.51-Approximation of Maximum Matching in Sublinear n^1.5 Time
Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski
ICALP 2025 | July 2025
-
Graph-Based Algorithms for Diverse Similarity Search
Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, Sepideh Mahabadi, Vikas C. Raykar, Kiran Shiragur, Haike Xu
ICML 2025 | July 2025
-
Guessing Efficiently for Constrained Subspace Approximation
Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu, Ali Vakilian, David Woodruff
International Colloquium on Automata, Languages, and Programming (ICALP) | July 2025
-
Sublinear Metric Steiner Tree via Improved Bounds for Set Cover
Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
Innovations in Theoretical Computer Science (ITCS) | January 2025
-
Streaming Algorithms for Connectivity Augmentation
Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
International Colloquium on Automata, Languages, and Programming (ICALP) | July 2024
-
Efficiently Computing Similarities to Private Datasets
Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski
ICLR 2024 | May 2024
-
Differentially Private Approximate Near Neighbor Counting in High Dimensions
Alexandr Andoni, Piotr Indyk, Sepideh Mahabadi, Shyam Narayanan
NeurIPS 2023 | December 2023
Spotlight Presentation
-
Composable Coresets for Determinant Maximization: Greedy is Almost Optimal
Siddharth Gollapudi, Sepideh Mahabadi, Varun Sivashankar
NeurIPS 2023 | December 2023
-
Tight Bounds for Volumetric Spanners and Applications
Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian
NeurIPS 2023 | December 2023
-
Core-sets for Fair and Diverse Data Summarization
Sepideh Mahabadi, Stojan Trajanovski
NeurIPS 2023 | December 2023
-
Improved Diversity Maximization Algorithms for Matching and Pseudoforest
Sepideh Mahabadi, Shyam Narayanan
APPROX | September 2023
-
Approximation Algorithms for Fair Range Clustering
Sèdjro S. Hotegni, Sepideh Mahabadi, Ali Vakilian
ICML | July 2023
-
Composable Coresets for Constrained Determinant Maximization and Beyond
Sepideh Mahabadi, Thuy-Duong Vuong
November 2022
-
Adaptive Sketches for Robust Regression with Importance Sampling
Sepideh Mahabadi, David P. Woodruff, Samson Zhou
RANDOM | September 2022
-
Sampling Near Neighbors in Search for Fairness
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
Communications of the ACM (CACM) | August 2022
-
-
-
Improved Algorithms for Fair Matroid Submodular Maximization
Sepideh Mahabadi, Sherry Sarkar, Jakub Tarnawski
NeurIPS 2025 | December 2025
-
Differentially Private Approximate Near Neighbor Counting in High Dimensions
Alexandr Andoni, Piotr Indyk, Sepideh Mahabadi, Shyam Narayanan
NeurIPS 2023 | December 2023
Spotlight Presentation
-
Core-sets for Fair and Diverse Data Summarization
Sepideh Mahabadi, Stojan Trajanovski
NeurIPS 2023 | December 2023
-
-
-
Graph-Based Algorithms for Diverse Similarity Search
Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, Sepideh Mahabadi, Vikas C. Raykar, Kiran Shiragur, Haike Xu
ICML 2025 | July 2025
-
-
-
Streaming Algorithms for Connectivity Augmentation
Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
International Colloquium on Automata, Languages, and Programming (ICALP) | July 2024
-
-
-
Efficiently Computing Similarities to Private Datasets
Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski
ICLR 2024 | May 2024
-
Differentially Private Approximate Near Neighbor Counting in High Dimensions
Alexandr Andoni, Piotr Indyk, Sepideh Mahabadi, Shyam Narayanan
NeurIPS 2023 | December 2023
Spotlight Presentation
-
-
-
Sublinear Metric Steiner Forest via Maximal Independent Set
Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
Symposium on Discrete Algorithms (SODA) | January 2026
-
Improved Algorithms for Fair Matroid Submodular Maximization
Sepideh Mahabadi, Sherry Sarkar, Jakub Tarnawski
NeurIPS 2025 | December 2025
-
Streaming Algorithms for Network Design
Chandra Chekuri, Rhea Jain, Sepideh Mahabadi, Ali Vakilian
International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) | August 2025
-
A 0.51-Approximation of Maximum Matching in Sublinear n^1.5 Time
Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski
ICALP 2025 | July 2025
-
Graph-Based Algorithms for Diverse Similarity Search
Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, Sepideh Mahabadi, Vikas C. Raykar, Kiran Shiragur, Haike Xu
ICML 2025 | July 2025
-
Guessing Efficiently for Constrained Subspace Approximation
Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu, Ali Vakilian, David Woodruff
International Colloquium on Automata, Languages, and Programming (ICALP) | July 2025
-
Sublinear Metric Steiner Tree via Improved Bounds for Set Cover
Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
Innovations in Theoretical Computer Science (ITCS) | January 2025
-
Streaming Algorithms for Connectivity Augmentation
Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
International Colloquium on Automata, Languages, and Programming (ICALP) | July 2024
-
Efficiently Computing Similarities to Private Datasets
Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski
ICLR 2024 | May 2024
-
Differentially Private Approximate Near Neighbor Counting in High Dimensions
Alexandr Andoni, Piotr Indyk, Sepideh Mahabadi, Shyam Narayanan
NeurIPS 2023 | December 2023
Spotlight Presentation
-
Composable Coresets for Determinant Maximization: Greedy is Almost Optimal
Siddharth Gollapudi, Sepideh Mahabadi, Varun Sivashankar
NeurIPS 2023 | December 2023
-
Tight Bounds for Volumetric Spanners and Applications
Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian
NeurIPS 2023 | December 2023
-
Core-sets for Fair and Diverse Data Summarization
Sepideh Mahabadi, Stojan Trajanovski
NeurIPS 2023 | December 2023
-
Improved Diversity Maximization Algorithms for Matching and Pseudoforest
Sepideh Mahabadi, Shyam Narayanan
APPROX | September 2023
-
Approximation Algorithms for Fair Range Clustering
Sèdjro S. Hotegni, Sepideh Mahabadi, Ali Vakilian
ICML | July 2023
-
Adaptive Sketches for Robust Regression with Importance Sampling
Sepideh Mahabadi, David P. Woodruff, Samson Zhou
RANDOM | September 2022
-
-
-
Composable Coresets for Constrained Determinant Maximization and Beyond
Sepideh Mahabadi, Thuy-Duong Vuong
November 2022
-
-
-
Sampling Near Neighbors in Search for Fairness
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
Communications of the ACM (CACM) | August 2022
-