Soheil Behnezhad

Available identifiers

Publication	Date of Publication	Type
Fully dynamic matching: \((2 - \sqrt{2})\)-approximation in polylog update time	2024-11-28	Paper
Robust communication complexity of matching: EDCS achieves 5/6 approximation	2024-11-14	Paper
Stochastic vertex cover with few queries	2024-07-19	Paper
New trade-offs for fully dynamic matching via hierarchical EDCS	2024-07-19	Paper
Dynamic algorithms for maximum matching size	2024-05-14	Paper
Single-pass streaming algorithms for correlation clustering	2024-05-14	Paper
Beating greedy matching in sublinear time	2024-05-14	Paper
On regularity lemma and barriers in streaming and dynamic matching	2024-05-08	Paper
Sublinear time algorithms and complexity of approximate maximum matching	2024-05-08	Paper
Fast and Simple Solutions of Blotto Games	2024-03-12	Paper
On the Robust Communication Complexity of Bipartite Matching	2023-11-20	Paper
https://portal.mardi4nfdi.de/entity/Q5075750	2022-05-11	Paper
Brief Announcement: MapReduce Algorithms for Massive Trees	2021-07-28	Paper
Fully Dynamic Matching: Beating 2-Approximation in Δ^ϵ Update Time	2021-02-02	Paper
Massively Parallel Computation of Matching and MIS in Sparse Graphs	2021-01-20	Paper
Stochastic matching with few queries: (1-ε) approximation	2021-01-19	Paper
Stochastic matching on uniformly sparse graphs	2020-02-04	Paper
Stochastic Matching with Few Queries: New Algorithms and Tools	2019-10-15	Paper
https://portal.mardi4nfdi.de/entity/Q4608043	2018-03-15	Paper

This page was built for person: Soheil Behnezhad