Soroush Alamdari

My research interest ranges from design of exact and approximate algorithms for combinatorial problems to developement of practical optimization systems for real world challenges. I have developed novel algorithms for Scheduling, Path Planning, Clustering, and Graph Drawing problems. Curretnly I am developing a system for scheduling final exams at Cornell University. Our current prototype is able to schedule the exams in a shorter period and with no conflicts, vastly outperforming the methods employed by the leading scheduling firms.
Here you can find my CV.

Publications

• Drives that Make Small Worlds.
  Submitted to ACM-SIAM Symposium on Discrete Algorithms (SODA 2018).
• A Bicriteria Approximation Algorithm for the k-center and k-median Problems.
  Joint work with David Shmoys,
  Workshop on Approximation and Online Algorithms (WAOA 2017).
• Smart-grid Electricity Allocation via Strip Packing with Slicing.
  Joint work with Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav, Anna Lubiw and Vinayak Pathak,
  Algorithms and Data Structures Symposium (WADS 2013).
• Morphing Planar Graph Drawings with a Polynomial Number of Steps.
  Joint work with Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, and Bryan T. Wilkinson,
  ACM-SIAM Symposium on Discrete Algorithms (SODA 2013).
• Self-Approaching Graphs.
  Joint work with Timothy Chan, Elyot Grant, Anna Lubiw, and Vinayak Pathak,
  International Symposium on Graph Drawing (GD 2012).
• Open Rectangle-of-Influence Drawings of Non-Triangulated Planar Graphs.
  Joint work with Therese Biedl,
  International Symposium on Graph Drawing (GD 2012).
• Persistent Monitoring in Discrete Environments: Minimizing the Maximum Weighted Latency Between Observations.
  Joint work with Elaheh Fata and Stephen L. Smith,
  International Journal of Robotics Research (IJRR).
• On a DAG Partitioning Problem.
  Joint work with Abbas Mehrabian,
  Workshop on Algorithms and Models for the Web Graph (WAW 2012).
• Planar Open Rectangle-of-Influence Drawings with Non-Aligned Frames.
  Joint work with Therese Biedl,
  International Symposium on Graph Drawing (GD 2011).