Mina Dalirrooyfard
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
21
Venues
9
Active years
2019–2025
Best venue rank
A*
Where they publish
Papers
21 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | ICML | Breaking the n1.5 Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition. | Anders Aamand, Justin Y. Chen, Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka, Sandeep Silwal, Yinzhan Xu |
| 2025 | ICML | Sparse-pivot: Dynamic correlation clustering for node insertions. | Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic |
| 2025 | ICML | Privacy Amplification by Structured Subsampling for Deep Differentially Private Time Series Forecasting. | Jan Schuchardt, Mina Dalirrooyfard, Jed Guzelkabaagac, Anderson Schneider, Yuriy Nevmyvaka, Stephan Gnnemann |
| 2025 | SODA | Average-Case Hardness of Parity Problems: Orthogonal Vectors, k-SUM and More. | Mina Dalirrooyfard, Andrea Lincoln, Barna Saha, Virginia Vassilevska Williams |
| 2024 | AISTATS | Graph Partitioning with a Move Budget. | Mina Dalirrooyfard, Elaheh Fata, Majid Behbahani, Yuriy Nevmyvaka |
| 2024 | ICML | Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models. | Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic |
| 2024 | STOC | Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques. | Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu |
| 2023 | ESA | On Diameter Approximation in Directed Graphs. | Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams |
| 2023 | UAI | In- or out-of-distribution detection via dual divergence estimation. | Sahil Garg, Sanghamitra Dutta, Mina Dalirrooyfard, Anderson Schneider, Yuriy Nevmyvaka |
| 2023 | UAI | Information theoretic clustering via divergence maximization among clusters. | Sahil Garg, Mina Dalirrooyfard, Anderson Schneider, Yeshaya Adler, Yuriy Nevmyvaka, Yu Chen, Fengpei Li, Guillermo A. Cecchi |
| 2022 | FOCS | Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. | Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein |
| 2022 | FOCS | Induced Cycles and Paths Are Harder Than You Think. | Mina Dalirrooyfard, Virginia Vassilevska Williams |
| 2021 | FOCS | Hardness of Approximate Diameter: Now for Undirected Graphs. | Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams |
| 2021 | ICALP | Approximation Algorithms for Min-Distance Problems in DAGs. | Mina Dalirrooyfard, Jenny Kaufmann |
| 2021 | STOC | Tight conditional lower bounds for approximating diameter in directed graphs. | Mina Dalirrooyfard, Nicole Wein |
| 2020 | FOCS | New Techniques for Proving Fine-Grained Average-Case Hardness. | Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams |
| 2020 | ICALP | Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph. | Mina Dalirrooyfard, Virginia Vassilevska Williams |
| 2020 | OPODIS | Distributed Distance Approximation. | Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams |
| 2019 | ICALP | Approximation Algorithms for Min-Distance Problems. | Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu |
| 2019 | ICALP | Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. | Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein |
| 2019 | STOC | Graph pattern detection: hardness for all induced patterns and faster non-induced cycles. | Mina Dalirrooyfard, Thuy-Duong Vuong, Virginia Vassilevska Williams |