research
∙
02/20/2023
Fast Algorithms via Dynamic-Oracle Matroids
We initiate the study of matroid problems in a new oracle model called d...
share
research
∙
02/16/2023
Incremental (1-ε)-approximate dynamic matching in O(poly(1/ε)) update time
In the dynamic approximate maximum bipartite matching problem we are giv...
research
∙
08/04/2022
Nearly Optimal Communication and Query Complexity of Bipartite Matching
We settle the complexities of the maximum-cardinality bipartite matching...
research
∙
05/12/2021
Breaking O(nr) for Matroid Intersection
We present algorithms that break the Õ(nr)-independence-query bound for ...
research
∙
02/10/2021
Breaking the Quadratic Barrier for Matroid Intersection
The matroid intersection problem is a fundamental problem that has been ...
research
∙
03/30/2019
