… Hence, we propose the following dynamic algorithms for the dynamic matching problem.
In most implementations (such as Boost [1]) finding an augmenting path starting from a free …

… to use dynamic bipartite matching algorithms as black-box subroutines for dynamic matching
in … We present the first use of dynamic matching algorithms for bipartite graphs to improve …

… to give our algorithms for approximate string matching, dynamic dictionary matching and
dynamic text … is a generalization of the exact string matching algorithm we described above. The …

… dynamic integral matching algorithms to fully-dynamic “approximately-maximal” fractional
matching algorithms… We discuss the dynamic fractional matching algorithm of Bhattacharya et al…

… In the benchmark case that we consider, the matching algorithm can depend on the set of
critical agents at time t. Nonetheless, we extend several of our theorems to the case where the …

… deterministic dynamic algorithms for the maximum matching problem. (1) An algorithm that
… Instead of applying the randomized maximal matching algorithm from [2] for maintaining the …

… dynamic algorithms for maximum cardinality matching in bipartite graphs. Our main result is
a deterministic algorithm that … We have presented the first fully dynamic matching algorithm to …

… and scheduling decisions are made prior to application execution) or dynamic (matching …
new dynamic algorithm, called the hybrid remapper, for improving the initial static matching and …

… The irst polylogarithmic update time dynamic matching algorithm is due to an inluential
work of Onak and Rubinfeld [68], who gave a (large) constant approximation in polylog update …

… bounds that rule out any O(n1-ε) updatetime algorithm [1… of the work in the literature of
dynamic matching has been on … (poly log n) update time algorithms have been known since the …