Mina Dalirrooyfard

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 42

Top Topics

Top Venues

Publications

Yikai Zhang, Songzhu Zheng, Mina Dalirrooyfard, Pengxiang Wu, Anderson Schneider, Anant Raj, Yuriy Nevmyvaka, Chao Chen
Learning to Abstain From Uninformative Data. Trans. Mach. Learn. Res. 2024 (2024)
Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic
Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models. CoRR (2024)
Mina Dalirrooyfard, Elaheh Fata, Majid Behbahani, Yuriy Nevmyvaka
Graph Partitioning with a Move Budget. AISTATS (2024)
Majid Behbahani, Mina Dalirrooyfard, Elaheh Fata, Yuriy Nevmyvaka
Graph Partitioning With Limited Moves. CoRR (2024)
Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu
Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques. STOC (2024)
Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka
Nearly Tight Bounds For Differentially Private Multiway Cut. NeurIPS (2023)
Julia Chuzhoy, Mina Dalirrooyfard, Vadim Grinberg, Zihan Tan
A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems. ITCS (2023)
Sahil Garg, Mina Dalirrooyfard, Anderson Schneider, Yeshaya Adler, Yuriy Nevmyvaka, Yu Chen, Fengpei Li, Guillermo A. Cecchi
Information theoretic clustering via divergence maximization among clusters. UAI (2023)
Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka
Nearly Tight Bounds For Differentially Private Min s-t and Multiway Cut. CoRR (2023)
Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu
Listing Cliques from Smaller Cliques. CoRR (2023)
Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
On Diameter Approximation in Directed Graphs. ESA (2023)
Sahil Garg, Sanghamitra Dutta, Mina Dalirrooyfard, Anderson Schneider, Yuriy Nevmyvaka
In- or out-of-distribution detection via dual divergence estimation. UAI (2023)
Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
On Diameter Approximation in Directed Graphs. CoRR (2023)
Yikai Zhang, Songzhu Zheng, Mina Dalirrooyfard, Pengxiang Wu, Anderson Schneider, Anant Raj, Yuriy Nevmyvaka, Chao Chen
Learning to Abstain From Uninformative Data. CoRR (2023)
Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. CoRR (2022)
Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
Hardness of Approximate Diameter: Now for Undirected Graphs. FOCS (2022)
Mina Dalirrooyfard, Virginia Vassilevska Williams
Induced Cycles and Paths Are Harder Than You Think. FOCS (2022)
Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. FOCS (2022)
Julia Chuzhoy, Mina Dalirrooyfard, Vadim Grinberg, Zihan Tan
A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems. CoRR (2022)
Mina Dalirrooyfard, Virginia Vassilevska Williams
Induced Cycles and Paths Are Harder Than You Think. CoRR (2022)
Mina Dalirrooyfard, Nicole Wein
Tight conditional lower bounds for approximating diameter in directed graphs. STOC (2021)
Mina Dalirrooyfard, Thuy Duong Vuong, Virginia Vassilevska Williams
Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles. SIAM J. Comput. 50 (5) (2021)
Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
Hardness of Approximate Diameter: Now for Undirected Graphs. FOCS (2021)
Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams
Hardness of Approximate Diameter: Now for Undirected Graphs. CoRR (2021)
Mina Dalirrooyfard, Jenny Kaufmann
Approximation Algorithms for Min-Distance Problems in DAGs. CoRR (2021)
Mina Dalirrooyfard, Jenny Kaufmann
Approximation Algorithms for Min-Distance Problems in DAGs. ICALP (2021)
Mina Dalirrooyfard, Virginia Vassilevska Williams
Conditionally optimal approximation algorithms for the girth of a directed graph. CoRR (2020)
Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams
Distributed Distance Approximation. OPODIS (2020)
Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams
Distributed Distance Approximation. CoRR (2020)
Saieed Akbari, Mina Dalirrooyfard, K. Ehsani, Kenta Ozeki, R. Sherkati
Orientations of graphs avoiding given lists on out-degrees. J. Graph Theory 93 (4) (2020)
Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams
New Techniques for Proving Fine-Grained Average-Case Hardness. FOCS (2020)
Mina Dalirrooyfard, Nicole Wein
Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs. CoRR (2020)
Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams
New Techniques for Proving Fine-Grained Average-Case Hardness. CoRR (2020)
Mina Dalirrooyfard, Virginia Vassilevska Williams
Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph. ICALP (2020)
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu
Approximation Algorithms for Min-Distance Problems. ICALP (2019)
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. CoRR (2019)
Mina Dalirrooyfard, Thuy Duong Vuong, Virginia Vassilevska Williams
Graph pattern detection: Hardness for all induced patterns and faster non-induced cycles. CoRR (2019)
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu
Approximation Algorithms for Min-Distance Problems. CoRR (2019)
Mina Dalirrooyfard, Thuy Duong Vuong, Virginia Vassilevska Williams
Graph pattern detection: hardness for all induced patterns and faster non-induced cycles. STOC (2019)
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. ICALP (2019)
L. Elisa Celis, Mina Dalirrooyfard, Nisheeth K. Vishnoi
A Dynamics for Advertising on Networks. WINE (2017)
Saieed Akbari, Mina Dalirrooyfard, K. Ehsani, R. Sherkati
A note on signed k-submatching in graphs. Australas. J Comb. 64 (2016)
Saieed Akbari, Mina Dalirrooyfard, S. Davodpoor, K. Ehsani, R. Sherkati
On the Decision Number of Graphs. CoRR (2014)
Saieed Akbari, Mina Dalirrooyfard, K. Ehsani, R. Sherkati
A Note on Signed k-Submatching in Graphs. CoRR (2014)