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 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 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 present an algorithm which given any m-edge directed graph with positive integer
capacities at most U, vertices a and b, and an approximation parameter ϵ∈(0,1) computes …

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 …

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

We give an ̃O(m^3/2-1/762\log(U+W)) time algorithm for minimum cost flow with capacities
bounded by U and costs bounded by W. For sparse graphs with general capacities, this is …

The maximum bipartite matching problem is among the most fundamental and well-studied
problems in combinatorial optimization. A beautiful and celebrated combinatorial algorithm …