Mina Dalirrooyfard

56 papers A* 17A 5B 1Journal 30Unranked 2
YearRankTypeTitle / Venue / Authors
2026 — conf
A Simple Average-case Analysis of Recursive Randomized Greedy MIS.
SOSA
Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic
2025 A* conf
Average-Case Hardness of Parity Problems: Orthogonal Vectors, k-SUM and More.
SODA
Mina Dalirrooyfard, Andrea Lincoln, Barna Saha, Virginia Vassilevska Williams
2025 J jnl
Average-Case Hardness of Parity Problems: Orthogonal Vectors, k-SUM and More.
CoRR
Mina Dalirrooyfard, Andrea Lincoln, Barna Saha, Virginia Vassilevska Williams
2025 J jnl
Breaking the n
CoRR
Anders Aamand, Justin Y. Chen, Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka, Sandeep Silwal, Yinzhan Xu
2025 A* conf
Breaking the n1.5 Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition.
ICML
Anders Aamand, Justin Y. Chen, Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka, Sandeep Silwal, Yinzhan Xu
2025 J jnl
Hardness of Approximate Diameter: Now for Undirected Graphs.
J. ACM
Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
2025 A* conf
Privacy Amplification by Structured Subsampling for Deep Differentially Private Time Series Forecasting.
ICML
Jan Schuchardt, Mina Dalirrooyfard, Jed Guzelkabaagac, Anderson Schneider, Yuriy Nevmyvaka, Stephan Günnemann
2025 J jnl
Privacy Amplification by Structured Subsampling for Deep Differentially Private Time Series Forecasting.
CoRR
Jan Schuchardt, Mina Dalirrooyfard, Jed Guzelkabaagac, Anderson Schneider, Yuriy Nevmyvaka, Stephan Günnemann
2025 J jnl
SPARSE-PIVOT: Dynamic correlation clustering for node insertions.
CoRR
Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic
2025 A* conf
Sparse-pivot: Dynamic correlation clustering for node insertions.
ICML
Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic
2024 J jnl
Differentially Private Gomory-Hu Trees.
CoRR
Anders Aamand, Justin Y. Chen, Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka, Sandeep Silwal, Yinzhan Xu
2024 J jnl
Graph Partitioning With Limited Moves.
CoRR
Majid Behbahani, Mina Dalirrooyfard, Elaheh Fata, Yuriy Nevmyvaka
2024 A conf
Graph Partitioning with a Move Budget.
AISTATS
Mina Dalirrooyfard, Elaheh Fata, Majid Behbahani, Yuriy Nevmyvaka
2024 J jnl
Learning to Abstain From Uninformative Data.
Trans. Mach. Learn. Res.
Yikai Zhang, Songzhu Zheng, Mina Dalirrooyfard, Pengxiang Wu, Anderson Schneider, Anant Raj, Yuriy Nevmyvaka, Chao Chen
2024 A* conf
Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models.
ICML
Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic
2024 J jnl
Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models.
CoRR
Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic
2024 A* conf
Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques.
STOC
Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu
2023 A conf
A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems.
ITCS
Julia Chuzhoy, Mina Dalirrooyfard, Vadim Grinberg, Zihan Tan
2023 A conf
In- or out-of-distribution detection via dual divergence estimation.
UAI
Sahil Garg, Sanghamitra Dutta, Mina Dalirrooyfard, Anderson Schneider, Yuriy Nevmyvaka
2023 A conf
Information theoretic clustering via divergence maximization among clusters.
UAI
Sahil Garg, Mina Dalirrooyfard, Anderson Schneider, Yeshaya Adler, Yuriy Nevmyvaka, Yu Chen, Fengpei Li, Guillermo A. Cecchi
2023 J jnl
Learning to Abstain From Uninformative Data.
CoRR
Yikai Zhang, Songzhu Zheng, Mina Dalirrooyfard, Pengxiang Wu, Anderson Schneider, Anant Raj, Yuriy Nevmyvaka, Chao Chen
2023 J jnl
Listing Cliques from Smaller Cliques.
CoRR
Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu
2023 J jnl
Nearly Tight Bounds For Differentially Private Min s-t and Multiway Cut.
CoRR
Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka
2023 A* conf
Nearly Tight Bounds For Differentially Private Multiway Cut.
NeurIPS
Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka
2023 A conf
On Diameter Approximation in Directed Graphs.
ESA
Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
2023 J jnl
On Diameter Approximation in Directed Graphs.
CoRR
Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
2022 J jnl
A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems.
CoRR
Julia Chuzhoy, Mina Dalirrooyfard, Vadim Grinberg, Zihan Tan
2022 A* conf
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles.
FOCS
Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein
2022 J jnl
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles.
CoRR
Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein
2022 — —
Finding Patterns, Short Cycles and Long Shortest Paths in Graphs
Mina Dalirrooyfard
2022 A* conf
Induced Cycles and Paths Are Harder Than You Think.
FOCS
Mina Dalirrooyfard, Virginia Vassilevska Williams
2022 J jnl
Induced Cycles and Paths Are Harder Than You Think.
CoRR
Mina Dalirrooyfard, Virginia Vassilevska Williams
2021 A* conf
Approximation Algorithms for Min-Distance Problems in DAGs.
ICALP
Mina Dalirrooyfard, Jenny Kaufmann
2021 J jnl
Approximation Algorithms for Min-Distance Problems in DAGs.
CoRR
Mina Dalirrooyfard, Jenny Kaufmann
2021 J jnl
Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles.
SIAM J. Comput.
Mina Dalirrooyfard, Thuy-Duong Vuong, Virginia Vassilevska Williams
2021 A* conf
Hardness of Approximate Diameter: Now for Undirected Graphs.
FOCS
Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
2021 J jnl
Hardness of Approximate Diameter: Now for Undirected Graphs.
CoRR
Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
2021 A* conf
Tight conditional lower bounds for approximating diameter in directed graphs.
STOC
Mina Dalirrooyfard, Nicole Wein
2020 A* conf
Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph.
ICALP
Mina Dalirrooyfard, Virginia Vassilevska Williams
2020 J jnl
Conditionally optimal approximation algorithms for the girth of a directed graph.
CoRR
Mina Dalirrooyfard, Virginia Vassilevska Williams
2020 B conf
Distributed Distance Approximation.
OPODIS
Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams
2020 J jnl
Distributed Distance Approximation.
CoRR
Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams
2020 A* conf
New Techniques for Proving Fine-Grained Average-Case Hardness.
FOCS
Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams
2020 J jnl
New Techniques for Proving Fine-Grained Average-Case Hardness.
CoRR
Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams
2020 J jnl
Orientations of graphs avoiding given lists on out-degrees.
J. Graph Theory
Saieed Akbari, Mina Dalirrooyfard, K. Ehsani, Kenta Ozeki, R. Sherkati
2020 J jnl
Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs.
CoRR
Mina Dalirrooyfard, Nicole Wein
2019 A* conf
Approximation Algorithms for Min-Distance Problems.
ICALP
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu
2019 J jnl
Approximation Algorithms for Min-Distance Problems.
CoRR
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu
2019 J jnl
Graph pattern detection: Hardness for all induced patterns and faster non-induced cycles.
CoRR
Mina Dalirrooyfard, Thuy-Duong Vuong, Virginia Vassilevska Williams
2019 A* conf
Graph pattern detection: hardness for all induced patterns and faster non-induced cycles.
STOC
Mina Dalirrooyfard, Thuy-Duong Vuong, Virginia Vassilevska Williams
2019 A* conf
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems.
ICALP
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein
2019 J jnl
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems.
CoRR
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein
2017 — conf
A Dynamics for Advertising on Networks.
WINE
L. Elisa Celis, Mina Dalirrooyfard, Nisheeth K. Vishnoi
2016 J jnl
A note on signed k-submatching in graphs.
Australas. J Comb.
Saieed Akbari, Mina Dalirrooyfard, K. Ehsani, R. Sherkati
2014 J jnl
A Note on Signed k-Submatching in Graphs.
CoRR
Saieed Akbari, Mina Dalirrooyfard, K. Ehsani, R. Sherkati
2014 J jnl
On the Decision Number of Graphs.
CoRR
Saieed Akbari, Mina Dalirrooyfard, S. Davodpoor, K. Ehsani, R. Sherkati