Set Cover in Sub-linear Time
Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee. SODA 2018.
Fractional Set Cover in the Streaming Model
Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan Ullman, Ali Vakilian, Anak Yodpinyanee. APPROX 2017.
Cost-Effective Conceptual Design Over Taxonomies
Ali Vakilian, Yodsawalai Chodpathumwan, Arash Termehchy, Amir Nayyeri. WebDB 2017.
Towards Tight Bounds for the Streaming Set Cover Problem
Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian. PODS 2016.
On Streaming and Communication Complexity of
The Set Cover Problem
Erik Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian. DISC 2014.
Which Concepts are Worth Extracting?
Arash Termehchy, Ali Vakilian, Yodsawalai Chodpathumwan, Marianne Winslett. SIGMOD 2014.
Improved Approximation Algorithms for Degree-bounded Network Design Problems
with Node Connectivity Requirements
Alina Ene, Ali Vakilian. STOC 2014.
Prize-collecting Survivable Network Design in Node-weighted Graphs
Chandra Chekuri, Alina Ene, Ali Vakilian. APPROX 2012.
Node-weighted Network Design in Planar and Minor-closed Families of Graphs
Chandra Chekuri, Alina Ene, Ali Vakilian. ICALP 2012.
This material is presented to ensure timely dissemination of scholarly and technical work.
Copyright and all rights therein are retained by authors or by other copyright holders.
All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.
In most cases, these works may not be reposted without the explicit permission of the copyright holder.