minad at mit dot edu
Mina Dalirrooyfard
I work as a research scientist in the Machine Learning research group at Morgan Stanley. I graduated from MIT on March 2022 where I was a Ph.D student in computer science at the Theory of Computation (TOC) group at CSAIL, MIT. I was very fortunate to have Virginia Vassilevska Williams as my advisor. Prior to MIT, I double-majored in computer engineering and mathematics at Sharif University of Technology, where I received my bachelor degrees from 2012 to 2017.
My research interests are mainly in graph algorithms, fined grained complexity and combinatorial optimization.
Publications
- Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles
with Ce Jin, Virginia Vassilevska Williams and Nicole Wein, FOCS 2022 - Induced Cycles and Paths Are Harder Than You Think
with Virginia Vassilevska Williams, FOCS 2022 - Hardness of Approximate Diameter: Now for Undirected Graphs
with Ray Li and Virginia Vassilevska Williams, FOCS 2021 - Tight conditional lower bounds for approximating diameter in directed graphs
with Nicole Wein, STOC 2021 - Approximation Algorithms for Min-Distance Problems in DAGs
with Jenny Kaufmann, ICALP 2021 - New Techniques for Proving Fine-Grained Average-Case Hardness
with Andrea Lincoln and Virginia Vassilevska Williams, FOCS 2020 - Conditionally optimal approximation algorithms for the girth of a directed graph
with Virginia Vassilevska Williams, ICALP 2020 - Graph pattern detection: hardness for all induced patterns and faster non-induced cycles
with Thuy Duong Vuong and Virginia Vassilevska Williams, STOC 2019 - Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems
with Virginia Vassilevska Williams, Nikhil Vyas and Nicole Wein, ICALP 2019 - Approximation Algorithms for Min-Distance Problems
with Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu and Yuancheng Yu, ICALP 2019 - Orientations of graphs avoiding given lists on outdegrees
with Saieed Akbari, Kiana Ehsani, Kento Ozeki and Rezvan Sherkati, Journal of Graph Theory 2019 - A Dynamics for Advertising onNetworks
with Elisa L. Celis and Nisheeth K. Vishnoi, WINE 2017 - A Note on Signed k-Submatching in Graphs
with Saieed Akbari, Rezvan Sherkati and Kiana Ehsani, Australasian Journal of Combinatorics 2016
other
I was part of the MIT rowing club.