About me

• I am a postdoctoral fellow at University of Salzburg, working with Dr. Sebastian Forster. I completed my PhD at Johns Hopkins University, Computer Science Department, where I was advised by Dr. Mike Dinitz. I received my Master's degree from University of Calgary, under supervision of Dr. Philipp Woelfel and Dr. George Giakkoupis, and my undergraduate degree from Shiraz Univ of Technology, Iran.

Research Employment

• Software Engineering Internship at Google NYC, US. Summer 2020. Hosts: Dr. Creighton Thomas, Dr. Jakub Łącki
• Research Visiting Student at Simon Fraser University, Canada. Winter 2016, Host: Dr. Petra Berenbrink
• Research Internship at INRIA Rennes, France. Fall 2015. Host: Dr. George Giakkoupis

Research Interests

• Distributed and Parallel Algorithms
• Approximation Algorithms, Online Algorithms
• Graph Algorithms, Dynamic Graph Algorithms

Publications

(Authors are listed in alphabetic order:)
• Greg Bodwin, Michael Dinitz, Yasamin Nazari, Vertex Fault Tolerant Emulators,
  To appear in proceedings of 13th Conf. on Innovations in Theoretical Computer Science (ITCS 2022.)
• Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrović, Yasamin Nazari,
  Massively Parallel Algorithms for Distance Approximation and Spanners,
  In proceedings of 33rd Symp. on Parallelism in Algorithms and Architectures (SPAA 2021)
• Michael Dinitz, Yasamin Nazari, Zeyu Zhang, Lasserre Integrality Gaps for Graph Spanners and Related Problems,
  In proceedings of 18th Workshop on Approximation and Online Algorithms (WAOA 2020)
• Yasamin Nazari, Sparse Hopsets in Congested Clique,
  In proceedings of 23rd Conference on Principles of Distributed Systems (OPODIS 2019)
• Michael Dinitz and Yasamin Nazari, Massively Parallel Distance Sketches,
  In proceedings of 23rd Conference on Principles of Distributed Systems (OPODIS 2019), Best Student Paper Award.
• Michael Dinitz and Yasamin Nazari, Distributed Distance-Bounded Network Design Through Distributed Convex Programming,
  In proceedings of 21st International Conference on Principles of Distributed Systems (OPODIS 2017)
• George Giakkoupis, Yasamin Nazari, Philipp Woelfel, How Asynchrony Affects Rumor Spreading Time,
  In proceedings of 35th Symposium on Principles of Distributed Computing (PODC 2016)
• Jan van den Brand, Sebastian Forster, Yasamin Nazari , Fast Deterministic Fully Dynamic Distance Approximation, manuscript.
• Jakub Łącki, Yasamin Nazari, Near-Optimal Decremental Hopsets with Applications, manuscript.
• Melika Abolhassani, Hossein Esfandiari, Yasamin Nazari, Balasubramanian Sivan, Yifeng Teng, Creighton Thomas, Online Allocation and Display Ads Optimization with Surplus Supply, manuscript.
You can also view an updated list at my Google Scholar page

Teaching Assistant

• Spring 2020 (JHU):
  • Algorithmic Game Theory
• Spring 2019 (JHU):
  • Approximation Algorithms
• Fall 2018, Fall 2017 and Fall 2020 (JHU):
  • Intro to Algorithms
• Winter 2015 (U Calgary):
  • CPSC 513: Computability
• Fall 2014 (U Calgary):
  • CPSC 511: Introduction To Complexity Theory
• Winter 2014 (U Calgary):
  • CPSC 413: Design and Analysis of Algorithms I

Service

• External reviewer: DISC 2021, SPAA 2021, STOC 2021, SODA 2021, SODA 2020, SPAA 2019, APPROX 2019, OPODIS 2018