Ali Vakilian

Publications Honors and Awards Talks
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
Manuscripts Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class Erik Demaine, Timothy Goodrich, Kyle Kloster, Brian Lavallee, Quanquan Liu, Blair Sullivan, Ali Vakilian, Andrew van der Poel. October 2018. Connected Domatic Packing in Node-capacitated Graphs Alina Ene, Nitish Korula, Ali Vakilian. July 2013. Conference Papers Local Computation Algorithms for Spanners Merav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee. ITCS 2019. 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. Journal Papers Cost-Effective Database Design For Information Extraction Applications Arash Termehchy, Ali Vakilian, Yodsawalai Chodpathumwan, Marianne Winslett. ACM Transactions on Database Systems (TODS). Thesis Node-weighted Prize-collecting Survivable Network Design Problems Master's thesis, Department of Computer Science, UIUC, 2013. Publication Profiles Google Scholar Profile DBLP Profile
Honors and Awards Siebel Scholar, Class of 2013. Awarded annually for academic excellence and demonstrated leadership to 85 top students from world's leading graduate schools (Siebel Scholar is the largest award offered by the College of Engineering at UIUC). Awarded Outstanding Student certificate and prize by the president of Sharif University. Recipient of the Grant for Undergraduate Studies from the Iranian National Foundation of Elites, awarded to selected members, 2009-2011. Ranked 38th in the annual nationwide entrance exam over more than 300,000 participants, May 2007.
Talks 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.