Ali Vakilian
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
28
Venues
10
Active years
2012–2026
Best venue rank
A*
Where they publish
Papers
28 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SODA | Sublinear Metric Steiner Forest via Maximal Independent Set. | Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian |
| 2026 | STOC | An Optimal Algorithm for Stochastic Vertex Cover. | Jan van den Brand, Inge Li Grtz, Chirag Pabbaraju, Debmalya Panigrahi, Clifford Stein, Miltiadis Stouras, Ola Svensson, Ali Vakilian |
| 2025 | ICALP | Guessing Efficiently for Constrained Subspace Approximation. | Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu, Ali Vakilian, David P. Woodruff |
| 2025 | ICALP | New and Improved Bounds for Markov Paging. | Chirag Pabbaraju, Ali Vakilian |
| 2024 | AISTATS | Learning-Based Algorithms for Graph Searching Problems. | Adela Frances DePavia, Erasmo Tani, Ali Vakilian |
| 2024 | AISTATS | Scalable Algorithms for Individual Preference Stable Clustering. | Ron Mosenzon, Ali Vakilian |
| 2024 | ICALP | Streaming Algorithms for Connectivity Augmentation. | Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian |
| 2023 | ICLR | Learning the Positions in CountSketch. | Yi Li, Honghao Lin, Simin Liu, Ali Vakilian, David P. Woodruff |
| 2023 | ICML | Sequential Strategic Screening. | Lee Cohen, Saeed Sharifi-Malvajerdi, Kevin Stangl, Ali Vakilian, Juba Ziani |
| 2023 | ICML | Approximation Algorithms for Fair Range Clustering. | Sdjro Salomon Hotegni, Sepideh Mahabadi, Ali Vakilian |
| 2022 | AISTATS | Improved Approximation Algorithms for Individually Fair Clustering. | Ali Vakilian, Mustafa Yaliner |
| 2022 | ICML | Individual Preference Stability for Clustering. | Saba Ahmadi, Pranjal Awasthi, Samir Khuller, Matthus Kleindessner, Jamie Morgenstern, Pattara Sukprasert, Ali Vakilian |
| 2022 | ICML | Faster Fundamental Graph Algorithms via Learned Predictions. | Justin Y. Chen, Sandeep Silwal, Ali Vakilian, Fred Zhang |
| 2022 | SODA | Approximating Fair Clustering with Cascaded Norm Objectives. | Eden Chlamtc, Yury Makarychev, Ali Vakilian |
| 2021 | COLT | Approximation Algorithms for Socially Fair Clustering. | Yury Makarychev, Ali Vakilian |
| 2021 | ICML | Learning Online Algorithms with Distributional Advice. | Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Ali Vakilian, Nikos Zarifis |
| 2020 | ICML | Individual Fairness for k-Clustering. | Sepideh Mahabadi, Ali Vakilian |
| 2020 | SODA | Improved Local Computation Algorithm for Set Cover via Sparsification. | Christoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian |
| 2019 | COLT | Sample-Optimal Low-Rank Approximation of Distance Matrices. | Piotr Indyk, Ali Vakilian, Tal Wagner, David P. Woodruff |
| 2019 | ESA | Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. | Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel |
| 2019 | ICLR | Learning-Based Frequency Estimation Algorithms. | Chen-Yu Hsu, Piotr Indyk, Dina Katabi, Ali Vakilian |
| 2019 | ICML | Scalable Fair Clustering. | Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner |
| 2019 | PODS | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model. | Piotr Indyk, Ali Vakilian |
| 2018 | SODA | Set Cover in Sub-linear Time. | Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee |
| 2016 | PODS | Towards Tight Bounds for the Streaming Set Cover Problem. | Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian |
| 2014 | SIGMOD | Which concepts are worth extracting? | Arash Termehchy, Ali Vakilian, Yodsawalai Chodpathumwan, Marianne Winslett |
| 2014 | STOC | Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements. | Alina Ene, Ali Vakilian |
| 2012 | ICALP | Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. | Chandra Chekuri, Alina Ene, Ali Vakilian |