| Graph pattern detection: Hardness for all induced patterns and faster non-induced cycles M Dalirrooyfard, TD Vuong, VV Williams Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 27 | 2019 |
| New techniques for proving fine-grained average-case hardness M Dalirrooyfard, A Lincoln, VV Williams 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 20 | 2020 |
| Hardness of approximate diameter: Now for undirected graphs M Dalirrooyfard, R Li, VV Williams 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 13 | 2022 |
| Tight conditional lower bounds for approximating diameter in directed graphs M Dalirrooyfard, N Wein Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 13 | 2021 |
| Tight approximation algorithms for bichromatic graph diameter and related problems M Dalirrooyfard, VV Williams, N Vyas, N Wein arXiv preprint arXiv:1904.11601, 2019 | 10 | 2019 |
| Approximation algorithms for min-distance problems M Dalirrooyfard, VV Williams, N Vyas, N Wein, Y Xu, Y Yu arXiv preprint arXiv:1904.11606, 2019 | 9 | 2019 |
| Distributed distance approximation B Ancona, K Censor-Hillel, M Dalirrooyfard, Y Efron, VV Williams arXiv preprint arXiv:2011.05066, 2020 | 7 | 2020 |
| Conditionally optimal approximation algorithms for the girth of a directed graph M Dalirrooyfard, VV Williams arXiv preprint arXiv:2004.11445, 2020 | 6 | 2020 |
| Orientations of graphs avoiding given lists on out‐degrees S Akbari, M Dalirrooyfard, K Ehsani, K Ozeki, R Sherkati Journal of Graph Theory 93 (4), 483-502, 2020 | 5 | 2020 |
| Approximation algorithms and hardness for n-pairs shortest paths and all-nodes shortest cycles M Dalirrooyfard, C Jin, VV Williams, N Wein 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 3 | 2022 |
| Induced cycles and paths are harder than you think M Dalirrooyfard, VV Williams 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 3 | 2022 |
| Approximation algorithms for min-distance problems in dags M Dalirrooyfard, J Kaufmann arXiv preprint arXiv:2106.02120, 2021 | 3 | 2021 |
| A New Conjecture on Hardness of 2-CSP’s with Implications to Hardness of Densest k-Subgraph and Other Problems J Chuzhoy, M Dalirrooyfard, V Grinberg, Z Tan 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 2023 | | 2023 |
| Finding Patterns, Short Cycles and Long Shortest Paths in Graphs M Dalirrooyfard Massachusetts Institute of Technology, 2022 | | 2022 |
| Approximation algorithms for min-distance problems VV Williams, N Wein, M Dalirrooyfard, N Vyas, Y Xu, Y Yu | | 2019 |
| A Dynamics for Advertising on Networks LE Celis, M Dalirrooyfard, NK Vishnoi Web and Internet Economics: 13th International Conference, WINE 2017 …, 2017 | | 2017 |
| A Note on Signed k-Submatching in Graphs S Akbari, M Dalirrooyfard, K Ehsani, R Sherkati arXiv preprint arXiv:1411.0132, 2014 | | 2014 |
| On the Decision Number of Graphs S Akbari, M Dalirrooyfard, S Davodpoor, K Ehsani, R Sherkati arXiv preprint arXiv:1402.0134, 2014 | | 2014 |
| 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)| 978-1-6654-5519-0/22/$31.00© 2022 IEEE| DOI: 10.1109/FOCS54457. 2022.00116 A Abboud, X Allamigeon, N Anari, M Anastos, A Andoni, R Andrews, ... | | |
| 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)| 978-1-7281-9621-3/20/$31.00© 2020 IEEE| DOI: 10.1109/FOCS46700. 2020.00135 A Abboud, P Afshani, TD Ahle, J Alman, A Andoni, A Anshu, S Apers, ... | | |
Virginia Vassilevska WilliamsMITZweryfikowany adres z mit.edu
