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 …

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 consider the classical Minimum Balanced Cut problem: given a graph G, compute a
partition of its vertices into two subsets of roughly equal volume, while minimizing the …

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 …

In the single-source shortest paths problem, the goal is to compute the shortest path tree
from a designated source vertex in a weighted, directed graph. We present the first near …

We study the problem of graph clustering where the goal is to partition a graph into clusters,
ie disjoint subsets of vertices, such that each cluster is well connected internally while …

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 …

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 …