All Stories

  1. Multi Stage Screening: Enforcing Fairness and Maximizing Efficiency in a Pre-Existing Pipeline

    Article • June 2022, ACM (Association for Computing Machinery)

    Ali Vakilian

  2. Fair Representation Clustering with Several Protected Classes

    Article • June 2022, ACM (Association for Computing Machinery)

    Ali Vakilian, Zhen Dai

  3. Approximating Fair Clustering with Cascaded Norm Objectives

    Article • January 2022, Society for Industrial & Applied Mathematics (SIAM)

    Ali Vakilian

  4. Node-weighted Network Design in Planar and Minor-closed Families of Graphs

    Article • ACM Transactions on Algorithms, June 2021, ACM (Association for Computing Machinery)

    Ali Vakilian

  5. Improved Local Computation Algorithm for Set Cover via Sparsification

    Article • January 2020, Society for Industrial & Applied Mathematics (SIAM)

    Ali Vakilian

  6. Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model

    Article • June 2019, ACM (Association for Computing Machinery)

    Ali Vakilian

  7. Cost-effective conceptual design using taxonomies

    Article • The VLDB Journal, March 2018, Springer Science + Business Media

    Ali Vakilian

  8. Set Cover in Sub-linear Time

    Article • January 2018, Society for Industrial & Applied Mathematics (SIAM)

    Ali Vakilian

  9. Cost-Effective Conceptual Design Over Taxonomies

    Article • May 2017, ACM (Association for Computing Machinery)

    Ali Vakilian

  10. Towards Tight Bounds for the Streaming Set Cover Problem

    Article • June 2016, ACM (Association for Computing Machinery)

    Ali Vakilian

  11. Cost-Effective Conceptual Design for Information Extraction

    Article • ACM Transactions on Database Systems, June 2015, ACM (Association for Computing Machinery)

    Ali Vakilian

  12. Which concepts are worth extracting?

    Article • June 2014, ACM (Association for Computing Machinery)

    Ali Vakilian

  13. Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements

    Article • May 2014, ACM (Association for Computing Machinery)

    Ali Vakilian

  14. On Streaming and Communication Complexity of the Set Cover Problem

    Article • January 2014, Springer Science + Business Media

    Ali Vakilian

  15. Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs

    Article • January 2012, Springer Science + Business Media

    Ali Vakilian

  16. Prize-Collecting Survivable Network Design in Node-Weighted Graphs

    Article • January 2012, Springer Science + Business Media

    Ali Vakilian