On the Decision Number of Graphs. - Saieed Akbari; Mina Dalirrooyfard; S. Davodpoor; K. Ehsani; R. Sherkati (CoRR, 2014)

A note on signed k-submatching in graphs. - Saieed Akbari; Mina Dalirrooyfard; K. Ehsani; R. Sherkati (Australas. J Comb., 2016)

A Dynamics for Advertising on Networks. - L. Elisa Celis; Mina Dalirrooyfard; Nisheeth K. Vishnoi (WINE, 2017)

Approximation Algorithms for Min-Distance Problems. - Mina Dalirrooyfard; Virginia Vassilevska Williams; Nikhil Vyas 001; Nicole Wein; Yinzhan Xu; Yuancheng Yu (ICALP, 2019)

Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. - Mina Dalirrooyfard; Virginia Vassilevska Williams; Nikhil Vyas 001; Nicole Wein (ICALP, 2019)

Graph pattern detection: hardness for all induced patterns and faster non-induced cycles. - Mina Dalirrooyfard; Thuy-Duong Vuong; Virginia Vassilevska Williams (STOC, 2019)

New Techniques for Proving Fine-Grained Average-Case Hardness. - Mina Dalirrooyfard; Andrea Lincoln; Virginia Vassilevska Williams (FOCS, 2020)

Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph. - Mina Dalirrooyfard; Virginia Vassilevska Williams (ICALP, 2020)

Distributed Distance Approximation. - Bertie Ancona; Keren Censor-Hillel; Mina Dalirrooyfard; Yuval Efron; Virginia Vassilevska Williams (OPODIS, 2020)

Orientations of graphs avoiding given lists on out-degrees. - Saieed Akbari; Mina Dalirrooyfard; K. Ehsani; Kenta Ozeki; R. Sherkati (J. Graph Theory, 2020)

Approximation Algorithms for Min-Distance Problems in DAGs. - Mina Dalirrooyfard; Jenny Kaufmann (ICALP, 2021)

Tight conditional lower bounds for approximating diameter in directed graphs. - Mina Dalirrooyfard; Nicole Wein (STOC, 2021)

Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles. - Mina Dalirrooyfard; Thuy-Duong Vuong; Virginia Vassilevska Williams (SIAM J. Comput., 2021)

Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. - Mina Dalirrooyfard; Ce Jin 001; Virginia Vassilevska Williams; Nicole Wein (FOCS, 2022)

Induced Cycles and Paths Are Harder Than You Think. - Mina Dalirrooyfard; Virginia Vassilevska Williams (FOCS, 2022)

A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems. - Julia Chuzhoy; Mina Dalirrooyfard; Vadim Grinberg; Zihan Tan (CoRR, 2022)

Finding Patterns, Short Cycles and Long Shortest Paths in Graphs - Mina Dalirrooyfard (2022)

On Diameter Approximation in Directed Graphs. - Amir Abboud; Mina Dalirrooyfard; Ray Li; Virginia Vassilevska Williams (ESA, 2023)

A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems. - Julia Chuzhoy; Mina Dalirrooyfard; Vadim Grinberg; Zihan Tan (ITCS, 2023)

Nearly Tight Bounds For Differentially Private Multiway Cut. - Mina Dalirrooyfard; Slobodan Mitrovic; Yuriy Nevmyvaka (NeurIPS, 2023)

In- or out-of-distribution detection via dual divergence estimation. - Sahil Garg; Sanghamitra Dutta; Mina Dalirrooyfard; Anderson Schneider; Yuriy Nevmyvaka (UAI, 2023)

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 (UAI, 2023)

Listing Cliques from Smaller Cliques. - Mina Dalirrooyfard; Surya Mathialagan; Virginia Vassilevska Williams; Yinzhan Xu (CoRR, 2023)

Nearly Tight Bounds For Differentially Private Min s-t and Multiway Cut. - Mina Dalirrooyfard; Slobodan Mitrovic; Yuriy Nevmyvaka (CoRR, 2023)

Graph Partitioning with a Move Budget. - Mina Dalirrooyfard; Elaheh Fata; Majid Behbahani; Yuriy Nevmyvaka (AISTATS, 2024)

Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models. - Mina Dalirrooyfard; Konstantin Makarychev; Slobodan Mitrovic (ICML, 2024)

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques. - Mina Dalirrooyfard; Surya Mathialagan; Virginia Vassilevska Williams; Yinzhan Xu (STOC, 2024)

Graph Partitioning With Limited Moves. - Majid Behbahani; Mina Dalirrooyfard; Elaheh Fata; Yuriy Nevmyvaka (CoRR, 2024)

Differentially Private Gomory-Hu Trees. - Anders Aamand; Justin Y. Chen; Mina Dalirrooyfard; Slobodan Mitrovic; Yuriy Nevmyvaka; Sandeep Silwal; Yinzhan Xu (CoRR, 2024)

Learning to Abstain From Uninformative Data. - Yikai Zhang 003; Songzhu Zheng; Mina Dalirrooyfard; Pengxiang Wu; Anderson Schneider; Anant Raj; Yuriy Nevmyvaka; Chao Chen 012 (Trans. Mach. Learn. Res., 2024)

Average-Case Hardness of Parity Problems: Orthogonal Vectors, k-SUM and More. - Mina Dalirrooyfard; Andrea Lincoln; Barna Saha; Virginia Vassilevska Williams (SODA, 2025)

Privacy Amplification by Structured Subsampling for Deep Differentially Private Time Series Forecasting. - Jan Schuchardt; Mina Dalirrooyfard; Jed Guzelkabaagac; Anderson Schneider; Yuriy Nevmyvaka; Stephan Günnemann (CoRR, 2025)

Hardness of Approximate Diameter: Now for Undirected Graphs. - Mina Dalirrooyfard; Ray Li; Virginia Vassilevska Williams (J. ACM, 2025)

SPARSE-PIVOT: Dynamic correlation clustering for node insertions. - Mina Dalirrooyfard; Konstantin Makarychev; Slobodan Mitrovic (CoRR, 2025)

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 (CoRR, 2025)