Mina Dalirrooyfard

According to our database, Mina Dalirrooyfard authored at least 27 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models.

Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic

CoRR, 2024

Graph Partitioning With Limited Moves.

Majid Behbahani, Mina Dalirrooyfard, Elaheh Fata, Yuriy Nevmyvaka

CoRR, 2024

2023

Nearly Tight Bounds For Differentially Private Min s-t and Multiway Cut.

Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka

CoRR, 2023

Learning to Abstain From Uninformative Data.

Yikai Zhang, Songzhu Zheng, Mina Dalirrooyfard, Pengxiang Wu, Anderson Schneider, Anant Raj, Yuriy Nevmyvaka, Chao Chen

CoRR, 2023

Listing Cliques from Smaller Cliques.

Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu

CoRR, 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

Proceedings of the Uncertainty in Artificial Intelligence, 2023

In- or out-of-distribution detection via dual divergence estimation.

Sahil Garg, Sanghamitra Dutta, Mina Dalirrooyfard, Anderson Schneider, Yuriy Nevmyvaka

Proceedings of the Uncertainty in Artificial Intelligence, 2023

Nearly Tight Bounds For Differentially Private Multiway Cut.

Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 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

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

On Diameter Approximation in Directed Graphs.

Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

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

Induced Cycles and Paths Are Harder Than You Think.

Mina Dalirrooyfard, Virginia Vassilevska Williams

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles.

Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

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

Tight conditional lower bounds for approximating diameter in directed graphs.

Mina Dalirrooyfard, Nicole Wein

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Approximation Algorithms for Min-Distance Problems in DAGs.

Mina Dalirrooyfard, Jenny Kaufmann

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Hardness of Approximate Diameter: Now for Undirected Graphs.

Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Orientations of graphs avoiding given lists on out-degrees.

Saieed Akbari, Mina Dalirrooyfard, K. Ehsani, Kenta Ozeki, R. Sherkati

J. Graph Theory, 2020

Distributed Distance Approximation.

Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams

Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph.

Mina Dalirrooyfard, Virginia Vassilevska Williams

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

New Techniques for Proving Fine-Grained Average-Case Hardness.

Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Graph pattern detection: hardness for all induced patterns and faster non-induced cycles.

Mina Dalirrooyfard, Thuy-Duong Vuong, Virginia Vassilevska Williams

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems.

Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Approximation Algorithms for Min-Distance Problems.

Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2017

A Dynamics for Advertising on Networks.

L. Elisa Celis, Mina Dalirrooyfard, Nisheeth K. Vishnoi

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

2016

A note on signed k-submatching in graphs.

Saieed Akbari, Mina Dalirrooyfard, K. Ehsani, R. Sherkati

Australas. J Comb., 2016

2014

On the Decision Number of Graphs.

Saieed Akbari, Mina Dalirrooyfard, S. Davodpoor, K. Ehsani, R. Sherkati

CoRR, 2014