alphaFeedback
AV
cs.DScs.LGcs.AIstat.MLcs.DMcs.CYcs.GTcs.CCcs.CGcs.DB

On Valency

published · living versions
W_tqmdmzu3·v1 · currentpublished
Bourgain's Theorem for a Union of Euclidean Metric Spaces
with Dimitar Chakarov, Sepideh Mahabadi, Yury Makarychev
1 version
W_gqr7y4r5·v1published

Preprints & journals

47 papers in the corpus · 2013–2026
Learning-Augmented Streaming Algorithms for Approximating Boolean Max-CSPs2610.19460v1 · Yinhao Dong, Pan Peng, Ali Vakilian et al.2026 · 0 citationsarXiv
A Configuration-LP Framework for Connected kk-Median Clustering2608.28081v1 · Kushagra Chatterjee, Rojin Rezvan, Ali Vakilian2026 · 13 citationsarXivon Valency
Learning with Conflicts of Interest2605.15504v1 · Nischal Aryal, Arash Termehchy, Ali Vakilian et al.2026 · 0 citationsarXiv
An Optimal Algorithm for Stochastic Vertex Cover2603.27795v1 · Jan van den Brand, Inge Li G\ortz, Chirag Pabbaraju et al.2026 · 0 citationsarXiv
Graph-Based Nearest-Neighbor Search without the Spread2602.06633v1 · Jeff Giliberti, Sariel Har-Peled Jonas Sauer, Ali Vakilian2026 · 0 citationsarXiv
Sublinear Metric Steiner Forest via Maximal Independent Set2510.11627v1 · Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski et al.2025 · 0 citationsarXiv
Max-Cut with Multiple Cardinality Constraints2507.12607v1 · Yury Makarychev, Madhusudhan Reddy Pittu, Ali Vakilian2025 · 0 citationsarXiv
Guessing Efficiently for Constrained Subspace Approximation2504.20883v1 · Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu et al.2025 · 0 citationsarXiv
Streaming Algorithms for Network Design2503.00712v2 · Chandra Chekuri, Rhea Jain, Sepideh Mahabadi et al.2025 · 0 citationsarXiv
New and Improved Bounds for Markov Paging2502.05511v2 · Chirag Pabbaraju, Ali Vakilian2025 · 0 citationsarXiv
Learning-Augmented Streaming Algorithms for Approximating MAX-CUT2412.09773v2 · Yinhao Dong, Pan Peng, Ali Vakilian2024 · 0 citationsarXiv
On Socially Fair Low-Rank Approximation and Column Subset Selection2412.06063v1 · Zhao Song, Ali Vakilian, David P. Woodruff et al.2024 · 0 citationsarXiv
Sublinear Metric Steiner Tree via Improved Bounds for Set Cover2411.09059v1 · Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski et al.2024 · 0 citationsarXiv
Minimax Group Fairness in Strategic Classification2410.02513v1 · Emily Diana, Saeed Sharifi-Malvajerdi, Ali Vakilian2024 · 1 citationarXiv
A Polynomial-Time Approximation for Pairwise Fair kk-Median Clustering2405.10378v2 · Sayan Bandyapadhyay, Eden Chlamt'ac, Zachary Friggstad et al.2024 · 0 citationsarXiv
Scalable Algorithms for Individual Preference Stable Clustering2403.10365v1 · Ron Mosenzon, Ali Vakilian2024 · 0 citationsarXiv
Learning-Based Algorithms for Graph Searching Problems2402.17736v2 · Adela Frances DePavia, Erasmo Tani, Ali Vakilian2024 · 0 citationsarXiv
Streaming Algorithms for Connectivity Augmentation2402.10806v1 · Ce Jin, Michael Kapralov, Sepideh Mahabadi et al.2024 · 0 citationsarXiv
Bayesian Strategic Classification2402.08758v1 · Lee Cohen, Saeed Sharifi-Malvajerdi, Kevin Stangl et al.2024 · 4 citationsarXiv
Improved Frequency Estimation Algorithms with and without Predictions2312.07535v1 · Anders Aamand, Justin Y. Chen, Huy Le Nguyen et al.2023 · 5 citationsarXiv
Tight Bounds for Volumetric Spanners and Applications2310.00175v1 · Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian2023 · 1 citationarXiv
Constant Approximation for Individual Preference Stable Clustering2309.16840v1 · Anders Aamand, Justin Y. Chen, Allen Liu et al.2023 · 0 citationsarXiv
Learning the Positions in CountSketch2306.06611v2 · Yi Li, Honghao Lin, Simin Liu et al.2023 · 0 citationsarXiv
Approximation Algorithms for Fair Range Clustering2306.06778v2 · Sedjro S. Hotegni, Sepideh Mahabadi, Ali Vakilian2023 · 6 citationsarXiv
Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment2302.00213v2 · Eden Chlamt'ac, Yury Makarychev, Ali Vakilian2023 · 0 citationsarXiv
Sequential Strategic Screening2301.13397v2 · Lee Cohen, Saeed Sharifi-Malvajerdi, Kevin Stangl et al.2023 · 0 citationsarXiv
Individual Preference Stability for Clustering2207.03600v1 · Saba Ahmadi, Pranjal Awasthi, Samir Khuller et al.2022 · 2 citationsarXiv
Faster Fundamental Graph Algorithms via Learned Predictions2204.12055v1 · Justin Y. Chen, Sandeep Silwal, Ali Vakilian et al.2022 · 6 citationsarXiv
Fair Representation Clustering with Several Protected Classes2202.01391v1 · Zhen Dai, Yury Makarychev, Ali Vakilian2022 · 3 citationsarXiv
Approximating Fair Clustering with Cascaded Norm Objectives2111.04804v1 · Eden Chlamt'ac, Yury Makarychev, Ali Vakilian2021 · 15 citationsarXiv
Improved Approximation Algorithms for Individually Fair Clustering2106.14043v2 · Ali Vakilian, Mustafa Yalc\iner2021 · 9 citationsarXiv
Approximation Algorithms for Socially Fair Clustering2103.02512v2 · Yury Makarychev, Ali Vakilian2021 · 13 citationsarXiv
Learning the Positions in CountSketch2007.09890v3 · Simin Liu, Tianrui Liu, Ali Vakilian et al.2020 · 1 citationarXiv
Individual Fairness for kk-Clustering2002.06742v2 · Sepideh Mahabadi, Ali Vakilian2020 · 34 citationsarXiv
Learning-Based Low-Rank Approximations1910.13984v1 · Piotr Indyk, Ali Vakilian, Yang Yuan2019 · 32 citationsarXiv
Improved Local Computation Algorithm for Set Cover via Sparsification1910.14154v2 · Christoph Grunau, Slobodan Mitrovi'c, Ronitt Rubinfeld et al.2019 · 9 citationsarXiv
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs1910.07616v1 · Chandra Chekuri, Alina Ene, Ali Vakilian2019 · 12 citationsarXiv
(Learned) Frequency Estimation Algorithms under Zipfian Distribution1908.05198v2 · Anders Aamand, Piotr Indyk, Ali Vakilian2019 · 14 citationsarXiv
Sample-Optimal Low-Rank Approximation of Distance Matrices1906.00339v1 · Piotr Indyk, Ali Vakilian, Tal Wagner et al.2019 · 19 citationsarXiv
Local Computation Algorithms for Spanners1902.08266v1 · Merav Parter, Ronitt Rubinfeld, Ali Vakilian et al.2019 · 8 citationsarXiv
Scalable Fair Clustering1902.03519v2 · Arturs Backurs, Piotr Indyk, Krzysztof Onak et al.2019 · 101 citationsarXivon Valency
Set Cover in Sub-linear Time1902.03534v1 · Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld et al.2019 · 9 citationsarXiv
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class1806.02771v3 · Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster et al.2018 · 9 citationsarXiv
Towards Tight Bounds for the Streaming Set Cover Problem1509.00118v2 · Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi et al.2015 · 31 citationsarXiv
Cost-Effective Conceptual Design Using Taxonomies1503.05656v2 · Ali Vakilian, Yodsawalai Chodpathumwan, Arash Termehchy et al.2015 · 2 citationsarXiv
Connected Domatic Packings in Node-capacitated Graphs1305.4308v2 · Alina Ene, Nitish Korula, Ali Vakilian2013 · 2 citationsarXiv
Career total: 67 works. 47 are in this corpus.

Profile built from the corpus for this byline.

Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.