
Differentially Private Densest Subgraph
Given a graph, the densest subgraph problem asks for a set of vertices s...
read it

Almost Envyfreeness, Envyrank, and Nash Social Welfare Matchings
Envyfree up to one good (EF1) and envyfree up to any good (EFX) are tw...
read it

Asymmetric Streaming Algorithms for Edit Distance and LCS
The edit distance (ED) and longest common subsequence (LCS) are two fund...
read it

Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS
The edit distance (ED) and longest common subsequence (LCS) are two fund...
read it

Approximate Maximum Matching in Random Streams
In this paper, we study the problem of finding a maximum matching in the...
read it

Polynomialtime Approximation Scheme for Minimum kcut in Planar and Minorfree Graphs
The kcut problem asks, given a connected graph G and a positive integer...
read it

Stochastic Matching with Few Queries: New Algorithms and Tools
We consider the following stochastic matching problem on both weighted a...
read it

Lower Bounds for External Memory Integer Sorting via Network Coding
Sorting extremely large datasets is a frequently occuring task in practi...
read it

On the Complexity of Chore Division
We study the proportional chore division problem where a protocol wants ...
read it
Alireza Farhadi
is this you? claim profile