We study fully dynamic algorithms for maximum matching. This is a well-studied problem,
known to admit several update-time/approximation trade-offs. For instance, it is known how …

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 a general framework of designing efficient dynamic approximate algorithms for
optimization problems on undirected graphs. In particular, we develop a technique that …

This article studies the fundamental problem of graph coloring in fully dynamic graphs. Since
the problem of computing an optimal coloring, or even approximating it to within n1-ε for any …

The maximum matching problem in dynamic graphs subject to edge updates (insertions and
deletions) has received much attention over the last few years; a multitude of …

We study the maximum matching problem in fully dynamic graphs: a graph is undergoing
both edge insertions and deletions, and the goal is to efficiently maintain a large matching …

In their breakthrough ICALP'15 paper, Bernstein and Stein presented an algorithm for
maintaining a (3/2+ ε)-approximate maximum matching in fully dynamic bipartite graphs with …

In the LOCAL model of distributed computing, low-diameter decomposition is an extremely
useful tool in designing algorithms, as it allows us to shift from the general graph setting to …

Toward better approximation for the minimum-weighted vertex cover (MWVC) problem in
multiagent systems, we present a distributed algorithm from the perspective of learning in …

Suppose we are given an $ n $-node, $ m $-edge input graph $ G $, and the goal is to
compute a spanning subgraph $ H $ on $ O (n) $ edges. This can be achieved in linear $ O …