We present the first algorithm for maintaining a maximal independent set (MIS) of a fully
dynamic graph-which undergoes both edge insertions and deletions-in polylogarithmic time …

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 the first deterministic data structures for maintaining approximate minimum
vertex cover and maximum matching in a fully dynamic graph G=(V,E), with |V|=n and |E|=m …

Many dynamic graph algorithms have an amortized update time, rather than a stronger worst-
case guarantee. But amortized data structures are not suitable for real-time systems, where …

In the dynamic linear program (LP) problem, we are given an LP undergoing updates and
we need to maintain an approximately optimal solution. Recently, significant attention (eg …

By exploring the intelligent cooperation of unmanned aerial vehicle (UAV) swarms, the
formed flying ad-hoc networks (FANETs) can support a variety of collaborative operations …

A maximal independent set (MIS) can be maintained in an evolving m-edge graph by simply
recomputing it from scratch in O (m) time after each update. But can it be maintained in time …

We consider the classic facility location problem in fully dynamic data streams, where
elements can be both inserted and deleted. In this problem, one is interested in maintaining …

We present a framework for deterministically rounding a dynamic fractional matching.
Applying our framework in a black-box manner on top of existing fractional matching …

In the online bipartite matching problem with replacements, all the vertices on one side of
the bipartition are given, and the vertices on the other side arrive one-by-one with all their …