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 …

In this paper we provide new randomized algorithms with improved runtimes for solving
linear programs with two-sided constraints. In the special case of the minimum cost flow …

We present an ̃O(m+n^1.5)-time randomized algorithm for maximum cardinality bipartite
matching and related problems (eg transshipment, negative-weight shortest paths, and …

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 …

Let G=(V, E, w) be a weighted, directed graph subject to a sequence of adversarial edge
deletions. In the decremental single-source reachability problem (SSR), we are given a fixed …

In the decremental single-source shortest paths problem, the goal is to maintain distances
from a fixed source s to every vertex v in an m-edge graph undergoing edge deletions. In …

We present a randomized algorithm that computes single-source shortest paths (SSSP) in
O\left(m\log^8(n)\logW\right) time when edge weights are integral and can be negative. 1 …

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 …

We make several advances broadly related to the maintenance of electrical flows in
weighted graphs undergoing dynamic resistance updates, including:(1) More efficient …

We study the decremental All-Pairs Shortest Paths (APSP) problem in undirected edge-
weighted graphs. The input to the problem is an undirected n-vertex m-edge graph G with …