In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

We consider several well-studied problems in dynamic algorithms and prove that sufficient
progress on any of them would imply a breakthrough on one of five major open problems in …

In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

Baswana, Gupta and Sen [FOCS'11] showed that fully dynamic maximal matching can be
maintained in general graphs with logarithmic amortized update time. More specifically …

Maximum cardinality matching is a fundamental algorithmic problem with many algorithms
and applications. The fully dynamic version, in which edges are inserted and deleted over …

We present the first data structures that maintain near optimal maximum cardinality and
maximum weighted matchings on sparse graphs in sub linear time per update. Our main …

We present a new approach for finding matchings in dense graphs by building on
Szemerédi's celebrated Regularity Lemma. This allows us to obtain non-trivial albeit slight …

We present a new dynamic matching sparsification scheme. From this scheme we derive a
framework for dynamically rounding fractional matchings against adaptive adversaries …

We present an algorithm for maintaining maximal matching in a graph under addition and
deletion of edges. Our algorithm is randomized and it takes expected amortized O(\logn) …

A maximal matching can be maintained in fully dynamic (supporting both addition and
deletion of edges) n-vertex graphs using a trivial deterministic algorithm with a worst-case …