Ali Vakilian

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 63

Top Topics

Conceptual Design

Approximation Algorithms

Top Venues

Publications

Adela Frances DePavia, Erasmo Tani, Ali Vakilian
Learning-Based Algorithms for Graph Searching Problems. CoRR (2024)
Lee Cohen, Saeed Sharifi-Malvajerdi, Kevin Stangl, Ali Vakilian, Juba Ziani
Bayesian Strategic Classification. CoRR (2024)
Ron Mosenzon, Ali Vakilian
Scalable Algorithms for Individual Preference Stable Clustering. AISTATS (2024)
Adela Frances DePavia, Erasmo Tani, Ali Vakilian
Learning-Based Algorithms for Graph Searching Problems. AISTATS (2024)
Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
Streaming Algorithms for Connectivity Augmentation. CoRR (2024)
Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
Streaming Algorithms for Connectivity Augmentation. ICALP (2024)
Ron Mosenzon, Ali Vakilian
Scalable Algorithms for Individual Preference Stable Clustering. CoRR (2024)
Sayan Bandyapadhyay, Eden Chlamtác, Yury Makarychev, Ali Vakilian
A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering. CoRR (2024)
Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian
Tight Bounds for Volumetric Spanners and Applications. CoRR (2023)
Anders Aamand, Justin Y. Chen, Allen Liu, Sandeep Silwal, Pattara Sukprasert, Ali Vakilian, Fred Zhang
Constant Approximation for Individual Preference Stable Clustering. CoRR (2023)
Anders Aamand, Justin Y. Chen, Huy Lê Nguyen, Sandeep Silwal, Ali Vakilian
Improved Frequency Estimation Algorithms with and without Predictions. CoRR (2023)
Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian
Tight Bounds for Volumetric Spanners and Applications. NeurIPS (2023)
Eden Chlamtác, Yury Makarychev, Ali Vakilian
Approximating Red-Blue Set Cover. CoRR (2023)
Lee Cohen, Saeed Sharifi-Malvajerdi, Kevin Stangl, Ali Vakilian, Juba Ziani
Sequential Strategic Screening. CoRR (2023)
Lee Cohen, Saeed Sharifi-Malvajerdi, Kevin Stangl, Ali Vakilian, Juba Ziani
Sequential Strategic Screening. ICML (2023)
Sèdjro Salomon Hotegni, Sepideh Mahabadi, Ali Vakilian
Approximation Algorithms for Fair Range Clustering. ICML (2023)
Yi Li, Honghao Lin, Simin Liu, Ali Vakilian, David P. Woodruff
Learning the Positions in CountSketch. CoRR (2023)
Sèdjro S. Hotegni, Sepideh Mahabadi, Ali Vakilian
Approximation Algorithms for Fair Range Clustering. CoRR (2023)
Eden Chlamtác, Yury Makarychev, Ali Vakilian
Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment. APPROX/RANDOM (2023)
Anders Aamand, Justin Y. Chen, Huy Lê Nguyen, Sandeep Silwal, Ali Vakilian
Improved Frequency Estimation Algorithms with and without Predictions. NeurIPS (2023)
Anders Aamand, Justin Y. Chen, Allen Liu, Sandeep Silwal, Pattara Sukprasert, Ali Vakilian, Fred Zhang
Constant Approximation for Individual Preference Stable Clustering. NeurIPS (2023)
Yi Li, Honghao Lin, Simin Liu, Ali Vakilian, David P. Woodruff
Learning the Positions in CountSketch. ICLR (2023)
Zhen Dai, Yury Makarychev, Ali Vakilian
Fair Representation Clustering with Several Protected Classes. FAccT (2022)
Eden Chlamtác, Yury Makarychev, Ali Vakilian
Approximating Fair Clustering with Cascaded Norm Objectives. SODA (2022)
Justin Y. Chen, Sandeep Silwal, Ali Vakilian, Fred Zhang
Faster Fundamental Graph Algorithms via Learned Predictions. CoRR (2022)
Avrim Blum, Kevin Stangl, Ali Vakilian
Multi Stage Screening: Enforcing Fairness and Maximizing Efficiency in a Pre-Existing Pipeline. FAccT (2022)
Avrim Blum, Kevin Stangl, Ali Vakilian
Multi Stage Screening: Enforcing Fairness and Maximizing Efficiency in a Pre-Existing Pipeline. CoRR (2022)
Saba Ahmadi, Pranjal Awasthi, Samir Khuller, Matthäus Kleindessner, Jamie Morgenstern, Pattara Sukprasert, Ali Vakilian
Individual Preference Stability for Clustering. CoRR (2022)
Justin Y. Chen, Sandeep Silwal, Ali Vakilian, Fred Zhang
Faster Fundamental Graph Algorithms via Learned Predictions. ICML (2022)
Zhen Dai, Yury Makarychev, Ali Vakilian
Fair Representation Clustering with Several Protected Classes. CoRR (2022)
Ali Vakilian, Mustafa Yalçiner
Improved Approximation Algorithms for Individually Fair Clustering. AISTATS (2022)
Saba Ahmadi, Pranjal Awasthi, Samir Khuller, Matthäus Kleindessner, Jamie Morgenstern, Pattara Sukprasert, Ali Vakilian
Individual Preference Stability for Clustering. ICML (2022)
Ali Vakilian, Mustafa Yalçiner
Improved Approximation Algorithms for Individually Fair Clustering. CoRR (2021)
Yury Makarychev, Ali Vakilian
Approximation Algorithms for Socially Fair Clustering. CoRR (2021)
Eden Chlamtác, Yury Makarychev, Ali Vakilian
Approximating Fair Clustering with Cascaded Norm Objectives. CoRR (2021)
Yury Makarychev, Ali Vakilian
Approximation Algorithms for Socially Fair Clustering. COLT (2021)
Chandra Chekuri, Alina Ene, Ali Vakilian
Node-weighted Network Design in Planar and Minor-closed Families of Graphs. ACM Trans. Algorithms 17 (2) (2021)
Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Ali Vakilian, Nikos Zarifis
Learning Online Algorithms with Distributional Advice. ICML (2021)
Christoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian
Improved Local Computation Algorithm for Set Cover via Sparsification. SODA (2020)
Sepideh Mahabadi, Ali Vakilian
(Individual) Fairness for k-Clustering. CoRR (2020)
Sepideh Mahabadi, Ali Vakilian
Individual Fairness for k-Clustering. ICML (2020)
Simin Liu, Tianrui Liu, Ali Vakilian, Yulin Wan, David P. Woodruff
On Learned Sketches for Randomized Numerical Linear Algebra. CoRR (2020)
Chen-Yu Hsu, Piotr Indyk, Dina Katabi, Ali Vakilian
Learning-Based Frequency Estimation Algorithms. ICLR (Poster) (2019)
Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. ESA (2019)
Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner
Scalable Fair Clustering. CoRR (2019)
Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner
Scalable Fair Clustering. ICML (2019)
Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
Set Cover in Sub-linear Time. CoRR (2019)
Piotr Indyk, Ali Vakilian
Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model. PODS (2019)
Piotr Indyk, Ali Vakilian, Tal Wagner, David P. Woodruff
Sample-Optimal Low-Rank Approximation of Distance Matrices. COLT (2019)
Piotr Indyk, Ali Vakilian, Yang Yuan
Learning-Based Low-Rank Approximations. NeurIPS (2019)
Merav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
Local Computation Algorithms for Spanners. ITCS (2019)
Merav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
Local Computation Algorithms for Spanners. CoRR (2019)
Anders Aamand, Piotr Indyk, Ali Vakilian
(Learned) Frequency Estimation Algorithms under Zipfian Distribution. CoRR (2019)
Piotr Indyk, Ali Vakilian, Tal Wagner, David P. Woodruff
Sample-Optimal Low-Rank Approximation of Distance Matrices. CoRR (2019)
Piotr Indyk, Ali Vakilian, Yang Yuan
Learning-Based Low-Rank Approximations. CoRR (2019)
Christoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian
Improved Local Computation Algorithm for Set Cover via Sparsification. CoRR (2019)
Chandra Chekuri, Alina Ene, Ali Vakilian
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. CoRR (2019)
Yodsawalai Chodpathumwan, Ali Vakilian, Arash Termehchy, Amir Nayyeri
Cost-effective conceptual design using taxonomies. VLDB J. 27 (3) (2018)
Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. CoRR (2018)
Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
Set Cover in Sub-linear Time. SODA (2018)
Ali Vakilian, Yodsawalai Chodpathumwan, Arash Termehchy, Amir Nayyeri
Cost-Effective Conceptual Design Over Taxonomies. WebDB (2017)
Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan R. Ullman, Ali Vakilian, Anak Yodpinyanee
Fractional Set Cover in the Streaming Model. APPROX-RANDOM (2017)
Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
Towards Tight Bounds for the Streaming Set Cover Problem. PODS (2016)
Arash Termehchy, Ali Vakilian, Yodsawalai Chodpathumwan, Marianne Winslett
Cost-Effective Conceptual Design for Information Extraction. ACM Trans. Database Syst. 40 (2) (2015)
Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
Towards Tight Bounds for the Streaming Set Cover Problem. CoRR (2015)
Ali Vakilian, Yodsawalai Chodpathumwan, Arash Termehchy, Amir Nayyeri
Cost-Effective Conceptual Design Using Taxonomies. CoRR (2015)
Arash Termehchy, Ali Vakilian, Yodsawalai Chodpathumwan, Marianne Winslett
Which concepts are worth extracting? SIGMOD Conference (2014)
Alina Ene, Ali Vakilian
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements. STOC (2014)
Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
On Streaming and Communication Complexity of the Set Cover Problem. DISC (2014)
Alina Ene, Nitish Korula, Ali Vakilian
Improved Approximation Algorithms for Connected Domatic Partitions and Related Problems CoRR (2013)
Chandra Chekuri, Alina Ene, Ali Vakilian
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. ICALP (1) (2012)
Chandra Chekuri, Alina Ene, Ali Vakilian
Prize-Collecting Survivable Network Design in Node-Weighted Graphs. APPROX-RANDOM (2012)