Alireza Farhadi | DeepAI

DeepAI AI Chat

Featured Co-authors

Ryan A. Rossi
57 publications
MohammadTaghi Hajiaghayi
47 publications
Kasper Green Larsen
38 publications
Aviad Rubinstein
36 publications
Soheil Behnezhad
28 publications
Anup Rao
26 publications
Tung Mai
20 publications
Rad Niazadeh
19 publications
Saeed Seddighin
19 publications
Balasubramanian Sivan
19 publications
Elaine Shi
18 publications

∙ 10/31/2022

Beating (1-1/e)-Approximation for Weighted Stochastic Matching

In the stochastic weighted matching problem, the goal is to find a large...

0 Mahsa Derakhshan, et al. ∙

∙ 05/29/2022

Generalized Stochastic Matching

In this paper, we generalize the recently studied Stochastic Matching pr...

0 Alireza Farhadi, et al. ∙

∙ 10/13/2021

Online Bipartite Matching with Reusable Resources

We study the classic online bipartite matching problem with a twist: off...

0 Steven Delong, et al. ∙

∙ 06/01/2021

Differentially Private Densest Subgraph

Given a graph, the densest subgraph problem asks for a set of vertices s...

0 Alireza Farhadi, et al. ∙

∙ 07/14/2020

Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings

Envy-free up to one good (EF1) and envy-free up to any good (EFX) are tw...

0 Alireza Farhadi, et al. ∙

∙ 02/26/2020

Asymmetric Streaming Algorithms for Edit Distance and LCS

The edit distance (ED) and longest common subsequence (LCS) are two fund...

0 Alireza Farhadi, et al. ∙

∙ 02/26/2020

Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS

The edit distance (ED) and longest common subsequence (LCS) are two fund...

0 Alireza Farhadi, et al. ∙

∙ 12/22/2019

Approximate Maximum Matching in Random Streams

In this paper, we study the problem of finding a maximum matching in the...

0 Alireza Farhadi, et al. ∙

∙ 11/09/2018

Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs

The k-cut problem asks, given a connected graph G and a positive integer...

0 MohammadHossein Bateni, et al. ∙

∙ 11/08/2018

Stochastic Matching with Few Queries: New Algorithms and Tools

We consider the following stochastic matching problem on both weighted a...

0 Soheil Behnezhad, et al. ∙

∙ 11/04/2018

Lower Bounds for External Memory Integer Sorting via Network Coding

Sorting extremely large datasets is a frequently occuring task in practi...

0 Alireza Farhadi, et al. ∙

∙ 09/30/2017

On the Complexity of Chore Division

We study the proportional chore division problem where a protocol wants ...

0 Alireza Farhadi, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world