Ali Vakilian
I am a PhD student in Theory of Computation group, CSAIL, at MIT and I am fortunate to have Erik Demaine and Piotr Indyk as my advisors.
Prior to my PhD studies at MIT, I was lucky to be advised by Chandra Chekuri during my master's studies at UIUC. I received my bachelor's degree in Computer Engineering from Sharif University of Technology.
Research Interests:
  • Streaming/Sketching Algorithms
  • Approximation Algorithms and Combinatorial Optimization
  • Graph Theory and Combinatorics

CV [Last update: November 2017]

Email: vakilian[at]mit[dot]edu
Conference Papers
Journal Papers
Honors and Awards
  • Set Cover in Sub-linear Time. SODA 2018. Slides
  • Fractional Set Cover in the Streaming Model. APPROX 2017. Slides
    Northeastern University Theory Lunch, October 2017. Slides
  • Towards Tight Bounds for the Streaming Set Cover Problem. PODS 2016. Slides
    TTI at Chicago, June 2017.
  • On Streaming and Communication Complexity of The Set Cover Problem. DISC 2014. Slides
  • Improved Approximation Algorithms for Degree-bounded Network Design Problems with Node Connectivity Requirements. STOC 2014. Slides
  • Improved Approximation Algorithm for Min-Cost k-connected Spanning Subgraph Problem. UIUC Theory Seminar, February 2013.
  • Prize-collecting Survivable Network Design in Node-weighted Graphs. APPROX 2012. Slides
    UIUC Theory Seminar, September 2012. Slides
  • Node-weighted Network Design in Planar and Minor-closed Families of Graphs. UIUC Theory Seminar, February 2012. Slides
Copyright Notice
    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.