| 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 | 31 | 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 | 22 | 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 | 17 | 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 | 15 | 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 | 12 | 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 | 11 | 2019 |
| Distributed distance approximation B Ancona, K Censor-Hillel, M Dalirrooyfard, Y Efron, VV Williams arXiv preprint arXiv:2011.05066, 2020 | 9 | 2020 |
| Conditionally optimal approximation algorithms for the girth of a directed graph M Dalirrooyfard, VV Williams arXiv preprint arXiv:2004.11445, 2020 | 9 | 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 | 7 | 2022 |
| 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 | 6 | 2020 |
| Approximation algorithms for min-distance problems in dags M Dalirrooyfard, J Kaufmann arXiv preprint arXiv:2106.02120, 2021 | 5 | 2021 |
| 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 | 4 | 2022 |
| Listing Cliques from Smaller Cliques M Dalirrooyfard, S Mathialagan, VV Williams, Y Xu arXiv preprint arXiv:2307.15871, 2023 | 1 | 2023 |
| Nearly Tight Bounds For Differentially Private Multiway Cut M Dalirrooyfard, S Mitrovic, Y Nevmyvaka Thirty-seventh Conference on Neural Information Processing Systems, 2023 | | 2023 |
| Learning to Abstain From Uninformative Data Y Zhang, S Zheng, M Dalirrooyfard, P Wu, A Schneider, A Raj, ... arXiv preprint arXiv:2309.14240, 2023 | | 2023 |
| On Diameter Approximation in Directed Graphs A Abboud, M Dalirrooyfard, R Li, V Vassilevska-Williams arXiv preprint arXiv:2307.07583, 2023 | | 2023 |
| Information theoretic clustering via divergence maximization among clusters S Garg, M Dalirrooyfard, A Schneider, Y Adler, Y Nevmyvaka, Y Chen, ... Uncertainty in Artificial Intelligence, 624-634, 2023 | | 2023 |
| In-or out-of-distribution detection via dual divergence estimation S Garg, S Dutta, M Dalirrooyfard, A Schneider, Y Nevmyvaka Uncertainty in Artificial Intelligence, 635-646, 2023 | | 2023 |
| 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 |
Virginia Vassilevska WilliamsMITZweryfikowany adres z mit.edu
