2 citations · 5 across the 8 of their papers we have counts for
3 papers · 1 filter
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs
MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi
The -cut problem asks, given a connected graph and a positive integer , to find a minimum-weight set of edges whose removal splits into connected components. We g…
Stochastic Matching with Few Queries: New Algorithms and Tools
Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi +1
We consider the following stochastic matching problem on both weighted and unweighted graphs: A graph along with a parameter is given in the input. Each ed…
Lower Bounds for External Memory Integer Sorting via Network Coding
Alireza Farhadi, MohammadTaghi Hajiaghayi, Kasper Green Larsen +1
Sorting extremely large datasets is a frequently occuring task in practice. These datasets are usually much larger than the computer's main memory; thus external memory sorting alg…