Scholar
Mina Dalirrooyfard
Google Scholar ID: vatvqfAAAAAJ
Researcher at Morgan Stanley
Citations & Impact
Citations
274
H-index
10
i10-index
11
Publications
20
Co-authors
8
list available
Contact
No contact links provided.
Publications
Resume (English only)
Academic Achievements
- [{'Paper': 'Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles', 'Collaborators': 'Ce Jin, Virginia Vassilevska Williams, Nicole Wein', 'Conference': 'FOCS 2022'}, {'Paper': 'Induced Cycles and Paths Are Harder Than You Think', 'Collaborators': 'Virginia Vassilevska Williams', 'Conference': 'FOCS 2022'}, {'Paper': 'Hardness of Approximate Diameter: Now for Undirected Graphs', 'Collaborators': 'Ray Li, Virginia Vassilevska Williams', 'Conference': 'FOCS 2021'}, {'Paper': 'Tight conditional lower bounds for approximating diameter in directed graphs', 'Collaborators': 'Nicole Wein', 'Conference': 'STOC 2021'}, {'Paper': 'Approximation Algorithms for Min-Distance Problems in DAGs', 'Collaborators': 'Jenny Kaufmann', 'Conference': 'ICALP 2021'}, {'Paper': 'New Techniques for Proving Fine-Grained Average-Case Hardness', 'Collaborators': 'Andrea Lincoln, Virginia Vassilevska Williams', 'Conference': 'FOCS 2020'}, {'Paper': 'Conditionally optimal approximation algorithms for the girth of a directed graph', 'Collaborators': 'Virginia Vassilevska Williams', 'Conference': 'ICALP 2020'}, {'Paper': 'Graph pattern detection: hardness for all induced patterns and faster non-induced cycles', 'Collaborators': 'Thuy Duong Vuong, Virginia Vassilevska Williams', 'Conference': 'STOC 2019'}, {'Paper': 'Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems', 'Collaborators': 'Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein', 'Conference': 'ICALP 2019'}, {'Paper': 'Approximation Algorithms for Min-Distance Problems', 'Collaborators': 'Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu', 'Conference': 'ICALP 2019'}, {'Paper': 'Orientations of graphs avoiding given lists on outdegrees', 'Collaborators': 'Saieed Akbari, Kiana Ehsani, Kento Ozeki, Rezvan Sherkati', 'Journal': 'Journal of Graph Theory 2019'}, {'Paper': 'A Dynamics for Advertising on Networks', 'Collaborators': 'Elisa L. Celis, Nisheeth K. Vishnoi', 'Conference': 'WINE 2017'}, {'Paper': 'A Note on Signed k-Submatching in Graphs', 'Collaborators': 'Saieed Akbari, Rezvan Sherkati, Kiana Ehsani', 'Journal': 'Australasian Journal of Combinatorics 2016'}]
Background
- Research Interests: Graph algorithms, fine-grained complexity, and combinatorial optimization. Field: Computer Science.
Miscellany
- Was part of the MIT Rowing Club
