We initiate the study of matroid problems in a new oracle model called
d...
In the dynamic approximate maximum bipartite matching problem we are giv...
We settle the complexities of the maximum-cardinality bipartite matching...
We present algorithms that break the Õ(nr)-independence-query bound
for ...
The matroid intersection problem is a fundamental problem that has been
...
The length a(n) of the longest common subsequence of the n'th Thue-Morse...