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 give an algorithm that computes exact maximum flows and minimum-cost flows on
directed graphs with m edges and polynomially bounded integral demands, costs, and …

We give a deterministic m^1+o(1) time algorithm that computes exact maximum flows and
minimum-cost flows on directed graphs with m edges and polynomially bounded integral …

We give an algorithm for computing exact maximum flows on graphs with edges and integer
capacities in the range in time. We use to suppress logarithmic factors in. For sparse graphs …

We introduce a notion for hierarchical graph clustering which we call the expander hierarchy
and show a fully dynamic algorithm for maintaining such a hierarchy on a graph with n …

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 …

Given an input that undergoes a sequence of updates, a dynamic algorithm maintains a
valid solution to some predefined problem at any point in time; the goal is to design an …

Designing dynamic graph algorithms against an adaptive adversary is a major goal in the
field of dynamic graph algorithms. While a few such algorithms are known for spanning …

Dynamic algorithms operate on inputs undergoing updates, eg, insertions or deletions of
edges or vertices. After processing each update, the algorithm has to answer queries …

We present a general toolbox, based on new vertex sparsifiers, for designing data structures
to maintain shortest paths in graphs undergoing edge insertions and/or deletions. In …