default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMina Dalirrooyfard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2022
[b1]Mina Dalirrooyfard:
Finding Patterns, Short Cycles and Long Shortest Paths in Graphs. MIT, USA, 2022
Journal Articles
- 2024
- [j4]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) - 2021
- [j3]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): 1627-1662 (2021) - 2020
- [j2]Saieed Akbari
, Mina Dalirrooyfard, K. Ehsani, Kenta Ozeki, R. Sherkati:
Orientations of graphs avoiding given lists on out-degrees. J. Graph Theory 93(4): 483-502 (2020) - 2016
- [j1]Saieed Akbari, Mina Dalirrooyfard, K. Ehsani, R. Sherkati:
A note on signed k-submatching in graphs. Australas. J Comb. 64: 341-346 (2016)
Conference and Workshop Papers
- 2024
- [c20]Mina Dalirrooyfard, Elaheh Fata, Majid Behbahani, Yuriy Nevmyvaka:
Graph Partitioning with a Move Budget. AISTATS 2024: 568-576 - [c19]Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic:
Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models. ICML 2024 - [c18]Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques. STOC 2024: 923-934 - 2023
- [c17]Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
On Diameter Approximation in Directed Graphs. ESA 2023: 2:1-2:17 - [c16]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: 38:1-38:23 - [c15]Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka:
Nearly Tight Bounds For Differentially Private Multiway Cut. NeurIPS 2023 - [c14]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: 624-634 - [c13]Sahil Garg, Sanghamitra Dutta, Mina Dalirrooyfard, Anderson Schneider, Yuriy Nevmyvaka:
In- or out-of-distribution detection via dual divergence estimation. UAI 2023: 635-646 - 2022
- [c12]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: 290-300 - [c11]Mina Dalirrooyfard, Virginia Vassilevska Williams:
Induced Cycles and Paths Are Harder Than You Think. FOCS 2022: 531-542 - 2021
- [c10]Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
Hardness of Approximate Diameter: Now for Undirected Graphs. FOCS 2021: 1021-1032 - [c9]Mina Dalirrooyfard, Jenny Kaufmann:
Approximation Algorithms for Min-Distance Problems in DAGs. ICALP 2021: 60:1-60:17 - [c8]Mina Dalirrooyfard, Nicole Wein:
Tight conditional lower bounds for approximating diameter in directed graphs. STOC 2021: 1697-1710 - 2020
- [c7]Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams:
New Techniques for Proving Fine-Grained Average-Case Hardness. FOCS 2020: 774-785 - [c6]Mina Dalirrooyfard, Virginia Vassilevska Williams:
Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph. ICALP 2020: 35:1-35:20 - [c5]Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams:
Distributed Distance Approximation. OPODIS 2020: 30:1-30:17 - 2019
- [c4]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu:
Approximation Algorithms for Min-Distance Problems. ICALP 2019: 46:1-46:14 - [c3]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein:
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. ICALP 2019: 47:1-47:15 - [c2]Mina Dalirrooyfard, Thuy-Duong Vuong, Virginia Vassilevska Williams:
Graph pattern detection: hardness for all induced patterns and faster non-induced cycles. STOC 2019: 1167-1178 - 2017
- [c1]L. Elisa Celis, Mina Dalirrooyfard, Nisheeth K. Vishnoi:
A Dynamics for Advertising on Networks. WINE 2017: 88-102
Informal and Other Publications
- 2024
- [i21]Majid Behbahani, Mina Dalirrooyfard, Elaheh Fata, Yuriy Nevmyvaka:
Graph Partitioning With Limited Moves. CoRR abs/2402.15485 (2024) - [i20]Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic:
Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models. CoRR abs/2402.15668 (2024) - [i19]Anders Aamand, Justin Y. Chen, Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka, Sandeep Silwal, Yinzhan Xu:
Differentially Private Gomory-Hu Trees. CoRR abs/2408.01798 (2024) - 2023
- [i18]Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
On Diameter Approximation in Directed Graphs. CoRR abs/2307.07583 (2023) - [i17]Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Listing Cliques from Smaller Cliques. CoRR abs/2307.15871 (2023) - [i16]Yikai Zhang, Songzhu Zheng, Mina Dalirrooyfard, Pengxiang Wu, Anderson Schneider, Anant Raj, Yuriy Nevmyvaka, Chao Chen:
Learning to Abstain From Uninformative Data. CoRR abs/2309.14240 (2023) - [i15]Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka:
Nearly Tight Bounds For Differentially Private Min s-t and Multiway Cut. CoRR abs/2312.16370 (2023) - 2022
- [i14]Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein:
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. CoRR abs/2204.03076 (2022) - [i13]Mina Dalirrooyfard, Virginia Vassilevska Williams:
Induced Cycles and Paths Are Harder Than You Think. CoRR abs/2209.01873 (2022) - [i12]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 abs/2211.05906 (2022) - 2021
- [i11]Mina Dalirrooyfard, Jenny Kaufmann:
Approximation Algorithms for Min-Distance Problems in DAGs. CoRR abs/2106.02120 (2021) - [i10]Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
Hardness of Approximate Diameter: Now for Undirected Graphs. CoRR abs/2106.06026 (2021) - 2020
- [i9]Mina Dalirrooyfard, Virginia Vassilevska Williams:
Conditionally optimal approximation algorithms for the girth of a directed graph. CoRR abs/2004.11445 (2020) - [i8]Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams:
New Techniques for Proving Fine-Grained Average-Case Hardness. CoRR abs/2008.06591 (2020) - [i7]Mina Dalirrooyfard, Nicole Wein:
Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs. CoRR abs/2011.03892 (2020) - [i6]Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams:
Distributed Distance Approximation. CoRR abs/2011.05066 (2020) - 2019
- [i5]Mina Dalirrooyfard, Thuy-Duong Vuong, Virginia Vassilevska Williams:
Graph pattern detection: Hardness for all induced patterns and faster non-induced cycles. CoRR abs/1904.03741 (2019) - [i4]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein:
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. CoRR abs/1904.11601 (2019) - [i3]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu:
Approximation Algorithms for Min-Distance Problems. CoRR abs/1904.11606 (2019) - 2014
- [i2]Saieed Akbari, Mina Dalirrooyfard, S. Davodpoor, K. Ehsani, R. Sherkati:
On the Decision Number of Graphs. CoRR abs/1402.0134 (2014) - [i1]Saieed Akbari, Mina Dalirrooyfard, K. Ehsani, R. Sherkati:
A Note on Signed k-Submatching in Graphs. CoRR abs/1411.0132 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
